A simple discernibility matrix for attribute reduction in formal concept analysis based on granular concepts

被引:9
作者
Li, Lei-Jun [1 ,2 ]
Li, Mei-Zheng [3 ,4 ]
Mi, Ju-Sheng [1 ,2 ]
Xie, Bin [3 ,4 ]
机构
[1] Hebei Normal Univ, Coll Math & Informat Sci, Shijiazhuang, Hebei, Peoples R China
[2] Hebei Normal Univ, Hebei Key Lab Computat Math & Applicat, Shijiazhuang, Hebei, Peoples R China
[3] Hebei Normal Univ, Coll Informat Technol, Shijiazhuang, Hebei, Peoples R China
[4] Hebei Normal Univ, Hebei Key Lab Network & Informat Secur, Shijiazhuang, Hebei, Peoples R China
基金
中国国家自然科学基金;
关键词
Formal concept analysis; concept lattice; attribute reduction; discernibility matrix; granular concept; CONCEPT LATTICES; KNOWLEDGE REDUCTION; DISCOVERY; GRAPH;
D O I
10.3233/JIFS-190436
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Attribute reduction is one of the crucial issues in Formal Concept Analysis. Discernibility matrix plays an important role in attribute reduction, and has been achieved many successful applications in different concept lattice models. Nevertheless, it requires the construction of the concept lattice before the discernibility matrices are computed when applying traditional approaches, which is both time and space consuming. Furthermore, in some discernibility matrices, the comparisons between every two concepts result in a high computation complexity. To address these problems, granular concepts, i.e., the object concepts and the attribute concepts, are considered in this paper, and a simple discernibility matrix named Object-Attribute discernibility matrix is proposed. It averts the construction of the whole concept lattice and the comparisons between every two concepts. Consequently, the time complexity is greatly reduced, and a lot of storage space can also be saved. Theoretical analysis and experimental results show the efficiency of Object-Attribute discernibility matrix.
引用
收藏
页码:4325 / 4337
页数:13
相关论文
共 44 条
[1]  
[Anonymous], 1999, FORMAL CONCEPT ANAL
[2]  
[Anonymous], 2013, INT J WAVEL MULTIRES
[3]  
Carpineto C, 1996, MACH LEARN, V24, P95
[4]   A fast attribute reduction method for large formal decision contexts [J].
Chen, Jinkun ;
Mi, Jusheng ;
Xie, Bin ;
Lin, Yaojin .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2019, 106 :1-17
[5]   A graph approach for knowledge reduction in formal contexts [J].
Chen, Jinkun ;
Mi, Jusheng ;
Lin, Yaojin .
KNOWLEDGE-BASED SYSTEMS, 2018, 148 :177-188
[6]  
Cole R, 2003, APPL ARTIF INTELL, V17, P257, DOI [10.1080/713827120, 10.1080/08839510390187170]
[7]   Concept lattices reduction: Definition, analysis and classification [J].
Dias, Sergio M. ;
Vieira, Newton J. .
EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (20) :7084-7097
[8]   Characterizing reducts in multi-adjoint concept lattices [J].
Eugenia Cornejo, M. ;
Medina, Jesus ;
Ramirez-Poussa, Eloisa .
INFORMATION SCIENCES, 2018, 422 :364-376
[9]   Mining gene expression data with pattern structures in formal concept analysis [J].
Kaytoue, Mehdi ;
Kuznetsov, Sergei O. ;
Napoli, Arnedeo ;
Duplessis, Sebastien .
INFORMATION SCIENCES, 2011, 181 (10) :1989-2001
[10]   On attribute reduction in concept lattices: The polynomial time discernibility matrix-based method becomes the CR-method [J].
Konecny, Jan ;
Krajca, Petr .
INFORMATION SCIENCES, 2019, 491 :48-62