Abstract

In this paper we present dRAP-Independent, an algorithm for independent distributed mining of first-order frequent patterns. This system is based on RAP, an algorithm for finding maximal frequent patterns in first-order logic. dRAP-Independent utilizes a modified data partitioning schema introduced by Savasere et al. and offers good performance and low communication overhead. We analyze the performance of the algorithm on four different tasks: Mutagenicity prediction – a standard ILP benchmark, information extraction from biological texts, context-sensitive spelling correction, and morphological disambiguation of Czech. The results of the analysis show that the algorithm can generate more patterns than the serial algorithm RAP in the same overall time.

Keywords

Cite this article

@article{cai-1696,
  author  = {Jan Blaťák and Luboš Popelínský},
  title   = {dRAP-Independent: A Data Distribution Algorithm for Mining First-Order Frequent Patterns},
  journal = {Computing and Informatics},
  volume  = {26},
  number  = {3},
  pages   = {345--366},
  year    = {2007},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2007/3/drap-independent-a-data-distribution-algorithm-for-mining-first-order-frequent-patterns/}
}
Download .bib