A lattice-free concept lattice update algorithm based on ∗CBO

CEUR Workshop Proceedings

Volumn 1062, Issue , 2013, Pages 261-274

  Outrata, Jan ^a  

^a PALACKÝ UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL CONCEPT ANALYSIS; INFORMATION ANALYSIS; INPUT OUTPUT PROGRAMS;

CONCEPT LATTICES; EXPERIMENTAL EVALUATION; FORMAL CONCEPTS; INCREMENTAL ALGORITHM; INPUT DATAS; LATTICE ORDERS; LATTICE-FREE; UPDATE ALGORITHMS;

ALGORITHMS;

EID: 84922181833     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Bache K., Lichman M.: UCI Machine Learning Repository. University of California, Irvine, CA, School of Information and Computer Sciences, 2013. http://archive.ics.uci.edu/ml
2. Carpineto C., Romano G.: Concept data analysis. Theory and applications. J. Wiley, 2004.
3. Ganter B., Wille R.: Formal concept analysis. Mathematical foundations. Berlin: Springer, 1999.
4. Godin R., Missaoui R., Alaoui H.: Incremental Concept Formation Algorithms Based on Galois Lattices. Computation Intelligence 11(1995), 246-267.
5. Kirchberg M., Leonardi E., Tan Y. S., Link S., Klko R., Lee B. S.: Formal Concept Discovery in Semantic Web Data. In: Proc. ICFCA 2012, LNAI, 7278(2012), 164-179.
6. Krajca P., Outrata J., Vychodil V.: Advances in algorithms based on CbO. In: Proc. CLA 2010, 325-337.
7. Krajca P., Outrata J., Vychodil V.: Parallel algorithm for computing fixpoints of galois connections. Annals of Mathematics and Artificial Intelligence 59(2) (2010), 257-272.
8. Kuznetsov S. O.: Interpretation on graphs and complexity characteristics of a search for specific patterns. Automatic Documentation and Mathematical Linguistics, 24(1) (1989), 37-45.
9. Kuznetsov S. O.: A fast algorithm for computing all intersections of objects in a finite semi-lattice. Automatic Documentation and Mathematical Linguistics, 27(5) (1993), 11-21.
10. Kuznetsov S. O.: Learning of Simple Conceptual Graphs from Positive and Negative Examples. PKDD 1999, 384-391.
11. Lindig C.: Fast concept analysis. Working with Conceptual Structures-Contributions to ICCS 2000, 2000, 152-161.
12. Van Der Merwe D., Obiedkov S. A., Kourie D. G.: AddIntent: A New Incremental Algorithm for Constructing Concept Lattices. In: Proc. ICFCA 2004, LNAI 2961(2004), 205-206.
13. Norris E. M.: An Algorithm for Computing the Maximal Rectangles in a Binary Relation. Revue Roumaine de Mathématiques Pures et Appliquées, 23(2) (1978), 243-250.
14. Outrata J., Vychodil V.: Fast Algorithm for Computing Fixpoints of Galois Connections Induced by Object-Attribute Relational Data. Information Sciences 185(1) (2012), 114-127.
15. Valtchev P., Missaoui R.: Building Concept (Galois) Lattices from Parts: Generalizing the Incremental Methods. LNAI 2120(2001), 290-303.
16. Wille R.: Restructuring lattice theory: an approach based on hierarchies of concepts. Ordered Sets, 1982, 445-470, 1982.