Concept Lattice Simplification in Formal Concept Analysis Using Attribute Clustering

In Formal Concept Analysis (FCA), a concept lattice graphically portrays the underlying relationships between the objects and attributes of an information system. One of the key complexity problems of concept lattices lies in extracting the useful information. The unorganized nature of attributes in huge contexts often does not yield an informative lattice in FCA. Moreover, understanding the collective relationships between attributes and objects in a larger many valued context is more complicated. In this paper, we introduce a novel approach for deducing a smaller and meaningful concept lattice from which excerpts of concepts can be inferred. In existing attribute-based concept lattice reduction methods for FCA, mostly either the attribute size or the context size is reduced. Our approach involves in organizing the attributes into clusters using their structural similarities and dissimilarities, which is commonly known as attribute clustering, to produce a derived context. We have observed that the deduced concept lattice inherits the structural relationship of the original one. Furthermore, we have mathematically proved that a unique surjective inclusion mapping from the original lattice to the deduced one exists.

[1]  Yuhua Qian,et al.  Concept learning via granular computing: A cognitive viewpoint , 2014, Information Sciences.

[2]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[3]  Ming-Wen Shao,et al.  Reduction method for concept lattices based on rough set theory and its application , 2007, Comput. Math. Appl..

[4]  Trevor P. Martin,et al.  A general approach to the measurement of change in fuzzy concept lattices , 2013, Soft Computing.

[5]  Aleksey Buzmakov,et al.  SOFIA: How to Make FCA Polynomial? , 2015, FCA4AI@IJCAI.

[6]  Dominik Slezak,et al.  Utilization of attribute clustering methods for scalable computation of reducts from high-dimensional data , 2012, 2012 Federated Conference on Computer Science and Information Systems (FedCSIS).

[7]  Pascal Hitzler,et al.  Morphisms in Context , 2005, ICCS.

[8]  Cherukuri Aswani Kumar,et al.  FUZZY CLUSTERING-BASED FORMAL CONCEPT ANALYSIS FOR ASSOCIATION RULES MINING , 2012, Appl. Artif. Intell..

[9]  Rui Xu,et al.  Survey of clustering algorithms , 2005, IEEE Transactions on Neural Networks.

[10]  Ch. Aswanikumar,et al.  Concept lattice reduction using fuzzy K-Means clustering , 2010, Expert Syst. Appl..

[11]  Cherukuri Aswani Kumar,et al.  Knowledge discovery in data using formal concept analysis and random projections , 2011, Int. J. Appl. Math. Comput. Sci..

[12]  Ch. Aswani Kumar,et al.  A comprehensive overview on the foundations of formal concept analysis , 2017 .

[13]  Bénédicte Le Grand,et al.  Browsing Large Concept Lattices through Tree Extraction and Reduction Methods , 2013, Int. J. Intell. Inf. Technol..

[14]  Yee Leung,et al.  Granular Computing and Knowledge Reduction in Formal Contexts , 2009, IEEE Transactions on Knowledge and Data Engineering.

[15]  Gerd Stumme,et al.  Computing iceberg concept lattices with T , 2002, Data Knowl. Eng..

[16]  Hernán Astudillo,et al.  Cheating to achieve Formal Concept Analysis over a Large Formal Context , 2011, CLA.

[17]  Zhou Wen,et al.  Concept reduction on interval formal concept analysis , 2010, 9th IEEE International Conference on Cognitive Informatics (ICCI'10).

[18]  Ch. Aswani Kumar,et al.  MINING ASSOCIATIONS IN HEALTH CARE DATA USING FORMAL CONCEPT ANALYSIS AND SINGULAR VALUE DECOMPOSITION , 2010 .

[19]  Yuhua Qian,et al.  Three-way cognitive concept learning via multi-granularity , 2017, Inf. Sci..

[20]  A. Tversky Features of Similarity , 1977 .

[21]  B. M. Aggarwal Business Mathematics and Statistics , 2016 .

[22]  Radim Belohlávek,et al.  Selecting Important Concepts Using Weights , 2011, ICFCA.

[23]  K. Sumangali,et al.  Determination of interesting rules in FCA using information gain , 2014, 2014 First International Conference on Networks & Soft Computing (ICNSC2014).

[24]  Radim Belohlávek,et al.  Formal Concept Analysis Constrained by Attribute-Dependency Formulas , 2005, ICFCA.

[25]  A.K.C. Wong,et al.  Attribute clustering for grouping, selection, and classification of gene expression data , 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[26]  Samir Elloumi,et al.  A multi-level conceptual data reduction approach based on the Lukasiewicz implication , 2004, Inf. Sci..

[27]  Jiye Liang,et al.  Inclusion degree: a perspective on measures for rough set data analysis , 2002, Inf. Sci..

[28]  Jing Liu,et al.  Multi-scaled concept lattices , 2008, 2008 IEEE International Conference on Granular Computing.

[29]  Claudio Carpineto,et al.  A Lattice Conceptual Clustering System and Its Application to Browsing Retrieval , 1996, Machine Learning.

[30]  Douglas R. Vogel,et al.  Complexity Reduction in Lattice-Based Information Retrieval , 2005, Information Retrieval.

[31]  Kevin H. Knuth,et al.  Lattice Theory, Measures and Probability , 2007 .

[32]  Claudio Carpineto,et al.  Concept data analysis - theory and applications , 2004 .

[33]  Sérgio M. Dias,et al.  Knowledge reduction in formal contexts using non-negative matrix factorization , 2015, Math. Comput. Simul..

[34]  D. Pham,et al.  Selection of K in K-means clustering , 2005 .

[35]  Sergei O. Kuznetsov On Computing the Size of a Lattice and Related Decision Problems , 2001, Order.

[36]  Chu Kiong Loo,et al.  Formal concept analysis approach to cognitive functionalities of bidirectional associative memory , 2015, BICA 2015.

[37]  Cherukuri Aswani Kumar,et al.  Critical Analysis on Open Source LMSs using FCA , 2013, Int. J. Distance Educ. Technol..

[38]  Jinhai Li,et al.  Concept Compression in Formal Concept Analysis Using Entropy-Based Attribute Priority , 2017, Appl. Artif. Intell..

[39]  Vilém Vychodil,et al.  Formal Concept Analysis With Background Knowledge: Attribute Priorities , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[40]  Amedeo Napoli,et al.  Many-Valued Concept Lattices for Conceptual Clustering and Information Retrieval , 2008, ECAI.

[41]  K. Sumangali,et al.  Performance evaluation of employees of an organization using formal concept analysis , 2012, International Conference on Pattern Recognition, Informatics and Medical Engineering (PRIME-2012).

[42]  Miao He,et al.  Concept lattice compression in incomplete contexts based on K-medoids clustering , 2016, Int. J. Mach. Learn. Cybern..

[43]  Siu Cheung Hui,et al.  A Fuzzy FCA-based Approach to Conceptual Clustering for Automatic Generation of Concept Hierarchy on Uncertainty Data , 2004, CLA.

[44]  Sérgio M. Dias,et al.  Concept lattices reduction: Definition, analysis and classification , 2015, Expert Syst. Appl..

[45]  Uta Priss Formal concept analysis in information science , 2006 .

[46]  Sérgio M. Dias,et al.  Reducing the Size of Concept Lattices: The JBOS Approach , 2010, CLA.

[47]  Jonas Poelmans,et al.  Formal concept analysis in knowledge processing: A survey on applications , 2013, Expert Syst. Appl..

[48]  Jesús Medina,et al.  Relating attribute reduction in formal, object-oriented and property-oriented concept lattices , 2012, Comput. Math. Appl..

[49]  Michal Krupka,et al.  Removing an Incidence from a Formal Context , 2014, CLA.

[50]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .