Sciweavers

148 search results - page 17 / 30
» Frequent Itemsets Mining for Database Auto-Administration
Sort
View
IDEAS
2005
IEEE
99views Database» more  IDEAS 2005»
14 years 2 months ago
Distribution-Based Synthetic Database Generation Techniques for Itemset Mining
The resource requirements of frequent pattern mining algorithms depend mainly on the length distribution of the mined patterns in the database. Synthetic databases, which are used...
Ganesh Ramesh, Mohammed Javeed Zaki, William Mania...
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
14 years 8 months ago
Identifying bridging rules between conceptual clusters
1 A bridging rule in this paper has its antecedent and action from different conceptual clusters. We first design two algorithms for mining bridging rules between clusters in a dat...
Shichao Zhang, Feng Chen, Xindong Wu, Chengqi Zhan...
FIMI
2004
172views Data Mining» more  FIMI 2004»
13 years 10 months ago
AIM2: Improved implementation of AIM
We present AIM2-F, an improved implementation of AIM-F [4] algorithm for mining frequent itemsets. Past studies have proposed various algorithms and techniques for improving the e...
Sagi Shporer
IS
2007
13 years 8 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
CINQ
2004
Springer
125views Database» more  CINQ 2004»
14 years 1 months ago
Deducing Bounds on the Support of Itemsets
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
Toon Calders