Multi-objective genetic algorithm based approaches for mining optimized fuzzy association rules. (English) Zbl 1110.68127

Summary: Association rules form one of the most widely used techniques to discover correlations among attribute in a database. So far, some efficient methods have been proposed to obtain these rules with respect to an optimal goal, such as: to maximize the number of large itemsets and interesting rules or the values of support and confidence for the discovered rules. This paper first introduces optimized fuzzy association rule mining in terms of three important criteria; strongness, interestingness and comprehensibility. Then, it proposes multi-objective genetic algorithm based approaches for discovering these optimized rules. Optimization technique according to given criterion may be one of two different forms; The first tries to determine the appropriate fuzzy sets of quantitative attributes in a prespecified rule, which is also called as certain rule. The second deals with finding both uncertain rules and their appropriate fuzzy sets. Experimental results conducted on a real data set show the effectiveness and applicability of the proposed approach.


68T05 Learning and adaptive systems in artificial intelligence
Full Text: DOI


[1] Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of ACM SIGMOD, pp 207-216
[2] Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the International Conference on very large data bases. Santiago, Chile, pp 487-499
[3] Bayardo R, Srikant R (1999) Mining the most interesting rules. KDD-99. San Diego, pp 145-154
[4] Chan KCC, Au WH (1997) Mining fuzzy association rules. In: Proceedings of ACM international conference on information and knowledge management, pp 209-215
[5] Delgado, M.; Marin, N.; Sanchez, D.; Vila, MA, Fuzzy association rules: general model and applications, IEEE Trans Fuzzy Sys, 11, 2, 214-225 (2003)
[6] Fidelis MV, Lopes HS, Freitas AA (2000) Discovering comprehensible classification rules with a genetic algorithm. In: Proceedings of congress on evolutionary computation
[7] Freitas, AA, On rule interestingness measures, Knowl Based Syst, 12, 309-315 (1999)
[8] Fu AWC et al (1998) Finding fuzzy sets for the mining of association rules for numerical attributes. In: Proceedings of the international symposium of intelligent data engineering and learning, pp 263-268
[9] Fukuda T, Morimoto Y, Morishita S, Tokuyama T (1996) Mining optimized association rules for numeric attributes. In: Proc ACM SIGACT-SIGMOD-SIGART symposium principles of database systems · Zbl 0943.68050
[10] Fukuda T, Morimoto Y, Morishita S, Tokuyama T (1996) Data mining using two dimensional optimized association rules: scheme, algorithms, and visualization. In: Proceedings ACM SIGMOD conference management of data · Zbl 1136.68381
[11] Ghosh, A.; Nath, B., Multi-objective rule mining using genetic algorithms, Inf Sci, 163, 1-3, 123-133 (2004)
[12] Gyenesi A (2001) Determining fuzzy sets for quantitative attributes in data mining problems. In: Proceedings of advance in fuzzy systems and Evolutionary Computation, pp 48-53
[13] Gyenesi A (2001) Interestingness measures for fuzzy association rules. PKDD 2001, LNAI 2168, pp 152-164 · Zbl 1009.68728
[14] Hilderman RJ, Hamilton HJ (1999) Knowledge discovery and interestingness measures: a survey, Technical Report CS 99-04, University of Regina, Canada
[15] Liu B, Hsu W, Ma YM (1999) Pruning and summarizing the discovered association. KDD-99, San Diego, pp 125-134
[16] Liu, B.; Hsu, W.; Ma, YM, Analyzing the subjective interestingness of association rules, IEEE Intelli Sys, 15, 5, 47-55 (2000)
[17] Kaya M, Alhajj R, Polat F, Arslan A (2002) Efficient automated mining of fuzzy association rules. In: Proceedings of the international conference on database and expert systems with applications · Zbl 1017.68744
[18] Kaya M, Alhajj R (2003) A clustering algorithm with genetically optimized membership functions for fuzzy association rules mining. The IEEE international conference on fuzzy systems, St Louis, May 25-28 · Zbl 1029.68578
[19] Kaya M, Alhajj R (2003) Facilitating fuzzy association rules mining by using multi-objective genetic algorithms for automated clustering, 2003 IEEE International Conference on Data Mining, Melbourne, 19-22 November
[20] Kuok, CM; Fu, AW; Wong, MH, Mining fuzzy association rules in databases, SIGMOD Record, 17, 1, 41-46 (1998)
[21] Ng R, Han J (1994) Efficient and effective clustering methods for spatial data mining. In: Proceedings of the international conference on very large databases
[22] Omiecinski, E., Alternative interest measures for mining associations in databases, IEEE Trans Knowl Data Eng, 15, 1, 57-69 (2003)
[23] Padmanabban B, Tuzhulin A (2000) Small is beautiful: discovery the minimal set of unexpected patterns. KDD-2000, pp 54-63, Boston
[24] Rastogi, R.; Shim, S., Mining optimized support rules for numeric attributes, Info Sys, 26, 425-444 (2001) · Zbl 0982.68141
[25] Rastogi, R.; Shim, S., Mining optimized association rules with categorical and numeric attributes, IEEE Trans Knowl Data Eng, 14, 1, 29-50 (2002)
[26] Silberschatz, A.; Tuzhulin, A., What makes patterns interesting in knowledge discovery systems, IEEE Trans Knowl Data Eng, 8, 6, 970-974 (1996)
[27] Srikant R, Agrawal R (1996) Mining quantitative association rules in large relational tables. In: Proceedings of ACM SIGMOD, pp 1-12
[28] Tan PN, Kumar V, Srivastava J (2002) Selecting the right interestingness measures for association patterns. SIGKDD’02, pp 33-41, Edmonton
[29] Zitzler, E.; Thiele, L., Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach, IEEE Transa Evol Comput, 3, 4, 257-271 (1999)
[30] Zhang W (1999) Mining fuzzy quantitative association rules. In: Proceedings of IEEE ICTAI, pp 99-102
[31] http://www.ics.uci.edu/∼mlearn/MLRepository.html
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.