Efficient Graph-Based Algorithm for Discovering and Maintaining Knowledge in Large Databases
暂无分享,去创建一个
[1] AgrawalRakesh,et al. Mining association rules between sets of items in large databases , 1993 .
[2] Arbee L. P. Chen,et al. An efficient approach to discovering knowledge from large databases , 1996, Fourth International Conference on Parallel and Distributed Information Systems.
[3] David Wai-Lok Cheung,et al. A General Incremental Technique for Maintaining Discovered Association Rules , 1997, DASFAA.
[4] Youn-Long Lin,et al. Performance-driven soft-macro clustering and placement by preserving HDL design hierarchy , 1998, ISPD '98.
[5] Ramakrishnan Srikant,et al. Mining Sequential Patterns: Generalizations and Performance Improvements , 1996, EDBT.
[6] Arbee L. P. Chen,et al. An Efficient Algorithm for Deriving Compact Rules from Databases , 1995, DASFAA.
[7] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[8] Jiawei Han,et al. Maintenance of discovered association rules in large databases: an incremental updating technique , 1996, Proceedings of the Twelfth International Conference on Data Engineering.
[9] Kaizhong Zhang,et al. Combinatorial pattern discovery for scientific data: some preliminary results , 1994, SIGMOD '94.