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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Shimada, K., Hirasawa, K., Hu, J.: Class Association Rule Mining with Chi-Squared Test Using Genetic Network Programming. In: IEEE SMC (2006)
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)
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)
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)
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)
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)
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)
Suzuki, E.: Pitfalls for Categorizations of Objective Interestingness Measures for Rule Discovery. SCI, vol. 127, pp. 383–395 (2008)
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)
Vaillant, B., Lenca, P., Lallich, S.: A Clustering of Interestingness Measures. Discovery Science, 290–297 (2004)
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)
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)
Silberschatz, A., Tuzhilin, A.: What Makes Patterns Interesting in Knowledge Discovery Systems. IEEE Trans. on Knowledge and Data Engineering 8(6), 970–974 (1996)
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)
Resnik, P.: Using information content to evaluate semantic similarity in a taxonomy. IJCAI (1995)
UC Irvine Machine Learning Repository, http://archive.ics.uci.edu/ml/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, G., Dang, Y., Mabu, S., Shimada, K., Hirasawa, K. (2012). Searching Interesting Association Rules Based on Evolutionary Computation. In: Cao, L., Huang, J.Z., Bailey, J., Koh, Y.S., Luo, J. (eds) New Frontiers in Applied Data Mining. PAKDD 2011. Lecture Notes in Computer Science(), vol 7104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28320-8_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-28320-8_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28319-2
Online ISBN: 978-3-642-28320-8
eBook Packages: Computer ScienceComputer Science (R0)