BLAŤÁK, Jan and Lubomír POPELÍNSKÝ. dRAP-Independent: A Data Distribution Algorithm for Mining First-Order Frequent Patterns. Computing and Informatics. Bratislava, 2007, vol. 26, No 3, p. 345-366. ISSN 1335-9150.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name dRAP-Independent: A Data Distribution Algorithm for Mining First-Order Frequent Patterns
Name in Czech dRAP-Independent: A Data Distribution Algorithm for Mining First-Order Frequent Patterns
Name (in English) dRAP-Independent: A Data Distribution Algorithm for Mining First-Order Frequent Patterns
Authors BLAŤÁK, Jan (203 Czech Republic) and Lubomír POPELÍNSKÝ (203 Czech Republic, guarantor).
Edition Computing and Informatics, Bratislava, 2007, 1335-9150.
Other information
Original language Czech
Type of outcome Article in a journal
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
Impact factor Impact factor: 0.349
RIV identification code RIV/00216224:14330/07:00023860
Organization unit Faculty of Informatics
UT WoS 000247846400008
Keywords in English data mining; inductive logic programming; frequent patterns; distributed data mining
Tags data mining, distributed data mining, frequent patterns, inductive logic programming
Tags International impact, Reviewed
Changed by Changed by: doc. RNDr. Lubomír Popelínský, Ph.D., učo 1945. Changed: 10/2/2008 16:55.
Abstract
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.
Abstract (in English)
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.
Links
MSM0021622418, plan (intention)Name: DYNAMICKÁ GEOVIZUALIZACE V KRIZOVÉM MANAGEMENTU
Investor: Ministry of Education, Youth and Sports of the CR, Dynamic Geovisualisation in Crises Management
PrintDisplayed: 7/5/2024 01:45