A Parallel Algorithm to Generate Formal Concepts for Large Data
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.
Unable to display preview. Download preview PDF.
- 2.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)Google Scholar
- 3.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)Google Scholar
- 4.Ganter, B.: Two basic algorithms in concept analysis. Technical Report 831, Technische Hochschule, Darmstadt, Germany (1984) (preprint)Google Scholar
- 7.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)Google Scholar
- 8.Tchuente, M.: Parallel Computation on Regular Arrays. Algorithms and Architectures for Advanced Scientific Computing. Manchester University Press (1991)Google Scholar
- 10.Wille, R.: Restructuring Lattice Theory. In: Rival, I. (ed.) Symposium on Ordered Sets, pp. 445–470. University of Calgary, Boston (1982)Google Scholar