Sciweavers

36 search results - page 2 / 8
» Distribution-Based Synthetic Database Generation Techniques ...
Sort
View
KDD
2000
ACM
118views Data Mining» more  KDD 2000»
13 years 9 months ago
Generating non-redundant association rules
The traditional association rule mining framework produces many redundant rules. The extent of redundancy is a lot larger than previously suspected. We present a new framework for...
Mohammed Javeed Zaki
ICDM
2003
IEEE
140views Data Mining» more  ICDM 2003»
13 years 11 months ago
Mining Frequent Itemsets in Distributed and Dynamic Databases
Traditional methods for frequent itemset mining typically assume that data is centralized and static. Such methods impose excessive communication overhead when data is distributed...
Matthew Eric Otey, Chao Wang, Srinivasan Parthasar...
KDD
1999
ACM
217views Data Mining» more  KDD 1999»
13 years 10 months ago
An Efficient Algorithm to Update Large Itemsets with Early Pruning
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arku...
IDEAS
2003
IEEE
106views Database» more  IDEAS 2003»
13 years 11 months ago
Frequent Itemsets Mining for Database Auto-Administration
With the wide development of databases in general and data warehouses in particular, it is important to reduce the tasks that a database administrator must perform manually. The a...
Kamel Aouiche, Jérôme Darmont, Le Gru...
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 1 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu