Sciweavers

91 search results - page 1 / 19
» Mining frequent item sets by opportunistic projection
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 11 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 4 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
EUSFLAT
2009
233views Fuzzy Logic» more  EUSFLAT 2009»
13 years 8 months ago
SaM: A Split and Merge Algorithm for Fuzzy Frequent Item Set Mining
This paper presents SaM, a split and merge algorithm for frequent item set mining. Its distinguishing qualities are an exceptionally simple algorithm and data structure, which not ...
Christian Borgelt, Xiaomeng Wang
EDBT
2011
ACM
199views Database» more  EDBT 2011»
13 years 2 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
14 years 2 months ago
Mining top-k frequent items in a data stream with flexible sliding windows
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
Hoang Thanh Lam, Toon Calders