Business Intelligence

An Efficient Mining Algorithm for Determining Related Item Sets Using Classification and Association Rules

Free registration required

Executive Summary

In the present days, data mining is the advanced research area because it is one of the important steps in the knowledge discovery process. This paper presents an experimental study of finding the frequent item sets by classifying the data base transactions into classes by using Decision tree induction based classification and applying Frequent-Pattern (FP) growth on the classes. First, data base transactions are pre-processed by using the pre-processing techniques and those are classified into classes based on information gain. After classifying the transactions into classes, the authors applied the FP growth algorithm to obtain the frequent or related item sets. This proposed technique is also suitable for heterogeneous data bases.

  • Format: PDF
  • Size: 616.37 KB