International Journal of Scientific & Technology Research

Home About Us Scope Editorial Board Blog/Latest News Contact Us
10th percentile
Powered by  Scopus
Scopus coverage:
Nov 2018 to May 2020


IJSTR >> Volume 8 - Issue 11, November 2019 Edition

International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616

Time Complexity Of A Priori And Evolutionary Algorithm For Numerical Association Rule Mining Optimization

[Full Text]



Imam Tahyudin, haviluddin Haviluddin, Hidetaka Nanbo



time complexity, numerical association rule mining, a priori, evolutionary algorithm.



Some of the solutions for solving numerical Association rule mining problem are by discretization and optimization methods. The popular algorithms of optimization are A priori algorithms, Genetic algorithms (GA) and Particle swarm optimization (PSO). This research has aim to study time complexity of those optimization algorithms. The results show that the time complexity of evolutionary algorithms such as GA and PSO are faster than the time complexity of A priori algorithms.



[1] J. Han and Kamber Micheline, Data Mining: Concepts and Techniques (Second Edition). 2015.
[2] A. Y. Zomaya and S. Sakr, Handbook of big data technologies. 2017.
[3] I. H. Witten, E. Frank, M. A. Hall, and C. J. Pal, Data Mining: Practical Machine Learning Tools and Techniques. 2016.
[4] M. Kaya, “Multi-objective genetic algorithm based approaches for mining optimized fuzzy association rules,” Soft Comput., 2006.
[5] H. WATANABE, Toshihiko TAKAHASHI, “A Study on Quantitative Association Rules Mining Algorithm Based on Clustering Algorithm,” Int. J. Biomed. Soft Comput. Hum. Sci. Off. J. Biomed. Fuzzy Syst. Assoc., vol. 16, no. 2, pp. 59–67, 2011.
[6] M. G. AROTARITEI, Dragos NEGOITA, “An optimization of data mining algorithms used in fuzzy association rules,” in International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, 2003, pp. 980–985.
[7] K. Gandhi et al., “An analysis of multi-criteria decision making methods An Analysis of Multi-Criteria Decision Making Methods,” Expert Syst. Appl., 2015.
[8] D. Karaboga and E. Kaya, “Adaptive network based fuzzy inference system (ANFIS) training approaches: a comprehensive survey,” Artificial Intelligence Review, 2018.
[9] R. J. Kuo, M. Gosumolo, and F. E. Zulvia, “Multi-objective particle swarm optimization algorithm using adaptive archive grid for numerical association rule mining,” Neural Computing and Applications, 2017.
[10] C. Li, Y. Liu, A. Zhou, L. Kang, and H. Wang, “A fast particle swarm optimization algorithm with cauchy mutation and natural selection strategy,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2007.
[11] I. Tahyudin and H. Nambo, “The combination of evolutionary algorithm method for numerical association rule mining optimization,” in Advances in Intelligent Systems and Computing, 2017.
[12] C. C. Aggarwal, Data Mining: The Textbook. 2015.
[13] B. Minaei-Bidgoli, R. Barmaki, and M. Nasiri, “Mining numerical association rules via multi-objective genetic algorithms,” Inf. Sci. (Ny)., 2013.
[14] R. J. Bayardo, “Efficiently mining long patterns from databases,” SIGMOD Rec., 1998.
[15] K. Gouda and M. J. Zaki, “Efficiently mining maximal frequent itemsets,” in Proceedings - IEEE International Conference on Data Mining, ICDM, 2001.
[16] H. R. Qodmanan, M. Nasiri, and B. Minaei-Bidgoli, “Multi objective association rule mining with genetic algorithm without specifying minimum support and minimum confidence,” Expert Syst. Appl., 2011.
[17] Haviluddin and R. Alfred, “A genetic-based backpropagation neural network for forecasting in time-series data,” in Proceedings - 2015 International Conference on Science in Information Technology: Big Data Spectrum for Future Information Economy, ICSITech 2015, 2016.
[18] P.-N. Tan, M. Steinbach, and V. Kumar, “Association Analysis: Basic Concepts and Algorithms,” Introd. to Data Min., 2005.
[19] F. G. Lobo, D. E. Goldberg, and M. Pelikan, “Time complexity of genetic algorithms on exponentially scaled problems,” Proc. Genet. Evol. Comput. Conf., 2000.
[20] P. S. Oliveto, J. He, and X. Yao, “Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results,” Int. J. Autom. Comput., 2007.