Advances in algorithms based on CbO

CEUR Workshop Proceedings

Volumn 672, Issue , 2010, Pages 325-337

  Krajca, Petr ^a   Outrata, Jan ^a   Vychodil, Vilem ^a  

^a PALACKÝ UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PREPROCESSING; FORMAL CONCEPTS; FORMAL CONTEXTS; NUMBER OF INVERSIONS; PARALLEL VERSION; PERFORMANCE AND SCALABILITIES; SCHEDULING STRATEGIES;

FORMAL CONCEPT ANALYSIS; INFORMATION ANALYSIS;

ALGORITHMS;

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

References (17)

1. Andrews S.: In-Close, a Fast Algorithm for Computing Formal Concepts. In: Rudolph, Dau, Kuznetsov (Eds.): Supplementary Proceedings of ICCS '09, CEUR WS 483(2009), 14 pages. http://sunsite.informatik.rwth-aachen.de/Publications/CEUR- WS/Vol-483/paper1.pdf.
2. Asuncion A., Newman D.: UCI Machine Learning Repository. University of California, Irvine, School of Information and Computer Sciences, 2007.
3. Berry A., Bordat J.-P., Sigayret A.: A local approach to concept generation. Annals of Mathematics and Artificial Intelligence, 49(2007), 117-136.
4. Fu H., Mephu Nguifo E.: A Parallel Algorithm to Generate Formal Concepts for Large Data. ICFCA 2004, LNCS 2961, pp. 394-401.
5. Ganter B.: Two basic algorithms in concept analysis. (Technical Report FB4Preprint No. 831). TH Darmstadt, 1984.
6. Ganter B., Wille R.: Formal concept analysis. Mathematical foundations. Berlin: Springer, 1999.
7. Goldberg L. A.: Eficient Algorithms for Listing Combinatorial Structures. Cambridge University Press, 1993.
8. Hettich S., Bay S.D.: The UCI KDD Archive University of California, Irvine, School of Information and Computer Sciences, 1999.
9. Johnson D. S, Yannakakis M., Papadimitriou C. H.: On generating all maximal independent sets. Information Processing Letters 27(3)(1988), 119-123.
10. Krajca P., Outrata J., Vychodil V.: Parallel Recursive Algorithm for FCA. In: Belohlavek, Kuznetsov (Eds.): Proc. CLA 2008, CEUR WS 433(2008), 71-82. http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-433/paper6.pdf
11. Krajca P., Vychodil V.: Comparison of data structures for computing formal concepts. In: Proc. MDAI 2009, LNAI 5861(2009), 114-125.
12. Kuznetsov S.: Interpretation on graphs and complexity characteristics of a search for specific patterns. Automatic Documentation and Mathematical Linguistics, 24(1)(1989), 37-45.
13. Kuznetsov S.: A fast algorithm for computing all intersections of objects in a finite semi-lattice Automatic Documentation and Mathematical Linguistics, 27(5)(1993), 11-21.
14. Kuznetsov S.: Learning of Simple Conceptual Graphs from Positive and Negative Examples. PKDD 1999, pp. 384-391.
15. Kuznetsov S., Obiedkov S.: Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Int., 14(2002), 189-216.
16. Lindig C.: Fast concept analysis. Working with Conceptual Structures-Contributions to ICCS 2000, pp. 152-161, 2000. Aachen: Shaker Verlag.
17. Outrata J., Vychodil V.: Fast algorithm for computing fixpoints of galois connections induced by object-attribute relational data (in preparation).