论文信息 - AddIntent: A New Incremental Algorithm for Constructing Concept Lattices

AddIntent: A New Incremental Algorithm for Constructing Concept Lattices

An incremental concept lattice construction algorithm, called AddIntent, is proposed. In experimental comparison, AddIntent outperformed a selection of other published algorithms for most types of contexts and was close to the most efficient algorithm in other cases. The current best estimate for the algorithm’s upper bound complexity to construct a concept lattice L whose context has a set of objects G, each of which possesses at most max(|g′|) attributes, is O(|L||G|2 max(|g′|)).

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

[2] Derrick G. Kourie,et al. Compressed pseudo-lattices , 2002, J. Exp. Theor. Artif. Intell..

[3] Lhouari Nourine,et al. A Fast Algorithm for Building Lattices , 1999, Inf. Process. Lett..

[4] Catherine Blake,et al. UCI Repository of machine learning databases , 1998 .

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

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

[7] J. Bordat. Calcul pratique du treillis de Galois d'une correspondance , 1986 .

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

[9] Claudio Carpineto,et al. A lattice conceptual clustering system and its application to browsing retrieval , 2004, Machine Learning.

[10] Peter A. Grigoriev,et al. Elements of an Agile Discovery Environment , 2003, Discovery Science.

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

[12] Rokia Missaoui,et al. Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory , 2002, J. Exp. Theor. Artif. Intell..

[13] Sébastien Ferré. Incremental Concept Formation made More Efficient by the Use of Associative Concepts , 2002 .