论文信息 - Efficient mining of max frequent patterns in a generalized environment

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.

Donghui Zhang | Gene Cooperman | Daniel Kunkle

[1] Roberto J. Bayardo,et al. Efficiently mining long patterns from databases , 1998, SIGMOD '98.

[2] Ramakrishnan Srikant,et al. Mining generalized association rules , 1995, Future Gener. Comput. Syst..

[3] Thanaruk Theeramunkong,et al. Fast Algorithms for Mining Generalized Frequent Patterns of Generalized Association Rules , 2004, IEICE Trans. Inf. Syst..