Parallel recursive algorithm for FCA

CEUR Workshop Proceedings

Volumn 433, Issue , 2009, Pages 71-82

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

^a BINGHAMTON UNIVERSITY   (United States)

^b PALACKÝ UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

CRITICAL OPERATIONS; EXPERIMENTAL EVALUATION; FORMAL CONCEPTS; ITS EFFICIENCIES; KEY FEATURE; MEMORY EFFICIENT; RECURSIVE ALGORITHMS;

INFORMATION ANALYSIS;

ALGORITHMS;

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

References (18)

1. Asuncion A., Newman D. UCI Machine Learning Repository. University of California, Irvine, School of Information and Computer Sciences, 2007.
2. Baklouti F., Levy G.: A distributed version of the Ganter algorithm for general Galois Lattices. In: Belohlavek R., Snasel V. (Eds.): Proc. CLA 2005, pp. 207-221.
3. Belohlavek R., Vychodil V. On boolean factor analysis with formal concept as factors. Proceedings of SCIS & ISIS 2006, pp. 1054-1059, 2006. Tokyo, Japan: Tokyo Institute of Technology.
4. Berry A., Bordat J.-P., Sigayret A. A local approach to concept generation. Annals of Mathematics and Artificial Intelligence, 49(2007), 117-136.
5. Carpineto C., Romano G. Concept data analysis. Theory and applications. J. Wiley, 2004.
6. DAMOL Dataset Repository (in preparation).
7. Fu H., Mephu Nguifo E.: A Parallel Algorithm to Generate Formal Concepts for Large Data. ICFCA 2004, LNCS 2961, pp. 394-401.
8. Ganter B. Two basic algorithms in concept analysis. (Technical Report FB4- Preprint No. 831). TH Darmstadt, 1984.
9. Ganter B., Wille R. Formal concept analysis. Mathematical foundations. Berlin: Springer, 1999.
10. Hettich S., Bay S.D.: The UCI KDD Archive University of California, Irvine, School of Information and Computer Sciences, 1999.
11. Kengue J. F. D., Valtchev P., Djamégni C. T.: A Parallel Algorithm for Lattice Construction. ICFCA 2005, LNCS 3403, pp. 249-264.
12. Kuznetsov S.: Learning of Simple Conceptual Graphs from Positive and Negative Examples. PKDD 1999, pp. 384-391.
13. Kuznetsov S., Obiedkov S. Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Int., 14(2002), 189-216.
14. Lindig C. Fast concept analysis. Working with Conceptual Structures- -Contributions to ICCS 2000, pp. 152-161, 2000. Aachen: Shaker Verlag.
15. Miettinen P., Mielikäinen T., Gionis A., Das G., Mannila H. The discrete basis problem. PKDD, pp. 335-346, 2006. Springer.
16. Outrata J., Vychodil V. Fast algorithm for computing maximal rectangles from object-attribute relational data (submitted).
17. Vychodil V.: A new algorithm for computing formal concepts. In: Trappl R. (Ed.): Cybernetics and Systems 2008: Proc. 19th EMCSR, 2008, pp. 15-21.
18. Wille R. Restructuring lattice theory: an approach based on hierarchies of concepts. Ordered Sets, pp. 445-470, 1982. Dordrecht-Boston.