Sciweavers

112 search results - page 6 / 23
» Efficient Approximate Mining of Frequent Patterns over Trans...
Sort
View
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
15 years 10 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...
DASFAA
2010
IEEE
225views Database» more  DASFAA 2010»
14 years 9 months ago
Mining Regular Patterns in Data Streams
Discovering interesting patterns from high-speed data streams is a challenging problem in data mining. Recently, the support metric-based frequent pattern mining from data stream h...
Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed,...
PAKDD
2010
ACM
208views Data Mining» more  PAKDD 2010»
14 years 11 months ago
Efficient Pattern Mining of Uncertain Data with Sampling
Mining frequent itemsets from transactional datasets is a well known problem with good algorithmic solutions. In the case of uncertain data, however, several new techniques have be...
Toon Calders, Calin Garboni, Bart Goethals
CIKM
2009
Springer
15 years 1 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
ICDM
2007
IEEE
180views Data Mining» more  ICDM 2007»
15 years 3 months ago
Mining Frequent Itemsets in a Stream
We study the problem of finding frequent itemsets in a continuous stream of transactions. The current frequency of an itemset in a stream is defined as its maximal frequency ove...
Toon Calders, Nele Dexters, Bart Goethals