Reducing the Representation Complexity of Lattice-Based Taxonomies

Representing concept lattices constructed from large contexts often results in heavy, complex diagrams that can be impractical to handle and, eventually, to make sense of. In this respect, many concepts could allegedly be dropped from the lattice without impairing its relevance towards a taxonomy description task at a certain level of detail. We propose a method where the notion of stability is introduced to select potentially more pertinent concepts. We present some theoretical properties of stability and discuss several use cases where taxonomy building is an issue.

[1]  Olivier Ridoux,et al.  A File System Based on Concept Analysis , 2000, Computational Logic.

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

[3]  Peter W. Eklund,et al.  Conceptual Structures: Knowledge Representation as Interlingua , 1996, Lecture Notes in Computer Science.

[4]  Rudolf Wille,et al.  Conceptual Structures of Multicontexts , 1996, ICCS.

[5]  Ulrich Berger,et al.  Computational Logic , 2001, NATO ASI Series.

[6]  Paul Bourgine,et al.  Lattice-based dynamic and overlapping taxonomies: The case of epistemic communities , 2006, Scientometrics.

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

[8]  R. Wille.  Concept lattices and conceptual knowledge systems , 1992 .

[9]  Martin F. Porter,et al.  An algorithm for suffix stripping , 1997, Program.

[10]  Ron Atkin,et al.  Mathematical structure in human affairs , 1976 .

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

[12]  Luís Moniz Pereira,et al.  Computational Logic — CL 2000 , 2000, Lecture Notes in Computer Science.

[13]  Lc Freeman,et al.  USING GALOIS LATTICES TO REPRESENT NETWORK DATA , 1993 .

[14]  Herschel C. Hudson.  Classifying social data , 1982 .

[15]  J. H. Johnson,et al.  Stars, Maximal Rectangles, Lattices: A New Perspective on Q-Analysis , 1986, Int. J. Man Mach. Stud..

[16]  Tom A. B. Snijders,et al.  DYNAMIC SOCIAL NETWORK MODELING AND ANALYSIS , 2003 .

[17]  P. Haas.  Introduction: epistemic communities and international policy coordination , 1992, International Organization.

[18]  Bart Goethals,et al.  Advances in frequent itemset mining implementations: report on FIMI'03 , 2004, SKDD.

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

[20]  Camille Roth,et al.  Towards Concise Representation for Taxonomies of Epistemic Communities , 2006, CLA.

[21]  Sergei O. Kuznetsov,et al.  On stability of a formal concept , 2007, Annals of Mathematics and Artificial Intelligence.

[22]  L. Freeman.  Finding Social Groups: A Meta-Analysis of the Southern Women Data , 2003 .