Sciweavers

85 search results - page 2 / 17
» An Efficient Algorithm for Maintaining Frequent Closed Items...
Sort
View
FIMI
2004
239views Data Mining» more  FIMI 2004»
13 years 6 months ago
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
ADC
2008
Springer
156views Database» more  ADC 2008»
13 years 11 months ago
Interactive Mining of Frequent Itemsets over Arbitrary Time Intervals in a Data Stream
Mining frequent patterns in a data stream is very challenging for the high complexity of managing patterns with bounded memory against the unbounded data. While many approaches as...
Ming-Yen Lin, Sue-Chen Hsueh, Sheng-Kun Hwang
KAIS
2008
150views more  KAIS 2008»
13 years 4 months ago
A survey on algorithms for mining frequent itemsets over data streams
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...
James Cheng, Yiping Ke, Wilfred Ng
CIKM
2009
Springer
13 years 11 months ago
Mining frequent itemsets in time-varying data streams
Mining frequent itemsets in data streams is beneficial to many real-world applications but is also a challenging task since data streams are unbounded and have high arrival rates...
Yingying Tao, M. Tamer Özsu
CIKM
2009
Springer
13 years 8 months ago
Efficient itemset generator discovery over a stream sliding window
Mining generator patterns has raised great research interest in recent years. The main purpose of mining itemset generators is that they can form equivalence classes together with...
Chuancong Gao, Jianyong Wang