A fast incremental algorithm for constructing concept lattices

Necessary and sufficient conditions for an attribute set to be a new intent.The procedure of searching for canonical generators is improved.We prove that the number of children of any concept has an upper bound.The procedure of updating the upper neighbors of a new concept is improved.An efficient incremental algorithm for constructing concept lattices is proposed. Incremental algorithms for constructing concept lattices can update a concept lattice according to new objects added to the formal context. In this paper, we propose an efficient incremental algorithm for concept lattice construction. The algorithm, called FastAddIntent, results as a modification of AddIntent in which we improve two fundamental procedures including searching for canonical generators and fixing the covering relation. We describe the algorithm completely, prove correctness of our improvements, discuss time complexity issues, and present an experimental evaluation of its performance and comparison with AddIntent. Theoretical and empirical analyses show the advantages of our algorithm when applied to large or (and) dense formal contexts.

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

[2]  Sheffield Hallam,et al.  FcaBedrock , a formal context , 2015 .

[3]  Bernhard Ganter,et al.  Two Basic Algorithms in Concept Analysis , 2010, ICFCA.

[4]  Jonas Poelmans,et al.  Formal Concept Analysis in knowledge processing: A survey on models and techniques , 2013, Expert Syst. Appl..

[5]  A. Asuncion,et al.  UCI Machine Learning Repository, University of California, Irvine, School of Information and Computer Sciences , 2007 .

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

[7]  Rokia Missaoui,et al.  A framework for incremental generation of closed itemsets , 2008, Discret. Appl. Math..

[8]  Yijun Yu,et al.  Using formal concept analysis to construct and visualise hierarchies of socio-technical relations , 2009, 2009 31st International Conference on Software Engineering - Companion Volume.

[9]  Rudolf Wille,et al.  Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts , 2009, ICFCA.

[10]  Sergei O. Kuznetsov,et al.  Recognizing Pseudo-intents is coNP-complete , 2010, CLA.

[11]  Bernhard Ganter,et al.  Formal Concept Analysis , 2013 .

[12]  Matteo Gaeta,et al.  RSS-based e-learning recommendations exploiting fuzzy FCA for Knowledge Modeling , 2012, Appl. Soft Comput..

[13]  Rokia Missaoui,et al.  Building Concept (Galois) Lattices from Parts: Generalizing the Incremental Methods , 2001, ICCS.

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

[15]  Aboul Ella Hassanien,et al.  Using formal concept analysis for mining hyomethylated genes among breast cancer tumors subtypes , 2013, 2013 International Conference on Advances in Computing, Communications and Informatics (ICACCI).

[16]  Rokia Missaoui,et al.  INCREMENTAL CONCEPT FORMATION ALGORITHMS BASED ON GALOIS (CONCEPT) LATTICES , 1995, Comput. Intell..

[17]  Derrick G. Kourie,et al.  AddIntent: A New Incremental Algorithm for Constructing Concept Lattices , 2004, ICFCA.

[18]  Edward Fredkin,et al.  Trie memory , 1960, Commun. ACM.

[19]  Peter W. Eklund,et al.  Concept Similarity and Related Categories in SearchSleuth , 2008, ICCS.

[20]  M. AdelsonVelskii,et al.  AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION , 1963 .

[21]  Jonas Poelmans,et al.  Formal Concept Analysis in Knowledge Discovery: A Survey , 2010, ICCS.

[22]  Alair Pereira do Lago,et al.  A convexity upper bound for the number of maximal bicliques of a bipartite graph , 2014, Discret. Appl. Math..

[23]  Jan Outrata,et al.  A Lattice-Free Concept Lattice Update Algorithm based on *CbO , 2013, CLA.

[24]  Derrick G. Kourie,et al.  An incremental algorithm to construct a lattice of set intersections , 2009, Sci. Comput. Program..

[25]  Vilém Vychodil,et al.  Comparison of Data Structures for Computing Formal Concepts , 2009, MDAI.

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

[27]  Lv Lingling,et al.  An improved addintent algorithm for building concept lattice , 2011, 2011 2nd International Conference on Intelligent Control and Information Processing.

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

[29]  Uta Priss.  Linguistic Applications of Formal Concept Analysis , 2005, Formal Concept Analysis.

[30]  Attila Körei.  Using Formal Concept Analysis in Education , 2017 .

[31]  Van der Merwe,et al.  Constructing concept lattices and compressed pseudo-lattices , 2003 .

[32]  Sergei O. Kuznetsov,et al.  On the Intractability of Computing the Duquenne?Guigues Bas , 2004, J. Univers. Comput. Sci..