基于增强关联规则的文本分类

Yongwook Yoon, G. G. Lee
{"title":"基于增强关联规则的文本分类","authors":"Yongwook Yoon, G. G. Lee","doi":"10.1109/ICSC.2008.70","DOIUrl":null,"url":null,"abstract":"Associative classification is a novel and powerful method originating from association rule mining. In the previous studies, a relatively small number of high-quality association rules were used in the prediction. We propose a new approach in which a large number of association rules are generated. Then, the rules are filtered using a new method which is equivalent to a deterministic Boosting algorithm. Through this equivalence, our approach effectively adapts to large-scale classification tasks such as text categorization. Experiments with various text collections show that our method achieves one of the best prediction performance compared with the state-of-the-arts of this field.","PeriodicalId":102805,"journal":{"name":"2008 IEEE International Conference on Semantic Computing","volume":"126 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"Text Categorization Based on Boosting Association Rules\",\"authors\":\"Yongwook Yoon, G. G. Lee\",\"doi\":\"10.1109/ICSC.2008.70\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Associative classification is a novel and powerful method originating from association rule mining. In the previous studies, a relatively small number of high-quality association rules were used in the prediction. We propose a new approach in which a large number of association rules are generated. Then, the rules are filtered using a new method which is equivalent to a deterministic Boosting algorithm. Through this equivalence, our approach effectively adapts to large-scale classification tasks such as text categorization. Experiments with various text collections show that our method achieves one of the best prediction performance compared with the state-of-the-arts of this field.\",\"PeriodicalId\":102805,\"journal\":{\"name\":\"2008 IEEE International Conference on Semantic Computing\",\"volume\":\"126 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-08-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE International Conference on Semantic Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSC.2008.70\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Conference on Semantic Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSC.2008.70","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 28

摘要

关联分类是源于关联规则挖掘的一种新颖而强大的分类方法。在以往的研究中,用于预测的高质量关联规则数量相对较少。我们提出了一种生成大量关联规则的新方法。然后,使用一种相当于确定性增强算法的新方法对规则进行过滤。通过这种等价性,我们的方法有效地适应了大规模的分类任务,如文本分类。对各种文本集的实验表明,与该领域的最新技术相比,我们的方法达到了最好的预测性能之一。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Text Categorization Based on Boosting Association Rules
Associative classification is a novel and powerful method originating from association rule mining. In the previous studies, a relatively small number of high-quality association rules were used in the prediction. We propose a new approach in which a large number of association rules are generated. Then, the rules are filtered using a new method which is equivalent to a deterministic Boosting algorithm. Through this equivalence, our approach effectively adapts to large-scale classification tasks such as text categorization. Experiments with various text collections show that our method achieves one of the best prediction performance compared with the state-of-the-arts of this field.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信