Comparison of data structures for computing formal concepts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5861 LNAI, Issue , 2009, Pages 114-125

  Krajca, Petr ^a,b   Vychodil, Vilem ^a,b  

^a BINGHAMTON UNIVERSITY   (United States)

^b PALACKÝ UNIVERSITY   (Czech Republic)

Author keywords

Algorithms; Comparison; Data structures; Formal concept analysis; Performance

Indexed keywords

COMPARISON; FORMAL CONCEPTS; IS PERFORMANCE; PERFORMANCE;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DATA STRUCTURES; INFORMATION ANALYSIS;

FORMAL CONCEPT ANALYSIS;

EID: 80755173461     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04820-3_11     Document Type: Conference Paper

References (18)

1. Belohlavek, R., De Baets, B., Outrata, J., Vychodil, V.: Inducing decision trees via concept lattices. Int. J. General Systems 38(4), 455-467 (2009).
2. Belohlavek, R., Vychodil, V.: Discovery of optimal factors in binary data via a novel method of matrix decomposition. Journal of Computer and System Sciences (to appear).
3. Carpineto, C., Romano, G.: Concept data analysis. Theory and applications. J. Wiley, Chichester (2004).
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press, Cambridge (2001).
5. Ganter, B.: Two basic algorithms in concept analysis. Technical Report FB4- Preprint No. 831. TH Darmstadt (1984).
6. Ganter, B., Wille, R.: Formal concept analysis. Mathematical foundations. Springer, Berlin (1999).
7. Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Information Processing Letters 27(3), 119-123 (1988).
8. Kuznetsov, S.: Interpretation on graphs and complexity characteristics of a search for specific patterns. Automatic Documentation and Mathematical Linguistics 24(1), 37-45 (1989).
9. Kuznetsov, S.: A fast algorithm for computing all intersections of objects in a finite semi-lattice (Bystry-i algoritm postroeni- vseh pereseqeni-i ob-ektov iz koneqno-i polurexetki, in Russian). Automatic Documentation and Mathematical Linguistics 27(5), 11-21 (1993).
10. Kuznetsov, S.: Learning of Simple Conceptual Graphs from Positive and Negative Examples. In: ?Zytkow, J.M., Rauch, J. (eds.) PKDD 1999. LNCS (LNAI), vol. 1704, pp. 384-391. Springer, Heidelberg (1999).
11. Kuznetsov, S., Obiedkov, S.: Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Int. 14, 189-216 (2002).
12. Levitin, A.V.: Introduction to the Design and Analysis of Algorithms. Addison Wesley, Reading (2002).
13. Lindig, C.: Fast concept analysis. In: Working with Conceptual Structures- Contributions to ICCS 2000, pp. 152-161. Shaker Verlag, Aachen (2000).
14. Norris, E.M.: An Algorithm for Computing the Maximal Rectangles in a Binary Relation. Revue Roumaine de Math́ematiques Pures et Appliques 23(2), 243-250 (1978).
15. Outrata, J., Vychodil, V.: Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data (submitted).
16. Sedgewick, R.: Left-leaning red-black trees, http://www.cs.princeton.edu/ ~rs/talks/LLRB/LLRB.pdf.
17. Wille, R.: Restructuring lattice theory: An approach based on hierarchies of concepts. In: Ordered Sets, Dordrecht-Boston, pp. 445-470 (1982).
18. Zaki, M.J.: Mining non-redundant association rules. Data Mining and Knowledge Discovery 9, 223-248 (2004).