Sciweavers

848 search results - page 1 / 170
» A New Framework For Itemset Generation
Sort
View
PODS
1998
ACM
134views Database» more  PODS 1998»
13 years 9 months ago
A New Framework For Itemset Generation
The problem of finding association rules in a large database of sales transactions has been widely studied in the literature, We discuss some of the weaknessesof the large itemset...
Charu C. Aggarwal, Philip S. Yu
KDD
2000
ACM
118views Data Mining» more  KDD 2000»
13 years 8 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
IJFCS
2008
102views more  IJFCS 2008»
13 years 5 months ago
Succinct Minimal Generators: Theoretical Foundations and Applications
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu N...
INAP
2001
Springer
13 years 9 months ago
Discovering Frequent Itemsets in the Presence of Highly Frequent Items
This paper presents new techniques for focusing the discoveryof frequent itemsets within large, dense datasets containing highly frequent items. The existence of highly frequent i...
Dennis P. Groth, Edward L. Robertson
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 6 months ago
Generalized Closed Itemsets for Association Rule Mining
The output of boolean association rule mining algorithms is often too large for manual examination. For dense datasets, it is often impractical to even generate all frequent items...
Vikram Pudi, Jayant R. Haritsa