A knowledge reduction approach for linguistic concept formal context

被引:30
作者
Zou, Li [1 ]
Pang, Kuo [1 ]
Song, Xiaoying [1 ]
Kang, Ning [1 ]
Liu, Xin [2 ]
机构
[1] Liaoning Normal Univ, Sch Comp & Informat Technol, Dalian, Peoples R China
[2] Liaoning Normal Univ, Sch Math, Dalian, Peoples R China
关键词
Linguistic concept formal context; Knowledge reduction; Incomplete linguistic concept formal context; Boolean factor analysis; APPROXIMATE CONCEPT CONSTRUCTION; ATTRIBUTE REDUCTION; CONCEPT LATTICES; DECISION-MAKING; ROUGH SETS; TERM SETS; 3-WAY; MATRIX;
D O I
10.1016/j.ins.2020.03.002
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Formal concept analysis (FCA) has been widely studied as an important tool for data processing and knowledge discovery. The present work focuses on FCA under uncertainty while the attributes are described with linguistic terms or attribute description are incomplete. Accordingly, a linguistic concept formal context is introduced first. With an attempt of knowledge reduction, the multi-granularity similarity relationship between linguistic concepts is defined on the basis of granular computing which further divides the linguistic concept set into three parts under lambda-granularity (i.e., core linguistic concept, unnecessary linguistic concept, and relative necessary linguistic concept). A multi-granularity linguistic reduction algorithm of incomplete linguistic concept formal context is then introduced. To handle the incompleteness, a new algorithm to complete the incomplete linguistic concept formal context based on the closeness degree between fuzzy objects is proposed. Finally, based on the Boolean matrix and Boolean factor analysis method, the linguistic concept knowledge reduction algorithm to extract the core linguistic concept and reduce the scale of linguistic concept lattice is proposed to handle the complexity, which is achieved by computing the similarity of linguistic concept knowledge in order to handle different types of linguistic information and concept knowledge. The effectiveness and practicability of the proposed model are illustrated by examples. (C) 2020 Elsevier Inc. All rights reserved.
引用
收藏
页码:165 / 183
页数:19
相关论文
共 47 条
[1]  
[Anonymous], 1982, ORDERD SETS D
[2]  
[Anonymous], MATH PRACT THEORY
[3]  
[Anonymous], KNOWL INF SYST
[4]  
[Anonymous], INF SCI
[5]  
[Anonymous], 2016 INT C MACH LEAR
[6]  
[Anonymous], SCI SIN INFORM
[7]   From-below approximations in Boolean matrix factorization: Geometry and new algorithm [J].
Belohlavek, Radim ;
Trnecka, Martin .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2015, 81 (08) :1678-1697
[8]   Discovery of optimal factors in binary data via a novel method of matrix decomposition [J].
Belohlavek, Radim ;
Vychodil, Vilem .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2010, 76 (01) :3-20
[9]   Genetic generation of fuzzy systems with rule extraction using formal concept analysis [J].
Cintra, M. E. ;
Camargo, H. A. ;
Monard, M. C. .
INFORMATION SCIENCES, 2016, 349 :199-215
[10]   A semantic approach to concept lattice-based information retrieval [J].
Codocedo, Victor ;
Lykourentzou, Ioanna ;
Napoli, Amedeo .
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2014, 72 (1-2) :169-195