Mining Level-Crossing Association Rules from Large Databases

作者: RS Thakur , RC Jain , KR Pardasani

DOI: 10.3844/JCSSP.2006.76.81

关键词: K-optimal pattern discoveryComputer scienceTable (database)Data miningDatabase transactionHierarchyLevel crossingAssociation (object-oriented programming)Extension (predicate logic)Association rule learningDatabase

摘要: Existing algorithms for mining association rule at multiple concept level, restricted strong among the same level of a hierarchy. However level-crossing may lead to discovery different In this study, top-down progressive deepening method is developed rules in large transaction databases by extension some existing multiple-level techniques. This using reduced support and refine table each level.

参考文章(9)
Douglas Fisher, Improving inference through conceptual clustering national conference on artificial intelligence. pp. 461- 465 ,(1987)
Ramakrishnan Srikant, Rakesh Agrawal, Fast algorithms for mining association rules very large data bases. pp. 580- 592 ,(1998)
Gregory Piatetsky-Shapiro, Discovery, Analysis, and Presentation of Strong Rules Knowledge Discovery in Databases. pp. 229- 238 ,(1991)
Jong Soo Park, Ming-Syan Chen, Philip S. Yu, An effective hash-based algorithm for mining association rules international conference on management of data. ,vol. 24, pp. 175- 186 ,(1995) , 10.1145/223784.223813
J. Ross Quinlan, C4.5: Programs for Machine Learning ,(1992)
Jiawei Han, Yongjian Fu, Mining multiple-level association rules in large databases IEEE Transactions on Knowledge and Data Engineering. ,vol. 11, pp. 798- 805 ,(1999) , 10.1109/69.806937
R. Agrawal, R. Srikant, Mining sequential patterns international conference on data engineering. pp. 3- 14 ,(1995) , 10.1109/ICDE.1995.380415
Rakesh Agrawal, Tomasz Imieliński, Arun Swami, Mining association rules between sets of items in large databases Proceedings of the 1993 ACM SIGMOD international conference on Management of data - SIGMOD '93. ,vol. 22, pp. 207- 216 ,(1993) , 10.1145/170035.170072
Heikki Mannila, Kari-Jouko Räihä, Dependency Inference very large data bases. pp. 155- 158 ,(1987)