Abstract
One of the most effective methods to deal with large data for data analysis and data mining is to develop parallel algorithm. Although Formal concept analysis is an effective tool for data analysis and knowledge discovery, it’s very hard for concept lattice structures to face the complexity of very large data. So we propose a new parallel algorithm based on the NextClosure algorithm to generate formal concepts for large data.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Birkhoff, G.: Lattice Theory, 3rd edn. American Mathematical Society, Providence (1967)
Fu, H., Nguifo, E.M.: How well go lattice algorithms on currently used machine learning testbeds? In: ICFCA 2003, First International Conference on Formal Concept Analysis (2003)
Fu, H., Nguifo, E.M.: Partitioning large data to scale up lattice-based algorithm. In: Proceedings of ICTAI 2003, Sacramento, CA, November 2003, IEEE Computer Press, Los Alamitos (2003)
Ganter, B.: Two basic algorithms in concept analysis. Technical Report 831, Technische Hochschule, Darmstadt, Germany (1984) (preprint)
Ganter, B., Wille, R.: Formal Concept Analysis. Mathematical Foundations. Springer, Heidelberg (1999)
Kuznetsov, S., Obiedkov, S.: Comparing performance of algorithms for generating concept lattices. JETAI Special Issue on Concept Lattice for KDD 14(2/3), 189–216 (2002)
Njiwoua, P., Mephu Nguifo, E.: A parallel algorithm to build Concept Lattice. In: Proceedings of the 4th Groningen International Information Technology Conference for Students, pp. 103–107. University of Groningen, The Netherlands (1997)
Tchuente, M.: Parallel Computation on Regular Arrays. Algorithms and Architectures for Advanced Scientific Computing. Manchester University Press (1991)
Valtchev, P., Missaoui, R.: Building galois (concept) lattices from parts: Generalizing the incremental approach. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol. 2120, pp. 290–303. Springer, Heidelberg (2001)
Wille, R.: Restructuring Lattice Theory. In: Rival, I. (ed.) Symposium on Ordered Sets, pp. 445–470. University of Calgary, Boston (1982)
Zaki, M.J., Ho, C.-T.: Large-Scale Parallel Data Mining. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fu, H., Nguifo, E.M. (2004). A Parallel Algorithm to Generate Formal Concepts for Large Data. In: Eklund, P. (eds) Concept Lattices. ICFCA 2004. Lecture Notes in Computer Science(), vol 2961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24651-0_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-24651-0_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21043-6
Online ISBN: 978-3-540-24651-0
eBook Packages: Springer Book Archive