Advertisement

The Research on Association Rules Mining with Co-evolution Algorithm in High Dimensional Data

  • Wei Lou
  • Lei Zhu
  • Limin Yan
Part of the Communications in Computer and Information Science book series (CCIS, volume 324)

Abstract

This paper adopts a co-evolution algorithm, which utilizes improved genetic algorithm and particle swarm optimization algorithm to iterate two populations simultaneously. Meanwhile, the mechanism of information interaction between these two populations is introduced. Finally, experiments and application have been made to prove that on the premise of acceptable time complexity, not only does the co-evolution algorithm inherit the superiority of traditional genetic algorithm such as reducing the number of scanning the database effectively and generating small-scale candidate item sets, but also avoid the phenomenon of premature through comparing the properties of co-evolution algorithm, traditional genetic algorithm and particle swarm optimization algorithm when used in association rules mining. High quality association rules can be found when adopted the co-evolution algorithm, especially in high-dimension database.

Keywords

Association rules mining Co-evolution Genetic algorithm (GA) Particle swarm optimization (PSO) algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 2nd edn., pp. 146–155. China Machine Press (2011)Google Scholar
  2. 2.
    Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proc. 1993 ACM-SIGMOD Int. Conf. Management of Databases, pp. 20–72. ACM Press, Washington, DC (1993)Google Scholar
  3. 3.
    Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM-SIGMOD International Conference on Management of Data, Dallas, Texas, pp. 1–12. ACM Press (2000)Google Scholar
  4. 4.
    Savasere, A., Omiecinski, E., Navathe, S.: An efficient algorithm for mining association rules in large databases. In: Dayal, U., Gray, P.M.D., Nishio, S. (eds.) Proceedings of the 21th International Conference on Very Large Databases(VLDB 1995), Zurich, pp. 432–443. Morgan Kaufmann Publisher (1995)Google Scholar
  5. 5.
    Wiegand, R.P.: An analysis of cooperative co-evolutionary algorithms. George Mason University, Fairfax (2003)Google Scholar
  6. 6.
    Sharma, S.K., Irwin, G.W.: Fuzzy coding of genetic algorithms. IEEE Trans. Evolutionary Computation, 344–355 (2003)Google Scholar
  7. 7.
    Thierens, D.: Adaptive mutation rate control schemes in genetic algorithms. In: Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002, vol. 1, pp. 980–985 (2002)Google Scholar
  8. 8.
    Shi, Y., Eberhart, R.C.: Parameter Selection in Particle Swarm Adaptation. In: Porto, V.W., Waagen, D. (eds.) EP 1998. LNCS, vol. 1447, pp. 591–600. Springer, Heidelberg (1998)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Wei Lou
    • 1
  • Lei Zhu
    • 1
  • Limin Yan
    • 1
  1. 1.School of Mechatronics Engineering and AutomationShanghai UniversityShanghaiChina

Personalised recommendations