Abstract
Frequent patterns mining is one of the most important data mining techniques, used for extracting information and knowledge from ordinary data. In this paper, we are interested by improving Apriori, which is one of the most used algorithm for extracting frequent patterns. First, we propose some enhancements for the Apriori algorithm. Then we develop Meta-Apriori a new recursive algorithm based on Apriori. As we know, the major drawback of Apriori is its temporal complexity, which makes it difficult to practice. The aim of our algorithm is to reduce substantially the runtime so as, to increase its efficiency while preserving its effectiveness. The main idea is to use the “divide and conquer” technique, which consists in partitioning the whole database into small ones and then applying Meta-Apriori if the database is huge or Apriori if it is of reasonable size. By merging the achieved results, we obtain the outcomes for the whole database.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of 1994 International Conference on Very Large Data Bases (VLDB 1994), Santiago, Chile, pp. 487–499, September 1994
Bhandari, A., Gupta, A., Das, D.: Improvised apriori algorithm using frequent pattern tree for real time applications in data mining. In: Procedia Computer Science Vol. 46, International Conference on Information and Communication Technologies (ICICT 2014), pp. 644–651 (2015)
Nikam, V.B., Meshram, B.B.: Scalable frequent itemset mining using heterogeneous: parapriori algorithm. Int. J. Distrib. Parallel Syst. (IJDPS) 5(5), 1–11 (2014)
Feng, W., Yong-hua, L.: An improved apriori algorithm based on the matrix. In: International Seminar on Future BioMedical Information Engineering, FBIE, pp. 152–155 (2008)
Yanbin, Y., Chia-Chu, C.: A parallel apriori algorithm for frequent itemsets mining. In: Fourth International Conference on Software Engineering Research, Management and Applications (SERA 2006), pp. 87–94 (2006)
Mahesh, B., Rao, VRK, Subrahmanya, G: An adaptive implementation case study of apriori algorithm for a retail scenario in a cloud environment. In: 2013 13th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing, CCGRID, pp. 625–629 (2013)
Han, J., Kamber, M., Pei, J.: Data mining: Concepts and techniques, 3rd edn. Morgan KaufmannPublisher, San Francisco (2012)
Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 193–207. Springer, Heidelberg (1999)
Frequent Itemset Mining Dataset Repository. http://fimi.ua.ac.be/data/
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benhamouda, N.C., Drias, H., Hirèche, C. (2016). Meta-Apriori: A New Algorithm for Frequent Pattern Detection. In: Nguyen, N.T., Trawiński, B., Fujita, H., Hong, TP. (eds) Intelligent Information and Database Systems. ACIIDS 2016. Lecture Notes in Computer Science(), vol 9622. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49390-8_27
Download citation
DOI: https://doi.org/10.1007/978-3-662-49390-8_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-49389-2
Online ISBN: 978-3-662-49390-8
eBook Packages: Computer ScienceComputer Science (R0)