A new association rule-based text classifier algorithm

S. Buddeewong, W. Kreesuradej
{"title":"A new association rule-based text classifier algorithm","authors":"S. Buddeewong, W. Kreesuradej","doi":"10.1109/ICTAI.2005.13","DOIUrl":null,"url":null,"abstract":"This paper proposes a new association rule-based text classifier algorithm to improve the prediction accuracy of association rule-based classifier by categories (ARC-BC) algorithm. Unlike the previous algorithms, the proposed association rule generation algorithm constructs two types of frequent itemsets. The first frequent itemsets, i.e. Lk contain all term that have no an overlap with other categories. The second frequent itemsets, i.e. OLk contain all features that have an overlap with other categories. In addition, this paper also proposes a new join operation for the second frequent itemsets. The experimental results are shown a good performance of the proposed classifier","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2005.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

Abstract

This paper proposes a new association rule-based text classifier algorithm to improve the prediction accuracy of association rule-based classifier by categories (ARC-BC) algorithm. Unlike the previous algorithms, the proposed association rule generation algorithm constructs two types of frequent itemsets. The first frequent itemsets, i.e. Lk contain all term that have no an overlap with other categories. The second frequent itemsets, i.e. OLk contain all features that have an overlap with other categories. In addition, this paper also proposes a new join operation for the second frequent itemsets. The experimental results are shown a good performance of the proposed classifier
一种新的基于关联规则的文本分类算法
为了提高基于类别关联规则分类器(ARC-BC)算法的预测精度,提出了一种新的基于关联规则的文本分类器算法。与之前的算法不同,本文提出的关联规则生成算法构建了两种类型的频繁项集。第一个频繁项集,即Lk包含所有与其他类别没有重叠的项。第二个频繁项目集,即OLk包含与其他类别有重叠的所有特征。此外,本文还提出了一种新的二次频繁项集连接操作。实验结果表明,该分类器具有良好的性能
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信