Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agarwal, R., Aggarwal, C., Prasad, V.V.V.: A Tree Projection Algorithm for Generation of Frequent Itemsets. Journal of Parallel and Distributed Computing 61(3), 350–371 (2001)
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)
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)
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)
Cheung, Y.L., Fu, A.W.C.: Mining Frequent Itemsets without Support Threshold: With and Without Item Constraints. IEEE Transactions on Knowledge and Data Engineering 16(9), 1052–1069 (2004)
Chen, C.H., Lan, G.C., Lin, Y.K., Hong, T.P.: Mining high coherent association rules with consideration of support measure. Expert Systems with Applications 40(16), 6531–6537 (2013)
Chiang, D.A., Wang, C.T., Chen, S.P., Chen, C.C.: The Cyclic Model Analysis on Sequential Patterns. IEEE Transactions on Knowledge and Data Engineering 21(11), 1617–1628 (2009)
Plantevit, M., Laurent, A., Laurent, D., Teisseire, M., Choong, Y.W.: Mining Multidimensional and Multilevel Sequential Patterns. ACM Transactions on Knowledge Discovery from Data 4(1), 4–37 (2010)
Sim, A.T.H., Indrawan, M., Zutshi, S., Srinivasan, B.: Logic-Based Pattern Discovery. IEEE Transactions on Knowledge and Data Engineering 22(6), 798–811 (2010)
de Sá, C.R., Soares, C., Jorge, A.M., Azevedo, P., Costa, J.: Mining Association Rules for Label Ranking. In: Huang, J.Z., Cao, L., Srivastava, J. (eds.) PAKDD 2011, Part II. LNCS, vol. 6635, pp. 432–443. Springer, Heidelberg (2011)
Wang, K., He, Y., Han, J.: Pushing Support Constraints into Association Rules Mining. IEEE Transactions on Knowledge and Data Engineering 15(3), 642–658 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Chen, CH., Lan, GC., Hong, TP., Wang, SL., Lin, YK. (2014). A Projection-Based Approach for Mining Highly Coherent Association Rules. In: Pan, JS., Snasel, V., Corchado, E., Abraham, A., Wang, SL. (eds) Intelligent Data analysis and its Applications, Volume I. Advances in Intelligent Systems and Computing, vol 297. Springer, Cham. https://doi.org/10.1007/978-3-319-07776-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-07776-5_8
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07775-8
Online ISBN: 978-3-319-07776-5
eBook Packages: EngineeringEngineering (R0)