Optimizing Membership Functions using Learning Automata for Fuzzy Association Rule Mining

Z. Anari, A. Hatamlou, B. Anari, Mohammad Masdari
{"title":"Optimizing Membership Functions using Learning Automata for Fuzzy Association Rule Mining","authors":"Z. Anari, A. Hatamlou, B. Anari, Mohammad Masdari","doi":"10.22044/JADM.2020.8928.2029","DOIUrl":null,"url":null,"abstract":"The Transactions in web data often consist of quantitative data, suggesting that fuzzy set theory can be used to represent such data. The time spent by users on each web page is one type of web data, was regarded as a trapezoidal membership function (TMF) and can be used to evaluate user browsing behavior. The quality of mining fuzzy association rules depends on membership functions and since the membership functions of each web page are different from those of other web pages, so automatic finding the number and position of TMF is significant. In this paper, a different reinforcement-based optimization approach called LA-OMF was proposed to find both the number and positions of TMFs for fuzzy association rules. In the proposed algorithm, the centers and spreads of TMFs were considered as parameters of the search space, and a new representation using learning automata (LA) was proposed to optimize these parameters. The performance of the proposed approach was evaluated and the results were compared with the results of other algorithms on a real dataset. Experiments on datasets with different sizes confirmed that the proposed LA-OMF improved the efficiency of mining fuzzy association rules by extracting optimized membership functions.","PeriodicalId":32592,"journal":{"name":"Journal of Artificial Intelligence and Data Mining","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Artificial Intelligence and Data Mining","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22044/JADM.2020.8928.2029","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The Transactions in web data often consist of quantitative data, suggesting that fuzzy set theory can be used to represent such data. The time spent by users on each web page is one type of web data, was regarded as a trapezoidal membership function (TMF) and can be used to evaluate user browsing behavior. The quality of mining fuzzy association rules depends on membership functions and since the membership functions of each web page are different from those of other web pages, so automatic finding the number and position of TMF is significant. In this paper, a different reinforcement-based optimization approach called LA-OMF was proposed to find both the number and positions of TMFs for fuzzy association rules. In the proposed algorithm, the centers and spreads of TMFs were considered as parameters of the search space, and a new representation using learning automata (LA) was proposed to optimize these parameters. The performance of the proposed approach was evaluated and the results were compared with the results of other algorithms on a real dataset. Experiments on datasets with different sizes confirmed that the proposed LA-OMF improved the efficiency of mining fuzzy association rules by extracting optimized membership functions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用学习自动机优化模糊关联规则挖掘的隶属函数
网络数据中的交易通常由定量数据组成,这表明模糊集理论可以用来表示这些数据。用户在每个网页上花费的时间是一种类型的网络数据,被视为梯形隶属函数(TMF),可以用来评估用户的浏览行为。挖掘模糊关联规则的质量取决于隶属函数,由于每个网页的隶属函数与其他网页的隶属度不同,因此自动查找TMF的数量和位置具有重要意义。在本文中,提出了一种不同的基于强化的优化方法,称为LA-OMF,以找到模糊关联规则的TMF的数量和位置。在所提出的算法中,TMF的中心和扩展被视为搜索空间的参数,并提出了一种新的使用学习自动机(LA)的表示来优化这些参数。对所提出的方法的性能进行了评估,并将结果与其他算法在真实数据集上的结果进行了比较。在不同大小数据集上的实验证实,所提出的LA-OMF通过提取优化的隶属函数来提高模糊关联规则的挖掘效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
审稿时长
8 weeks
期刊最新文献
Nasal Breath Input: Exploring Nasal Breath Input Method for Hands-Free Input by Using a Glasses Type Device with Piezoelectric Elements Sentiment Mining and Analysis over Text Corpora via Complex Deep Learning Naural Architectures An Intelligent Model for Prediction of In-Vitro Fertilization Success using MLP Neural Network and GA Optimization Robust Vein Recognition against Rotation Using Kernel Sparse Representation Improving Speed and Efficiency of Dynamic Programming Methods through Chaos
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1