A fast incremental algorithm for deleting objects from a concept lattice

The formal context may not be fixed in a real-life application of formal concept analysis, which means that we have to update the present lattice or compute a new lattice from scratch. In this paper, we propose an efficient incremental algorithm, referred to as FastDeletion, to delete objects from a concept lattice. The algorithm improves two fundamental procedures shared by other algorithms. These two procedures include determining which concepts need to be deleted and fixing the covering relation. We describe the algorithm thoroughly, prove correctness of our improvements, discuss time complexity issues, and present an experimental evaluation of its performance and comparison with another algorithm. Empirical analyses demonstrate that our algorithm is superior when applied to various types of formal contexts.

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

[2]  Xiangping Kang,et al.  Research on domain ontology in different granulations based on concept lattice , 2012, Knowl. Based Syst..

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

[4]  Zuping Zhang,et al.  A fast incremental algorithm for constructing concept lattices , 2015, Expert Syst. Appl..

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

[6]  Simon Andrews,et al.  In-Close, a fast algorithm for computing formal concepts , 2009 .

[7]  Robert Godin,et al.  Lattice model of browsable data spaces , 1986, Inf. Sci..

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

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

[10]  Simon Andrews,et al.  FcaBedrock, a Formal Context Creator , 2010, ICCS.

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

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

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

[14]  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).

[15]  Jean-François Boulicaut,et al.  Constraint-based concept mining and its application to microarray data analysis , 2005, Intell. Data Anal..

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

[17]  Simon Andrews.  In-Close2, a High Performance Formal Concept Miner , 2011, ICCS.

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

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

[20]  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.

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

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

[23]  Lei Zhang,et al.  An Incremental Algorithm for Removing Object from Concept Lattice , 2013 .

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

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

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

[27]  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).

[28]  Anna Formica,et al.  Semantic Web search based on rough sets and Fuzzy Formal Concept Analysis , 2012, Knowl. Based Syst..

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

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