A Projection-Based Approach for Mining Highly Coherent Association Rules
In our previous approach, we proposed an apriori-based algorithm for mining highly coherent association rules, and it is time-consuming. In this paper, we present an efficient mining approach, which is a projection-based technique, to speed up the execution of finding highly coherent association rules. In particular, an indexing mechanism is designed to help find relevant transactions quickly from a set of data, and a pruning strategy is proposed as well to prune unpromising candidate itemsets early in mining. The experimental results show that the proposed algorithm outperforms the traditional mining approach for a real dataset.
KeywordsData mining propositional logic highly coherent rule index mechanism pruning strategy
Unable to display preview. Download preview PDF.
- 2.Agrawal, R., Imielinksi, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 207–216 (1993)Google Scholar
- 3.Bie, T.D.: An Information Theoretic Framework for Data Mining. In: Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 564–572 (2011)Google Scholar
- 4.Brin, S., Motwani, R., Silverstein, C.: Beyond Market Baskets: Generalizing Association Rules to Correlations. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 265–276 (1997)Google Scholar