In-close, a fast algorithm for computing formal concepts

CEUR Workshop Proceedings

Volumn 483, Issue , 2009, Pages

  Andrews, Simon ^a  

^a SHEFFIELD HALLAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATA REQUIREMENTS; FAST ALGORITHMS; FORMAL CONCEPTS; FORMAL CONTEXTS; MATRIX SEARCHING; MEMORY CONSIDERATIONS; PRE-PROCESSING; PUBLIC DATA;

ALGORITHMS;

FORMAL CONCEPT ANALYSIS;

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

References (22)

1. Asuncion, A., Newman, D. J.: UCI Machine Learning Repository [http://www.ics.uci.edu/-mlearn/MLRepository.html]. Irvine, CA: University of California, School of Information and Computer Science (2007).
2. Arevalo, G., Berry, A., Huchard, M., Perrot, G., Sigayret, A.: Performances of Galois Sub-hierarchy-building algorithms. In: Kuznetsov, S.O., Schmidt, S. (eds), ICFCA 2007, LNAI 4390, pp. 166180, 2007. Springer-Verlag, Berlin, Heidelberg (2007).
3. thInternational IEEE Conference, vol. 2, pp.15-2-15-7, 6-8 (Sept. 2008).
4. Berry, A., Bordat, J-P., Sigayret, A.: A Local Approach to Concept Generation. In: Annals of Mathematics and Arti-cal Intelligence, Vol. 49, pp. 117-136 (2007).
5. Boulicaut, J-F., Besson, J.: Actionability and Formal Concepts: A Data Mining Perspective. In: Medina, R., Obiedkov, S. (eds.), Int. Conf. on Formal Concept Analysis, Lecture Notes on Arti-cal Intelligence series, pp. 14-31, 2008, Springer- Verlag, Berlin/Heidelberg (2008).
6. Carpineto, C., Romano, G.: Concept Data Analysis: Theory and Application. Wi- ley (2004).
7. Edmonds, J., Gryz, J., Liang, D., Miller, R.J.: Mining for Empty Rectangles in Large Data Sets. In: Database Theory - ICDT 2001, Lecture Notes in Computer Science series, Vol. 1973/2001, pp. 174-188. Springer Berlin/Heidelberg (2001).
8. Ganter, B.: Two Basic Algorithms in Concept Analysis, Technical Report FB4- Preprint No. 831, TH Marstadt (1984).
9. Ganter, B., Wille, R: Formal Concept Analysis: mathematical foundations, Springer, Heidelberg 1999.
10. Godin, R., Missaoui, R., Alaoui, H.: Incremental Concept Formation Algorithms Based on Galois Lattices. In: Computational Intelligence, Vol. 11(2), pp 246-267, Blackwell Synergy (1995).
11. Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufman (2001).
12. Krajca, P., Outrata, J., Vychodil, V.: Parallel Recursive Algorithm for FCA. In: Belohlavek, R., Kuznetsov, S.O. (eds.), Proceeding of the Sixth International Con- ference on Concept Lattices and their Applications, pp. 71-82, Palacky University, Olomouc (2008).
13. Kuznetsov, S.O.: Learning of Simple Conceptual Graphs from Positive and Nega- tive Examples. In: Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery, Lecture Notes In Computer Science, Vol. 1704, pp. 384 - 391. Springer-Verlag, London (1999).
14. Kuznetsov, S.O., Obiedkov, S.A.: Comparing Performance of Algorithms for Gen- erating Concept Lattices. In: Journal of Experimental and Theoretical Arti-cial Intelligence, Vol. 14, pp. 189-216 (2002).
15. Lindig, C.: Fast concept analysis. In: Working with Conceptual Stuctures: Contri- butions to ICCS 2000, pp. 152-161, Shaker-Verlag, Aachen (2000).
16. Outrata, J., Vychodil, V.: Fast algorithm for computing maximal rectangles from object-attribute relational data (submitted).
17. Pensa, R.G., Boulicaut, J-F.: Towards Fault-Tolerant Formal Concept Analysis. In: Bandini, S., Manzoni, S. (eds.), AI*IA 2005: Advances in Arti-cial Intelligence, Lecture Notes in Computer Science series, Vol. 3673, pp. 212-223, Springer-Verlag, Berlin/Heidelberg (2005).
18. Priss, U.: Formal Concept Analysis in Information Science. In: Cronin, B. (ed.), Annual Review of Information Science and Technology. Vol 40, 2006, p. 521-543 (2006).
19. thEMSCSR, 2008, pp. 15-21, (2008).
20. Wille, R.: Formal Concept Analysis as Mathematical Theory of Concepts and Concept Hierarchies. In: Ganter, B., Stumme, G., Wille, R. (eds.), Formal Con- cept Analysis: Foundations and Applications, pages 1-33. Springer-Verlag, Germany (2005).
21. Zaki, M.J., Hsiao, C-J.: E-cient Algorithms for Mining Closed Itemsets and Their Lattice Structure. In: IEEE Transactions on Knowledge and Data Mining, Vol. 17, No. 4, IEE Computer Soc. (April 2005).
22. Zaki, M.J., Ramakrishnan, N.: Reasoning about sets using redescription mining. In: Proceedings of the Eleventh ACM SIGKDD international Conference on Knowledge Discovery in Data Mining, Chicago, Illinois, USA, August 21 - 24, 2005. KDD '05. pp. 364-373. ACM, New York, NY (2005).