Sciweavers

214 search results - page 3 / 43
» New Parallel Algorithms for Frequent Itemset Mining in Very ...
Sort
View
PKDD
2007
Springer
147views Data Mining» more  PKDD 2007»
13 years 11 months ago
MINI: Mining Informative Non-redundant Itemsets
Frequent itemset mining assists the data mining practitioner in searching for strongly associated items (and transactions) in large transaction databases. Since the number of frequ...
Arianna Gallo, Tijl De Bie, Nello Cristianini
IEEEHPCS
2010
13 years 4 months ago
Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
Benjamin Négrevergne, Alexandre Termier, Je...
ICDM
2005
IEEE
166views Data Mining» more  ICDM 2005»
13 years 11 months ago
An Algorithm for In-Core Frequent Itemset Mining on Streaming Data
Frequent itemset mining is a core data mining operation and has been extensively studied over the last decade. This paper takes a new approach for this problem and makes two major...
Ruoming Jin, Gagan Agrawal
AMT
2006
Springer
108views Multimedia» more  AMT 2006»
13 years 7 months ago
Efficient Frequent Itemsets Mining by Sampling
As the first stage for discovering association rules, frequent itemsets mining is an important challenging task for large databases. Sampling provides an efficient way to get appro...
Yanchang Zhao, Chengqi Zhang, Shichao Zhang
KAIS
2008
114views more  KAIS 2008»
13 years 5 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong