Removing an incidence from a formal context

CEUR Workshop Proceedings

Volumn 1252, Issue , 2014, Pages 195-206

  Kauer, Martin ^a   Krupka, Michal ^a  

^a PALACKÝ UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

CONCEPT LATTICES; FORMAL CONTEXTS; INCREMENTAL COMPUTATION; STRUCTURAL INFORMATION;

INFORMATION ANALYSIS;

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

References (9)

1. Carpineto, C., Romano, G.: Concept Data Analysis: Theory and Applications. John Wiley & Sons (2004)
2. Dowling, C. E.: On the irredundant generation of knowledge spaces. J. Math. Psy-chol. 37(1), 49-62 (1993)
3. Ganter, B., Wille, R.: Formal Concept Analysis-Mathematical Foundations. Springer (1999)
4. Kuznetsov, S. O., Obiedkov, S.: Comparing performance of algorithms for generating concept lattices. Journal of Experimental and Theoretical Artificial Intelligence 14, 189-216 (2002)
5. Merwe, D., Obiedkov, S., Kourie, D.: Addintent: A new incremental algorithm for constructing concept lattices. In: Eklund, P. (ed.) Concept Lattices, Lecture Notes in Computer Science, vol. 2961, pp. 372-385. Springer Berlin Heidelberg (2004)
6. Norris, E. M.: An algorithm for computing the maximal rectangles in a binary rela-tion. Revue Roumaine de Mathématiques Pures et Appliquées 23(2), 243-250 (1978)
7. Nourine, L., Raynaud, O.: A fast algorithm for building lattices. Inf. Process. Lett. 71(5-6), 199-204 (1999)
8. Outrata, J.: A lattice-free concept lattice update algorithm based on CbO. In: Ojeda-Aciego, M., Outrata, J. (eds.) CLA. CEUR Workshop Proceedings, vol. 1062, pp. 261-274. CEUR-WS. org (2013)
9. Wille, R.: Restructuring lattice theory: An approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445-470. Boston (1982)