Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy


This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact and general representations for all frequent patterns and all strong association rules in the generalized environment. Our results fill an important gap among algorithms for… (More)
DOI: 10.1007/s11390-008-9107-1


7 Figures and Tables


Citations per Year

Citation Velocity: 4

Averaging 4 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.