Sciweavers

61 search results - page 9 / 13
» CFI-Stream: mining closed frequent itemsets in data streams
Sort
View
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
13 years 7 months ago
On Finding Similar Items in a Stream of Transactions
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
Andrea Campagna, Rasmus Pagh
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 10 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
13 years 11 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane
EDBT
2008
ACM
206views Database» more  EDBT 2008»
14 years 10 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
PAKDD
2007
ACM
144views Data Mining» more  PAKDD 2007»
14 years 3 months ago
Approximately Mining Recently Representative Patterns on Data Streams
Catching the recent trend of data is an important issue when mining frequent itemsets from data streams. To prevent from storing the whole transaction data within the sliding windo...
Jia-Ling Koh, Yuan-Bin Don