About: dRAP-Independent: A Data Distribution Algorithm for Mining First-Order Frequent Patterns     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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.
  • 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. (en)
  • 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. (cs)
Title
  • dRAP-Independent: A Data Distribution Algorithm for Mining First-Order Frequent Patterns
  • dRAP-Independent: A Data Distribution Algorithm for Mining First-Order Frequent Patterns (en)
  • dRAP-Independent: A Data Distribution Algorithm for Mining First-Order Frequent Patterns (cs)
skos:prefLabel
  • dRAP-Independent: A Data Distribution Algorithm for Mining First-Order Frequent Patterns
  • dRAP-Independent: A Data Distribution Algorithm for Mining First-Order Frequent Patterns (en)
  • dRAP-Independent: A Data Distribution Algorithm for Mining First-Order Frequent Patterns (cs)
skos:notation
  • RIV/00216224:14330/07:00023860!RIV10-MSM-14330___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM0021622418)
http://linked.open...iv/cisloPeriodika
  • 3
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 418118
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14330/07:00023860
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • data mining; inductive logic programming; frequent patterns; distributed data mining (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • CZ - Česká republika
http://linked.open...ontrolniKodProRIV
  • [6CBE61525AF0]
http://linked.open...i/riv/nazevZdroje
  • Computing and Informatics
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 26
http://linked.open...iv/tvurceVysledku
  • Popelínský, Lubomír
  • Blaťák, Jan
http://linked.open...n/vavai/riv/zamer
issn
  • 1335-9150
number of pages
http://localhost/t...ganizacniJednotka
  • 14330
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software