基于遗传优化隶属函数的模糊关联规则挖掘聚类算法

Mehmet Kaya, R. Alhajj
{"title":"基于遗传优化隶属函数的模糊关联规则挖掘聚类算法","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":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2003-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"69","resultStr":"{\"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\":null,\"pages\":null},\"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}","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

摘要

本文提出了一种基于遗传算法(GAs)的聚类方法,该方法在用户指定的最小支持值区间内动态调整模糊集以提供最大利润。这是通过调整每个定量属性的隶属函数的基本值来实现的,以便在最小支持值的一定间隔内最大化大型项目集的总和。据我们所知,这是在这个方向上的第一次努力。为了支持我们的说法,我们比较了提议的基于gas的方法和基于cure的方法。在综合事务上的实验结果表明,所提出的聚类方法在产生大项目集的数量和有趣的关联规则方面都比基于cure的聚类方法表现出更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A clustering algorithm with genetically optimized membership functions for fuzzy association rules mining
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信