Maximal frequent itemsets mining algorithm based on effective pruning mechanisms

[1] Agrawal R, Imielinski, Swami A, et al. Mining association rules between sets of items in large databases . In:Peter Buneman, Sushil Jajodia, eds. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data . Washington, 1993. 207~216 [2] Agrawal R, Srikant R. Fast algorithms for mining association rules in large database . FJ9839, 1994 [3] Houtsma M, Swami A. Set-oriented mining of association rules . In:Philip S Yu, Arbee L P Chen. eds. Proceedings of the 11th International Conference on Data Engineering . Taipei, 1995. 25~33 [4] Zaki M, Ogihara M. Theoretical foundations of association rules . In:3rd ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery . Washington, 1998. 7.1~7:8 [5] Wille R. Restructuring lattice theory:an approach based on hierarchies of concepts . In:Ivan Rival,ed. Ordered Sets . Reidel, Dordrecht-Boston, 1982. 445~470 [6] Agrawal R, Srikant R. Fast algorithms for mining association rules in large database . In:Jorge B Bocca, Matthias Jarke Carlo Zaniolo, eds. Proceedings of the 20th International Conference on Very Large Data Bases . Santiago,1994. 487~499 [7] Han J, Fu Y. Discovery of multiple-level association rules from large databases . In:Jorge B Bocca, Matthias Jarke, Carlo Zaniolo, eds. Proceedings of 21th International Conference on Very Large Data Bases . Zurich, rland, 1995.39~46 [8] Bayardo R J. Efficiently mining long patterns from databases . In:Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data . Seattle, Washington, 1998. 85~93