Sciweavers

288 search results - page 1 / 58
» Estimating the number of frequent itemsets in a large databa...
Sort
View
EDBT
2009
ACM
109views Database» more  EDBT 2009»
13 years 11 months ago
Estimating the number of frequent itemsets in a large database
Ruoming Jin, Scott McCallen, Yuri Breitbart, David...
IEAAIE
2009
Springer
13 years 11 months ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
13 years 10 months ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...
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
KES
2004
Springer
13 years 10 months ago
FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases
Association rule mining is an important data mining problem that has been studied extensively. In this paper, a simple but Fast algorithm for Intersecting attribute lists using a ...
Jun Luo, Sanguthevar Rajasekaran