Abstract
An algorithm has been proposed for mining frequent maximal itemsets from data cube. Discovering frequent itemsets has been a key process in association rule mining. One of the major drawbacks of traditional algorithms is that lot of time is taken to find candidate itemsets. Proposed algorithm discovers frequent itemsets using aggregation function and directed graph. It uses directed graph for candidate itemsets generation and aggregation for dimension reduction. Experimental results show that the proposed algorithm can quickly discover maximal frequent itemsets and effectively mine potential association rules.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th International Conference on Very Large Databases, pp. 487–499. Santiago, Chile (1994)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the ACM-SIGMOD Conference Management of Data, pp. 1–12 (2000)
Amir, A., Anumann, y., Feldman, R., Fresko, M.: Maximal association rules: a tool for mining associations in text. J. Intell. Inf. Syst. 25(3), 333–345 (2005)
Zaki, M.K.: Closed Itemset Mining and Non-redundant Association Rule Min-ing. In Encyclopedia of Database Systems. Springer-Verlag (2009). doi: 10.1007/978-0-387-39940-9_66
Rosen, K.H.: Discrete Mathematics and Its Application, 7th edn. McGraw-Hill Publication, Columbus (2012)
Han, J., Kamber, M.: Data Mining Concepts and Techniques, 3rd edn. Morgan Kaufmann Publishers, San Francisco (2012)
Harsola, S.K., Deshpande, P.M., Haritsa, J.R.: IceCube: efficient targeted mining in data cubes. In: ICDM, pp. 894–899 (2012)
Gray, J., Chaudhuri, S., Bosworth, A., Layman, D., Reichart, D., Venkatrao, M., Pellow, F., Pirahesh, H.: Data cube: a relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Data Min. Knowl. Discov. Arch. 1(1), 29–53 (1997)
Messaoud, R.B., Rabaseda, S.L.: Enhanced mining of association rules from data cubes. In: Proceedings of the 9th ACM International Workshop on Data Warehousing and OLAP, pp. 11–18 (2006)
Liu, H., Wang, B.: An association rule mining algorithm based on a Boolean matrix. Data Sci. J. 6, s559–s565 (2007)
Liu, N., Ma, L.: Discovering frequent itemsets an improved algorithm of directed graph and array. In: 4th IEEE International Conference on Software Engineering and Service Science (ICSESS), pp. 1017–1020 (2013)
Xu, W.X., Wang, R.J.: A fast algorithm of mining multidimensional association rules frequently. In: International Conference on Machine Learning and Cybernetics, pp. 1199–1203. China (2006)
Schlimmer, J.: https://archive.ics.uci.edu/ml/machine-learning-databases/mushroom/agaricus-lepiota.data
Shapiro, A.: https://archive.ics.uci.edu/ml/datasets/Accident (KRKPA7)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer India
About this paper
Cite this paper
Singh, K., Shakya, H.K., Biswas, B. (2016). Frequent Patterns Mining from Data Cube Using Aggregation and Directed Graph. In: Das, S., Pal, T., Kar, S., Satapathy, S., Mandal, J. (eds) Proceedings of the 4th International Conference on Frontiers in Intelligent Computing: Theory and Applications (FICTA) 2015. Advances in Intelligent Systems and Computing, vol 404. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2695-6_15
Download citation
DOI: https://doi.org/10.1007/978-81-322-2695-6_15
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2693-2
Online ISBN: 978-81-322-2695-6
eBook Packages: EngineeringEngineering (R0)