Sciweavers

284 search results - page 26 / 57
» Mining Frequent Itemsets in Distributed and Dynamic Database...
Sort
View
CORR
2008
Springer
114views Education» more  CORR 2008»
14 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...
IS
2007
14 years 9 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
PREMI
2005
Springer
15 years 3 months ago
Towards Generic Pattern Mining
Frequent Pattern Mining (FPM) is a very powerful paradigm for mining informative and useful patterns in massive, complex datasets. In this paper we propose the Data Mining Template...
Mohammed Javeed Zaki, Nilanjana De, Feng Gao, Nage...
101
Voted
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
64
Voted
FIMI
2004
123views Data Mining» more  FIMI 2004»
14 years 11 months ago
Surprising Results of Trie-based FIM Algorithms
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
Ferenc Bodon