A New Algorithm based on Extent Bit-array for Computing Formal Concepts

The emergence of Formal Concept Analysis (FCA) as a data analysis technique has increased the need for developing algorithms which can compute formal concepts quickly. The current efficient algorithms for FCA are variants of the Close-By-One (CbO) algorithm, such as In-Close2, In-Close3 and In-Close4, which are all based on horizontal storage of contexts. In this paper, based on algorithm In-Close4, a new algorithm based on the vertical storage of contexts, called InClose5, is proposed, which can significantly reduce both the time complexity and space complexity of algorithm In-Close4. Technically, the new algorithm stores both context and extent of a concept as a vertical bit-array, while within In-Close4 algorithm the context is stored only as a horizontal bit-array, which is very slow in finding the intersection of two extent sets. Experimental results demonstrate that the proposed algorithm is much more effective than In-Close4 algorithm, and it also has a broader scope of applicability in computing formal concept in which one can solve the problems that cannot be solved by the In-Close4 algorithm.

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

[2]  Sergei O. Kuznetsov,et al.  Machine Learning and Formal Concept Analysis , 2004, ICFCA.

[3]  P. Alam.  ‘A’ , 2021, Composites Engineering: An A–Z Guide.

[4]  Yiyu Yao,et al.  Concept lattices in rough set theory , 2004, IEEE Annual Meeting of the Fuzzy Information, 2004. Processing NAFIPS '04..

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

[6]  Dan Meng,et al.  Formal concept analysis based on the topology for attributes of a formal context , 2013, Inf. Sci..

[7]  Jinhai Li,et al.  On inference rules in decision formal contexts , 2015, Int. J. Comput. Intell. Syst..

[8]  Xiao Zhang,et al.  Rule-preserved object compression in formal decision contexts using concept lattices , 2014, Knowl. Based Syst..

[9]  Jonas Poelmans,et al.  Text Mining Scientific Papers: A Survey on FCA-Based Information Retrieval Research , 2012, ICDM.

[10]  Jinhai Li,et al.  Incomplete decision contexts: Approximate concept construction, rule acquisition and knowledge reduction , 2013, Int. J. Approx. Reason..

[11]  Sergei O. Kuznetsov,et al.  Toxicology Analysis by Means of the JSM-method , 2003, Bioinform..

[12]  Ling Wei,et al.  The connections between three-way and classical concept lattices , 2016, Knowl. Based Syst..

[13]  Petr Osicka.  Algorithms for Computation of Concept Trilattice of Triadic Fuzzy Context , 2012, IPMU.

[14]  QianTing,et al.  The connections between three-way and classical concept lattices , 2016 .

[15]  Wei Liu,et al.  Computing the set of concepts through the composition and decomposition of formal contexts , 2012, 2012 International Conference on Machine Learning and Cybernetics.

[16]  Sergei O. Kuznetsov,et al.  Comparing performance of algorithms for generating concept lattices , 2002, J. Exp. Theor. Artif. Intell..

[17]  Qing Wan,et al.  Approximate concepts acquisition based on formal contexts , 2015, Knowl. Based Syst..

[18]  Nicolas Pasquier,et al.  Efficient Mining of Association Rules Using Closed Itemset Lattices , 1999, Inf. Syst..

[19]  Ling Wei,et al.  A Partitional View of Concept Lattice , 2005, RSFDGrC.

[20]  Vilém Vychodil,et al.  Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data , 2012, Inf. Sci..

[21]  Simon Andrews,et al.  A 'Best-of-Breed' approach for designing a fast algorithm for computing fixpoints of Galois Connections , 2015, Inf. Sci..

[22]  Camille Roth,et al.  Reducing the Representation Complexity of Lattice-Based Taxonomies , 2007, ICCS.

[23]  Ming-Wen Shao,et al.  Knowledge reduction in formal fuzzy contexts , 2015, Knowl. Based Syst..

[24]  Ling Wei,et al.  The attribute reductions of three-way concept lattices , 2016, Knowledge-Based Systems.