Exploiting Hierarchal Structure of XML Data Using Association Rule Analysis

Abstract

Data mining is the process of extracting useful information from the huge amount of data stored in the databases. Data mining tools and techniques help to predict business trends those can occur in near future. Association rule mining is an important technique to discover hidden relationships among items in the transaction. Association rules is a popular and well researched method for finding interesting relation between variables in large databases. For generating strong association rules, it depends on the association rule extraction by any algorithm for example Apriori algorithm or FP-growth etc and the evolution of the rules by different interestingness measure for example support/confidence, lift/interest, Correlation Coefficient, Statistical Correlation, Leverage, Conviction etc. The classical model of association rules mining is support-confidence. The goal is to experimentally evaluate association rule mining approaches in the context of XML databases. Algorithms are implemented using Java. For experimental evaluation different XML datasets are used. Apriori and FP Tree algorithm have been implemented and their performance is evaluated extensively.