Sciweavers

200 search results - page 14 / 40
» An Algorithm for In-Core Frequent Itemset Mining on Streamin...
Sort
View
ADC
2006
Springer
169views Database» more  ADC 2006»
14 years 1 months ago
A further study in the data partitioning approach for frequent itemsets mining
Frequent itemsets mining is well explored for various data types, and its computational complexity is well understood. Based on our previous work by Nguyen and Orlowska (2005), th...
Son N. Nguyen, Maria E. Orlowska
DAWAK
2004
Springer
13 years 11 months ago
PROWL: An Efficient Frequent continuity Mining Algorithm on Event Sequences
Mining association rule in event sequences is an important data mining problem with many applications. Most of previous studies on association rules are on mining intra-transaction...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin
EDBT
2008
ACM
206views Database» more  EDBT 2008»
14 years 7 months ago
Designing an inductive data stream management system: the stream mill experience
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...
Hetal Thakkar, Barzan Mozafari, Carlo Zaniolo
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 2 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
14 years 8 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...