Knowledge Mining from Large Volume of Dataset using Fuzzy Association Rule

Sudersan Behera
{"title":"Knowledge Mining from Large Volume of Dataset using Fuzzy Association Rule","authors":"Sudersan Behera","doi":"10.1109/ICISC44355.2019.9036356","DOIUrl":null,"url":null,"abstract":"As we know that fuzzy association rules are used to convert crisp set elements in to fuzzy set elements like “height=long”. On other hand Association rules on crisp set are bounded with in a limit to transfer crisp set elements in to the binary values like “height = [5.5feet or above]” and it losses some information at boundaries because of its restricted nature. Today the variations of fuzzy association rule mining is most popular. As the crisp version of Apriori, fuzzy Apriori algorithms are quit inefficient for large volume of data sets. Hence it is required to bring an efficient and powerful FA rule mining for better performance over large volume of data sets. I f we compare the fuzzy Apriori with the proposed algorithm the proposed algorithm is almost 16% faster than the earlier one if both the algorithm compared together in case of very large data sets. The proposed algorithm also has excellent processing techniques to convert the non-fuzzy dataset into fuzzy dataset","PeriodicalId":419157,"journal":{"name":"2019 Third International Conference on Inventive Systems and Control (ICISC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Third International Conference on Inventive Systems and Control (ICISC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISC44355.2019.9036356","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

As we know that fuzzy association rules are used to convert crisp set elements in to fuzzy set elements like “height=long”. On other hand Association rules on crisp set are bounded with in a limit to transfer crisp set elements in to the binary values like “height = [5.5feet or above]” and it losses some information at boundaries because of its restricted nature. Today the variations of fuzzy association rule mining is most popular. As the crisp version of Apriori, fuzzy Apriori algorithms are quit inefficient for large volume of data sets. Hence it is required to bring an efficient and powerful FA rule mining for better performance over large volume of data sets. I f we compare the fuzzy Apriori with the proposed algorithm the proposed algorithm is almost 16% faster than the earlier one if both the algorithm compared together in case of very large data sets. The proposed algorithm also has excellent processing techniques to convert the non-fuzzy dataset into fuzzy dataset
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于模糊关联规则的大数据集知识挖掘
正如我们所知,模糊关联规则用于将清晰的集合元素转换为模糊集合元素,如“height=long”。另一方面,脆集上的关联规则被限定在一个极限内,以将脆集元素转换为二进制值,如“高度=[5.5英尺或以上]”,并且由于其局限性,它在边界处丢失了一些信息。目前,模糊关联规则挖掘的变体最为流行。模糊Apriori算法作为Apriori的精简版,在处理大量数据集时效率低下。因此,为了在大量数据集上获得更好的性能,需要提供高效而强大的FA规则挖掘。如果我们将模糊Apriori与所提出的算法进行比较,如果在非常大的数据集的情况下将两种算法一起比较,则所提出的算法比之前的算法快近16%。该算法还具有将非模糊数据集转换为模糊数据集的良好处理技术
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Reduction of Noises From Degraded Document Images Using Image Enhancement Techniques Effective Detection of Voice Dysfunction Using Glottic Flow Descriptors A Survey on Machine Learning in Agriculture - background work for an unmanned coconut tree harvester An Approach of Image Enhancement Technique in Recognizing the Number Plate Location FPGA Implementation of Multiplier-Accumulator Unit using Vedic multiplier and Reversible gates
×
引用
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