Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework

  • Petr Krajca
  • Vilem Vychodil
Conference paper

DOI: 10.1007/978-3-642-03915-7_29

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5772)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Petr Krajca
    • 1
    • 2
  • Vilem Vychodil
    • 1
    • 2
  1. 1.T. J. Watson SchoolState University of New York at BinghamtonUSA
  2. 2.Dept. Computer SciencePalacky UniversityOlomouc

Personalised recommendations