Sciweavers

KDD
2000
ACM
118views Data Mining» more  KDD 2000»
13 years 7 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
2006
IEEE
132views Data Mining» more  ICDM 2006»
13 years 10 months ago
High Quality, Efficient Hierarchical Document Clustering Using Closed Interesting Itemsets
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to...
Hassan H. Malik, John R. Kender
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 4 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald