Parallel mining of frequent closed patterns: harnessing modern computer architectures (Contributo in atti di convegno)

Type
Label
  • Parallel mining of frequent closed patterns: harnessing modern computer architectures (Contributo in atti di convegno) (literal)
Anno
  • 2007-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1109/ICDM.2007.13 (literal)
Alternative label
  • Lucchese C.; Orlando S.; Perego R. (2007)
    Parallel mining of frequent closed patterns: harnessing modern computer architectures
    in IEEE International Conference on Data Mining 2007, Omaha, NE, USA
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Lucchese C.; Orlando S.; Perego R. (literal)
Pagina inizio
  • 242 (literal)
Pagina fine
  • 251 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#titoloVolume
  • ICDM 2007. Seventh IEEE International Conference on Data Mining (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • In: IEEE International Conference on Data Mining 2007 (Omaha, NE, USA, October 28-31 2007). Proceedings, pp. 242 - 251. IEEE, 2007. (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#descrizioneSinteticaDelProdotto
  • ABSTRACT: Inspired by emerging multi-core computer architectures, in this paper we present mcore, a multi-threaded algorithm for frequent closed itemset mining (FCIM). To the best of our knowledge, this is the first FCIM parallel algorithm proposed so far. We studied how different duplicate checking techniques, typical of FCIM algorithms, may affect this parallelization. We showed that only one of them allows to decompose the global FCIM problem into independent tasks that can be executed in any order, and thus in parallel. Finally we show how mcore efficiently harness modern CPUs. We designed and tested several parallelization paradigms by investigating static/dynamic decomposition and scheduling of tasks, thus showing its scalability w.r.t. to the number of CPUs. We analyzed the cache friendliness of the algorithm. Finally, we provided additional speed-up by introducing SIMD extensions. (literal)
Note
  • Scopu (literal)
  • ISI Web of Science (WOS) (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Ca' Foscari University Venice, Italy Ca' Foscari University Venice, Italy ISTI-CNR (literal)
Titolo
  • Parallel mining of frequent closed patterns: harnessing modern computer architectures (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#isbn
  • 978-0-7695-3018-5 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#curatoriVolume
  • Ramakrishnan, N; Zaiane, OR; Shi, Y; Clifton, CW; Wu, XD (literal)
Abstract
  • Inspired by emerging multi-core computer architectures, in this paper we present MT CL O S E D, a multi-threaded algorithm for frequent closed itemset mining (FCIM). To the best of our knowledge, this is the first FCIM parallel algorithm proposed so far. We studied how different duplicate checking techniques, typical of FCIM algorithms, may affect this parallelization. We showed that only one of them allows to decompose the global FCIM problem into independent tasks that can be executed in any order, and thus in parallel. Finally we show how MT CL O S E D efficiently harness modern CPUs. We designed and tested several parallelization paradigms by investigating static/dynamic decomposition and scheduling of tasks, thus showing its scalability w.r.t. to the number of CPUs. We analyzed the cache friendliness of the algorithm. Finally, we provided additional speed-up by introducing SIMD extensions. (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Autore CNR di
Prodotto
Insieme di parole chiave di
data.CNR.it