2006
dRAP: A Framework for Distributed Mining Firts-Order Frequent Patterns
BLAŤÁK, Jan and Lubomír POPELÍNSKÝBasic information
Original name
dRAP: A Framework for Distributed Mining Firts-Order Frequent Patterns
Name in Czech
dRAP: Systém pro distribuované dolování prvořádových častých vzorů
Name (in English)
dRAP: A Framework for Distributed Mining Firts-Order Frequent Patterns
Authors
BLAŤÁK, Jan (203 Czech Republic, guarantor) and Lubomír POPELÍNSKÝ (203 Czech Republic)
Edition
1. vyd. Santiago de Compostela, Spain, 16th International Conference on Inductive Logic Programming, p. 25-27, 3 pp. 2006
Publisher
University of Coruna
Other information
Language
Czech
Type of outcome
Proceedings paper
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
Czech Republic
Confidentiality degree
is not subject to a state or trade secret
RIV identification code
RIV/00216224:14330/06:00017160
Organization unit
Faculty of Informatics
ISBN
84-9749-206-4
Keywords in English
inductive logic programming; parallel and distributed mining
Changed: 1/1/2007 17:19, doc. RNDr. Lubomír Popelínský, Ph.D.
In the original language
In this paper dRAP, a framework for distributed mining first-order frequent patterns is presented. It extends the RAP system for running on parallel shared-nothing architecture. It utilizes several well-known methods for parallel mining propositional frequent patterns and new algorithm that minimizes communication overhead. We show that the new algorithm require significantly smaller number of messages passed than the other methods.
In English
In this paper dRAP, a framework for distributed mining first-order frequent patterns is presented. It extends the RAP system for running on parallel shared-nothing architecture. It utilizes several well-known methods for parallel mining propositional frequent patterns and new algorithm that minimizes communication overhead. We show that the new algorithm require significantly smaller number of messages passed than the other methods.
Links
MSM0021622418, plan (intention) |
|