Sciweavers

36 search results - page 4 / 8
» Distribution-Based Synthetic Database Generation Techniques ...
Sort
View
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
14 years 7 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...
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 4 months ago
Mining Multi-Level Frequent Itemsets under Constraints
Mining association rules is a task of data mining, which extracts knowledge in the form of significant implication relation of useful items (objects) from a database. Mining multi...
Mohamed Salah Gouider, Amine Farhat
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
13 years 8 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis
KDD
2003
ACM
194views Data Mining» more  KDD 2003»
14 years 7 months ago
Finding recent frequent itemsets adaptively over online data streams
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be c...
Joong Hyuk Chang, Won Suk Lee
SIGMOD
1997
ACM
148views Database» more  SIGMOD 1997»
13 years 11 months ago
Beyond Market Baskets: Generalizing Association Rules to Correlations
One of the most well-studied problems in data mining is mining for association rules in market basket data. Association rules, whose significance is measured via support and confi...
Sergey Brin, Rajeev Motwani, Craig Silverstein