基于多频繁项集关联规则的分类算法

Zhiheng Liang
{"title":"基于多频繁项集关联规则的分类算法","authors":"Zhiheng Liang","doi":"10.1109/HIS.2009.271","DOIUrl":null,"url":null,"abstract":"It is necessary to discrete datasets firstly if you want to data mining an association rule of datasets consisting of many categorical and numeric attributes by a traditional algorithm. However, in view of the versatility, the applications of the traditional algorithm are limited. This paper propose a new algorithm called ARMFI(Association Rule of Multiple Frequent Item-sets) which can data mining an Association Rule from datasets consisting of many categorical and numeric attributes directly and completely, and overcome disadvantage of the traditional algorithm. The result has been proofed that the ARMFI shows better performances than the traditional algorithm¿","PeriodicalId":414085,"journal":{"name":"2009 Ninth International Conference on Hybrid Intelligent Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Classification Algorithm Based on an Association Rule of Multiple Frequent Item-Sets\",\"authors\":\"Zhiheng Liang\",\"doi\":\"10.1109/HIS.2009.271\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is necessary to discrete datasets firstly if you want to data mining an association rule of datasets consisting of many categorical and numeric attributes by a traditional algorithm. However, in view of the versatility, the applications of the traditional algorithm are limited. This paper propose a new algorithm called ARMFI(Association Rule of Multiple Frequent Item-sets) which can data mining an Association Rule from datasets consisting of many categorical and numeric attributes directly and completely, and overcome disadvantage of the traditional algorithm. The result has been proofed that the ARMFI shows better performances than the traditional algorithm¿\",\"PeriodicalId\":414085,\"journal\":{\"name\":\"2009 Ninth International Conference on Hybrid Intelligent Systems\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Ninth International Conference on Hybrid Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HIS.2009.271\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Ninth International Conference on Hybrid Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HIS.2009.271","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

如果要用传统的算法对由许多分类属性和数值属性组成的数据集进行关联规则挖掘,首先需要对离散数据集进行挖掘。然而,由于其通用性,传统算法的应用受到了限制。本文提出了一种新的算法ARMFI(Multiple frequency item -set Association Rule of Multiple frequency item -set),该算法可以直接完整地从由许多分类属性和数字属性组成的数据集中挖掘出关联规则,克服了传统算法的缺点。实验结果表明,该算法比传统算法具有更好的性能
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Classification Algorithm Based on an Association Rule of Multiple Frequent Item-Sets
It is necessary to discrete datasets firstly if you want to data mining an association rule of datasets consisting of many categorical and numeric attributes by a traditional algorithm. However, in view of the versatility, the applications of the traditional algorithm are limited. This paper propose a new algorithm called ARMFI(Association Rule of Multiple Frequent Item-sets) which can data mining an Association Rule from datasets consisting of many categorical and numeric attributes directly and completely, and overcome disadvantage of the traditional algorithm. The result has been proofed that the ARMFI shows better performances than the traditional algorithm¿
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信