Computer Science – Databases
Scientific paper
2010-03-07
Computer Science
Databases
Pages IEEE format, International Journal of Computer Science and Information Security, IJCSIS, Vol. 7 No. 2, February 2010, US
Scientific paper
Several multi-pass algorithms have been proposed for Association Rule Mining from static repositories. However, such algorithms are incapable of online processing of transaction streams. In this paper we introduce an efficient single-pass algorithm for mining association rules, given a hierarchical classification amongest items. Processing efficiency is achieved by utilizing two optimizations, hierarchy aware counting and transaction reduction, which become possible in the context of hierarchical classification. This paper considers the problem of integrating constraints that are Boolean expression over the presence or absence of items into the association discovery algorithm. This paper present three integrated algorithms for mining association rules with item constraints and discuss their tradeoffs. It is concluded that the variation of complexity depends on the measure of DIT (Depth of Inheritance Tree) and NOC (Number of Children) in the context of Hierarchical Classification.
Sastry B. R.
Satish P.
Vijaya Saradhi . V. M.
No associations
LandOfFree
Hierarchical Approach for Online Mining--Emphasis towards Software Metrics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Hierarchical Approach for Online Mining--Emphasis towards Software Metrics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hierarchical Approach for Online Mining--Emphasis towards Software Metrics will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-668160