http://www.cnr.it/ontology/cnr/individuo/prodotto/ID43892
Memory-aware frequent k-itemset mining (Articolo in rivista)
- Type
- Label
- Memory-aware frequent k-itemset mining (Articolo in rivista) (literal)
- Anno
- 2006-01-01T00:00:00+01:00 (literal)
- Alternative label
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
- Atzori M.; Mancarella P.; Turini F. (literal)
- Pagina inizio
- Pagina fine
- Rivista
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
- In: Knowledge Discovery in Inductive Databases (4th International Workshop, KDID 2005, Porto, Portugal, October 3, 2005). Revised Selected and Invited Papers. pp. 38-54. Francesco Bonchi, Jean-Francois Boulicaut (eds.). (Lecture Notes in Computer Science, vol. 3933). Springer, 2006. (literal)
- Note
- ISI Web of Science (WOS) (literal)
- Titolo
- Memory-aware frequent k-itemset mining (literal)
- Abstract
- In this paper we show that the well known problem of computing frequent k-itemsets (i.e. itemsets of cardinality k) in a given dataset can be reduced to the problem of finding iceberg queries from a stream of queries suitably constructed from the original dataset. Hence, algorithms for computing frequent k-itemsets can be obtained by adapting algorithms for computing iceberg queries. In the paper we show that, for sparse datasets, this can be done directly, i.e., without generating frequent x-itemsets, for each x3). An important feature of the algorithm is that the amount of main memory required can be determined in advance, and it is shown to be very low for sparse datasets. Experiments show that for very large datasets with millions of small transactions our proposal outperforms the state-of-the-art algorithms. Furthermore, we sketch a first extension of our algorithm that works over data streams. (literal)
- Prodotto di
- Insieme di parole chiave
Incoming links:
- Prodotto
- Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
- Insieme di parole chiave di
