Mining confident rules without support requirement
暂无分享,去创建一个
Ke Wang | Yu He | David Wai-Lok Cheung | Francis Y. L. Chin | F. Chin | D. Cheung | Ke Wang | Yu He
[1] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[2] Ke Wang,et al. Building Hierarchical Classifiers Using Class Proximity , 1999, VLDB.
[3] Shashi Shekhar,et al. Multilevel hypergraph partitioning: application in VLSI domain , 1997, DAC.
[4] Shashi Shekhar,et al. Multilevel hypergraph partitioning: applications in VLSI domain , 1999, IEEE Trans. Very Large Scale Integr. Syst..
[5] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[6] Edith Cohen,et al. Finding interesting associations without support pruning , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[7] Tomasz Imielinski,et al. An Interval Classifier for Database Mining Applications , 1992, VLDB.
[8] Rajeev Motwani,et al. Dynamic miss-counting algorithms: finding implication and similarity rules with confidence pruning , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[9] Ke Wang,et al. Growing decision trees on support-less association rules , 2000, KDD '00.