Sciweavers

179 search results - page 17 / 36
» An Approximate Approach for Mining Recently Frequent Itemset...
Sort
View
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 9 months ago
Dynamic index selection in data warehouses
Analytical queries defined on data warehouses are complex and use several join operations that are very costly, especially when run on very large data volumes. To improve response...
Stéphane Azefack, Kamel Aouiche, Jér...
SDM
2007
SIAM
106views Data Mining» more  SDM 2007»
13 years 10 months ago
Approximating Representations for Large Numerical Databases
The paper introduces a notion of support for realvalued functions. It is shown how to approximate supports of a large class of functions based on supports of so called polynomial ...
Szymon Jaroszewicz, Marcin Korzen
ICDM
2006
IEEE
118views Data Mining» more  ICDM 2006»
14 years 2 months ago
Reducing the Frequent Pattern Set
One of the major problems in frequent pattern mining is the explosion of the number of results, making it difficult to identify the interesting frequent patterns. In a recent pap...
Ronnie Bathoorn, Arne Koopman, Arno Siebes
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
14 years 6 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki
KDD
2008
ACM
104views Data Mining» more  KDD 2008»
14 years 9 months ago
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dr...