{"title":"A clustering algorithm with genetically optimized membership functions for fuzzy association rules mining","authors":"Mehmet Kaya, R. Alhajj","doi":"10.1109/FUZZ.2003.1206547","DOIUrl":null,"url":null,"abstract":"In this paper, we propose genetic algorithms (GAs) based clustering method, which dynamically adjusts the fuzzy sets to provide maximum profit within an interval of user specified minimum support values. This is achieved by tuning the base values of the membership functions for each quantitative attribute so as to maximize the sum of large itemsets in a certain interval of minimum support values. To the best of our knowledge, this is the first effort in this direction. To support our claim, we compare the proposed GAs-based approach with a CURE-based approach. Experimental results on synthetic transactions show that the proposed clustering method exhibits a good performance over CURE-based approach in terms of the number of produced large itemsets and interesting association rules.","PeriodicalId":212172,"journal":{"name":"The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"69","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FUZZ.2003.1206547","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 69
Abstract
In this paper, we propose genetic algorithms (GAs) based clustering method, which dynamically adjusts the fuzzy sets to provide maximum profit within an interval of user specified minimum support values. This is achieved by tuning the base values of the membership functions for each quantitative attribute so as to maximize the sum of large itemsets in a certain interval of minimum support values. To the best of our knowledge, this is the first effort in this direction. To support our claim, we compare the proposed GAs-based approach with a CURE-based approach. Experimental results on synthetic transactions show that the proposed clustering method exhibits a good performance over CURE-based approach in terms of the number of produced large itemsets and interesting association rules.