Efficient mining of max frequent patterns in a generalized environment

This poster paper summarizes our solution for mining max frequent generalized itemsets (g-itemsets), a compact representation for frequent patterns in the generalized environment. Categories and Subject Descriptors: H.m Information Systems: Miscellaneous General Terms: Algorithms.

• Type: Conference
• Year: 2006
• Where: CIKM
• Authors: Daniel Kunkle, Donghui Zhang, Gene Cooperman
• Keywords: CIKM 2006, Frequent Generalized Itemsets, Frequent Patterns, Generalized Environment, Information Management