Mining Level-Crossing Association Rules from Large Databases

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

[1]  Gregory Piatetsky-Shapiro,et al.  Discovery, Analysis, and Presentation of Strong Rules , 1991, Knowledge Discovery in Databases.

[2]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[3]  Jiawei Han,et al.  Mining Multiple-Level Association Rules in Large Databases , 1999, IEEE Trans. Knowl. Data Eng..

[4]  Thomas G. Dietterich.  What is machine learning? , 2020, Archives of Disease in Childhood.

[5]  Jiawei Han,et al.  Data-Driven Discovery of Quantitative Rules in Relational Databases , 1993, IEEE Trans. Knowl. Data Eng..

[6]  Douglas H. Fisher,et al.  Improving Inference through Conceptual Clustering , 1987, AAAI.

[7]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[8]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[9]  Heikki Mannila,et al.  Dependency Inference , 1987, VLDB.

[10]  Philip S. Yu,et al.  An effective hash-based algorithm for mining association rules , 1995, SIGMOD '95.

[11]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .