Advertisement

Searching Interesting Association Rules Based on Evolutionary Computation

  • Guangfei Yang
  • Yanzhong Dang
  • Shingo Mabu
  • Kaoru Shimada
  • Kotaro Hirasawa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7104)

Abstract

In this paper, we propose an evolutionary method to search interesting association rules. Most of the association rule mining methods give a large number of rules, and it is difficult for human beings to deal with them. We study this problem by borrowing the style of a search engine, that is, searching association rules by keywords. Whether a rule is interesting or not is decided by its relation to the keywords, and we introduce both semantic and statistical methods to measure such relation. The mining process is built on an evolutionary approach, Genetic Network Programming (GNP). Different from the conventional GNP based association rule mining method, the proposed method pays more attention to generate the GNP individuals carefully, which will mine interesting association rules efficiently.

Keywords

Association Rule Semantic Annotation Genetic Network Programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Mabu, S., Hirasawa, K., Hu, J.: A Graph-Based Evolutionary Algorithm: Genetic Network Programming (GNP) and Its Extension Using Reinforcement Learning. Evolutionary Computation 15(3), 369–398 (2007)CrossRefGoogle Scholar
  2. 2.
    Shimada, K., Hirasawa, K., Hu, J.: Class Association Rule Mining with Chi-Squared Test Using Genetic Network Programming. In: IEEE SMC (2006)Google Scholar
  3. 3.
    Yang, G., Shimada, K., Mabu, S., Hirasawa, K., Hu, J.: Mining Equalized Association Rules from Multi Concept Layers of Ontology Using Genetic Network Programming. In: IEEE CEC, Singapore, pp. 705–712 (2007)Google Scholar
  4. 4.
    Mei, Q., Xin, D., Cheng, H., Han, J., Zhai, C.: Generating Semantic Annotations for Frequent Patterns with Context Analysis. In: SIGKDD, pp. 337–346 (2006)Google Scholar
  5. 5.
    Liu, B., Hsu, W., Ma, Y.: Pruning and Summarizing the Discovered Associations. In: Proc. of the Fifth Int’l Conf. on Knowledge Discovery and Data Mining (KDD 1999), pp. 125–134 (1999)Google Scholar
  6. 6.
    Zaki, M.J., Hsiao, C.J.: CHARM: An Efficient Algorithm for Closed Itemset Mining. In: Proc. of the SIAM International Conference on Data Mining, pp. 457–473 (2002)Google Scholar
  7. 7.
    Han, J., Wang, J., Lu, Y., Tzvetkov, P.: Mining Top-k Frequent Closed Patterns without Minimum Support. In: Proc. of the 2002 IEEE Int’l Conf. on Data Mining (ICDM 2002), pp. 211–218 (2002)Google Scholar
  8. 8.
    Xin, D., Cheng, H., Yan, X., Han, J.: Extracting Redundancy-aware Top-k Patterns. In: Proc. of the Int’l Conf. on Knowledge Discovery and Data Mining(KDD 2006), pp. 444–453 (2006)Google Scholar
  9. 9.
    Suzuki, E.: Pitfalls for Categorizations of Objective Interestingness Measures for Rule Discovery. SCI, vol. 127, pp. 383–395 (2008)Google Scholar
  10. 10.
    Tan, P., Kumar, V., Srivastava, J.: Selecting the Right Interestingness Measure for Association Patterns. In: Proc. of the Eighth Int’l Conf. on Knowledge Discovery and Data Mining (KDD 2002), pp. 32–41 (2002)Google Scholar
  11. 11.
    Vaillant, B., Lenca, P., Lallich, S.: A Clustering of Interestingness Measures. Discovery Science, 290–297 (2004)Google Scholar
  12. 12.
    Liu, B., Zhao, K., Benkler, J., Xiao, W.: Rule Interestingness Analysis Using OLAP Operations. In: Proc. of the 12th Int’l Conf. on Knowledge Discovery and Data Mining (KDD 2006), pp. 297–306 (2006)Google Scholar
  13. 13.
    Lenca, P., Meyer, P., Vaillant, B., Lallich, S.: On Selecting Interestingness Measures for Association Rules: User Oriented Description and Multiple Criteria Decision Aid. European Journal of Operational Research 184(2), 610–626 (2008)CrossRefzbMATHGoogle Scholar
  14. 14.
    Silberschatz, A., Tuzhilin, A.: What Makes Patterns Interesting in Knowledge Discovery Systems. IEEE Trans. on Knowledge and Data Engineering 8(6), 970–974 (1996)CrossRefGoogle Scholar
  15. 15.
    Liu, B., Hsu, W., Mun, L., Lee, H.: Finding Interesting Patterns Using User Expectations. IEEE Trans. on Knowledge and Data Engineering 11(6), 817–832 (1999)CrossRefGoogle Scholar
  16. 16.
    Resnik, P.: Using information content to evaluate semantic similarity in a taxonomy. IJCAI (1995)Google Scholar
  17. 17.
    UC Irvine Machine Learning Repository, http://archive.ics.uci.edu/ml/

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Guangfei Yang
    • 1
  • Yanzhong Dang
    • 1
  • Shingo Mabu
    • 2
  • Kaoru Shimada
    • 2
  • Kotaro Hirasawa
    • 2
  1. 1.Institute of Systems EngineeringDalian University of TechnologyChina
  2. 2.Graduate School of IPSWaseda UniversityJapan

Personalised recommendations