Download now Free registration required
Association rule mining is one of the important problems of data mining. Single minimum support based approaches of association rule mining suffers from "rare item problem". An improved approach MSApriori uses multiple supports to generate association rules that consider rare item sets. Necessity to first identify the "Large" set of items contained in the input dataset to generate association rules results in high storage and processing time requirement. The proposed work overcomes this drawback by storing items and their support values as total support tree data structure, resulting in an algorithm that is more efficient than existing algorithm both in terms of memory requirement as well as in processing time.
- Format: PDF
- Size: 556.96 KB