Advertisement

The Rules Determination of Numerical Association Rule Mining Optimization by Using Combination of PSO and Cauchy Distribution

  • Imam TahyudinEmail author
  • Hidetaka Nambo
Conference paper
Part of the Lecture Notes on Multidisciplinary Industrial Engineering book series (LNMUINEN)

Abstract

One of the optimization methods to solve the numerical association rule mining problem is particle swarm optimization (PSO). This method is popularly used in various fields such as in the job scheduling problem, evaluating stock market, inferring gen regulatory networks and numerical association rule mining optimization. The weakness of the PSO is often premature for searching the optimal solution because it traps in local optima when the best particle is being searched in every iteration. Combining the PSO with Cauchy distribution for numerical association rule mining problem (PARCD) is a solution because it is robust for finding the optimal solution in a large neighborhood. The important point in this proposed method is particle representation which to know the association between one attribute to another. Therefore, this study has the aim to determinate rules of numerical association rule mining and also to calculate the multi-objective function using combination of PSO and Cauchy distribution. The results show that all of them explain every attribute to formulate the rule well. In addition, the multi-objective function value of PARCD method generally produces results which better than the previous method, MOPAR.

Keywords

PSO Cauchy distribution Numerical association rule mining Particle representation Multi-objective functions PARCD MOPAR 

Notes

Acknowledgements

This research supported by various parties. We would like to thank for scholarship program from Kanazawa University, Japan and Ministry of Research and Technology and Directorate of Higher Education (KEMENRISTEKDIKTI) and also STMIK AMIKOM Purwokerto, Indonesia. In addition, we thank for anonymous reviewers who gave input and correction for improving this research.

References

  1. 1.
    Alatas B, Akin E (2008) Rough particle swarm optimization and its applications in data mining. Soft Comput 12(12):1205–1218CrossRefzbMATHGoogle Scholar
  2. 2.
    Alatas B, Akin E, Karci A (2008) Modenar: multi-objective differential evolution algorithm for mining numeric association rules. Appl Soft Comput 8(1):646–656CrossRefGoogle Scholar
  3. 3.
    Alhajj R, Kaya M (2008) Multi-objective genetic algorithms based automated clustering for fuzzy association rules mining. J Intell Inf Syst 31(3):243–264CrossRefGoogle Scholar
  4. 4.
    Álvarez VP, Vázquez JM (2012) An evolutionary algorithm to discover quantitative association rules from huge databases without the need for an a priori discretization. Expert Syst Appl 39(1):585–593CrossRefGoogle Scholar
  5. 5.
    Arotaritei D, Negoita MG (2003) An optimization of data mining algorithms used in fuzzy association rules. In: International Conference on Knowledge-Based and Intelligent Information and Engineering Systems. Springer, Heidelberg, pp 980–985Google Scholar
  6. 6.
    Beiranvand V, Mobasher-Kashani M, Bakar AA (2014) Multi-objective pso algorithm for mining numerical association rules without a priori discretization. Expert Syst Appl 41(9):4259–4273CrossRefGoogle Scholar
  7. 7.
    Gen M, Lin L, Howada (2015) Hybrid evolutionary algorithms and data mining: case studies of clustering. Proc Soc Plant Eng 2015:184–196Google Scholar
  8. 8.
    Ghosh A, Nath B (2004) Multi-objective rule mining using genetic algorithms. Inf Sci 163(1–3):123–133MathSciNetCrossRefGoogle Scholar
  9. 9.
    Indira K, Kanmani S (2015) Association rule mining through adaptive parameter control in particle swarm optimization. Comput Stat 30(1):251–277MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Kaya M (2006) Multi-objective genetic algorithm based approaches for mining optimized fuzzy association rules. Soft Comput 10(7):578–586CrossRefzbMATHGoogle Scholar
  11. 11.
    Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol 4, pp 1942–1948Google Scholar
  12. 12.
    Li C, Liu Y et al (2007) A fast particle swarm optimization algorithm with cauchy mutation and natural selection strategy. In: International Symposium on Intelligence Computation and Applications. Springer, Heidelberg, pp 334–343Google Scholar
  13. 13.
    Minaei-Bidgoli B, Barmaki R, Nasiri M (2013) Mining numerical association rules via multi-objective genetic algorithms. Inf Sci 233:15–24CrossRefGoogle Scholar
  14. 14.
    Narita M, Haraguchi M, Okubo Y (2002) Data abstractions for numerical attributes in data mining. Lecture Notes in Computer Science, vol 2412, pp 35–42Google Scholar
  15. 15.
    Qodmanan HR, Nasiri M, Minaei-Bidgoli B (2011) Multi objective association rule mining with genetic algorithm without specifying minimum support and minimum confidence. Expert Syst Appl 38(1):288–298CrossRefGoogle Scholar
  16. 16.
    Sangsawang C, Sethanan K et al (2015) Metaheuristics optimization approaches for two-stage reentrant flexible flow shop with blocking constraint. Expert Syst Appl 42(5):2395–2410CrossRefGoogle Scholar
  17. 17.
    Sarath K, Ravi V (2013) Association rule mining using binary particle swarm optimization. Eng Appl Artif Intell 26(8):1832–1840CrossRefGoogle Scholar
  18. 18.
    Tahyudin I, Nambo H (2017) The combination of evolutionary algorithm method for numerical association rule mining optimization. In: Proceedings of the Tenth International Conference on Management Science and Engineering Management. Springer, Heidelberg, pp 13–23Google Scholar
  19. 19.
    Witten IH, Frank E (2005) Data Mining: Practical machine learning tools and techniques. Morgan Kaufmann, San FranciscozbMATHGoogle Scholar
  20. 20.
    Yan X, Zhang C, Zhang S (2009) Genetic algorithm-based strategy for identifying association rules without specifying actual minimum support. Expert Syst Appl 36(2):3066–3076CrossRefGoogle Scholar
  21. 21.
    Yu M, Zhang Y et al (2015) Integration of process planning and scheduling using a hybrid ga/pso algorithm. Int J Adv Manuf Technol 78(1–4):583–592CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Artificial Intelligence Laboratory, Division of Electrical Engineering and Computer Science, Graduate School of Natural Science and TechnologyKanazawa UniversityKanazawaJapan
  2. 2.Department of Information SystemSTMIK AMIKOM PurwokertoPurwokertoIndonesia

Personalised recommendations