dRAP-Independent: A Data Distribution Algorithm for Mining First-Order Frequent Patterns

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F07%3A00023860" target="_blank" >RIV/00216224:14330/07:00023860 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

čeština

Original language name

dRAP-Independent: A Data Distribution Algorithm for Mining First-Order Frequent Patterns

Original language description

In this paper we present drapi, an algorithm for independent distributed mining of first-order frequent pattern. This system is based on RAP, an algorithm for finding maximal frequent patterns in first-order logic. drapi 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.

Czech name

dRAP-Independent: A Data Distribution Algorithm for Mining First-Order Frequent Patterns

Czech description

In this paper we present drapi, an algorithm for independent distributed mining of first-order frequent pattern. This system is based on RAP, an algorithm for finding maximal frequent patterns in first-order logic. drapi 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.

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2007

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Computing and Informatics

ISSN

1335-9150

e-ISSN

—

Volume of the periodical

26

Issue of the periodical within the volume

3

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

22

Pages from-to

345-366

UT code for WoS article

—

EID of the result in the Scopus database

—