期刊
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS
卷 11, 期 3, 页码 643-656出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s13042-019-01022-4
关键词
Formal fuzzy contexts; Fuzzy relation matrix; Granular computing; Join-irreducible elements; Knowledge reduction
Knowledge reduction is an important issue in formal fuzzy contexts, which can simplify the structure of concept lattices. In this paper, a novel granular matrix-based for knowledge reduction of crisp-fuzzy concept is investigated. Firstly, matrix representations of extents and intents of concepts are defined, respectively, which are used to characterize the join-irreducible elements and propose the corresponding algorithm. In this framework, granular consistent set and granular reduct are developed. Then the judgement theorem of reduction and its corresponding algorithm in formal fuzzy context are proposed. Furthermore, we generalize the matrix approach to formal fuzzy decision contexts. Finally, numerical experiments are conducted to evaluate the effectiveness of the proposed approaches. Our methods present a new framework for knowledge reduction in formal fuzzy contexts.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据