An improved incremental algorithm for constructing concept lattices

2009 WRI World Congress on Software Engineering, WCSE 2009

Volumn 4, Issue , 2009, Pages 401-405

  Yu, Yuan ^a   Qian, Xu ^a   Zhong, Feng ^a   Li, Xiao Rui ^a  

^a CHINA UNIVERSITY OF MINING AND TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY RELATION; COMPLEXITY ANALYSIS; CONCEPT LATTICES; EXECUTION SPEED; IMPROVED ALGORITHM; INCREMENTAL ALGORITHM; PARENT NODE; SEARCH SPACES;

COMPUTER SOFTWARE;

ALGORITHMS;

EID: 72849117825     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WCSE.2009.301     Document Type: Conference Paper

References (12)

1. J. Bordat. Calcul pratique du treillis de galois d'une correspondance. Math. Sci. Hum., 96:31-47, 1986.
2. C. Carpineto and G. Romano. Information retrieval through hybrid navigation of lattice representations. International Journal of Human-Computer Studies, 45:553-578, 1996.
3. C. Carpineto and G. Romano. A lattice conceptual clustering system and its application to browsing retrieval. Machine Learning, 24(2):95-122, 1996.
4. B. Ganter. Two basic algorithms in concept analysis. FB4-Preprint, (831).
5. B. Ganter and R. Wille. Formal Concept Analysis: Mathematical Foundations. Springer, Berlin, 1999.
6. R. Godin. L'utilisation de Treillis pour l'Accès aux Systèmes d'Information. PhD thesis, Université de Montréal, 1986.
7. R. Godin, R. Missaoui, and H. Alaoui. Incremental concept formation algorithms based on galois lattices. Computation Intelligence, 11(2):243-250, 1995.
8. S. Kuznetsov and S. Obiedkov. Comparing performance of algorithms for generating concept lattices. Journal of Experimental and Theoretical Artificial Intelligence, 14(2/3):189-216, 2002.
9. L. Nourine and O. Raynaud. A fast algorithm for building lattices. Information Processing Letters, 71(5-6):199-204, 1999.
10. D. van der Merwe, S. Obiedkov, and D. Kourie. Addin-tent: A new incremental algorithm for constructing concept lattices. In Lecture Notes in Artificial Intelligence, volume 2961, pages 372-385, Heidelberger Platz 3, D-14197 Berlin, Germany, 2004. Springer-Verlag Berlin.
11. R. Wille. Restructuring lattice theory: An approach based on hierarchies of concepts. In Rival I. ed.: Ordered Sets. Reidel, Dordrecht-Boston, pages 445-470, 1982.
12. Z.-P. Xie and Z.-T. Liu. Fast incremental algorithm for building concept lattice. Jisuanji Xuebao/Chinese Journal of Computers, 25(5):490 - 496, 2002.