Mining Level-Crossing Association Rules from Large Databases
R. S. Thakur, R. C. Jain & K. R. Pardasani
Journal of Computer Science, Volume 2, Issue 1, pp. 76–81 · doi.org/10.3844/jcssp.2006.76.81
Abstract
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.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2006 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Thakur, R. S., Jain, R. C. & Pardasani, K. R. (2006). Mining Level-Crossing Association Rules from Large Databases. Journal of Computer Science, 2(1), 76–81. https://doi.org/10.3844/jcssp.2006.76.81
- Licence
- © Science Publications
- Issue
- Volume 2, Issue 1
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
