Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework
- Cite this paper as:
- Krajca P., Vychodil V. (2009) Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework. In: Adams N.M., Robardet C., Siebes A., Boulicaut JF. (eds) Advances in Intelligent Data Analysis VIII. IDA 2009. Lecture Notes in Computer Science, vol 5772. Springer, Berlin, Heidelberg
Searching for interesting patterns in binary matrices plays an important role in data mining and, in particular, in formal concept analysis and related disciplines. Several algorithms for computing particular patterns represented by maximal rectangles in binary matrices were proposed but their major drawback is their computational complexity limiting their application on relatively small datasets. In this paper we introduce a scalable distributed algorithm for computing maximal rectangles that uses the map-reduce approach to data processing.
Unable to display preview. Download preview PDF.