基于k-交互测度的优化数据挖掘

Nian Yan, Zhengxin Chen, Yong Shi
{"title":"基于k-交互测度的优化数据挖掘","authors":"Nian Yan, Zhengxin Chen, Yong Shi","doi":"10.1109/WIIAT.2008.152","DOIUrl":null,"url":null,"abstract":"Optimization-based methods have been used for data separation in different domains and applications since 1960s. The commonality of those methods is to separate data by minimizing the overlapping between the groups and regard contribution from all the attributes toward the target of classification is the sum of every single attribute. However, the interaction among the attributes in the data is not considered at all. The theory of non-additive measures is used to describe those interactions. The consideration of the interactions is a breakthrough for dealing with the nonlinearity of data. Through the non-additive measure has been successfully utilized in optimization-based classification, it increases the computation cost as well as the quadratic programming models particularly designed for dealing with the nonlinearity. In this paper, we proposed the optimization-based classification method with the signed k-interactive measure. The experimental results shows that it successfully reduced the computation but retained the classification power.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Using k-Interactive Measure in Optimization-Based Data Mining\",\"authors\":\"Nian Yan, Zhengxin Chen, Yong Shi\",\"doi\":\"10.1109/WIIAT.2008.152\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Optimization-based methods have been used for data separation in different domains and applications since 1960s. The commonality of those methods is to separate data by minimizing the overlapping between the groups and regard contribution from all the attributes toward the target of classification is the sum of every single attribute. However, the interaction among the attributes in the data is not considered at all. The theory of non-additive measures is used to describe those interactions. The consideration of the interactions is a breakthrough for dealing with the nonlinearity of data. Through the non-additive measure has been successfully utilized in optimization-based classification, it increases the computation cost as well as the quadratic programming models particularly designed for dealing with the nonlinearity. In this paper, we proposed the optimization-based classification method with the signed k-interactive measure. The experimental results shows that it successfully reduced the computation but retained the classification power.\",\"PeriodicalId\":393772,\"journal\":{\"name\":\"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WIIAT.2008.152\",\"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/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIIAT.2008.152","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

自20世纪60年代以来,基于优化的方法已被用于不同领域和应用的数据分离。这些方法的共同点是通过最小化组间重叠来分离数据,并将所有属性对分类目标的贡献视为每个单个属性的总和。但是,根本没有考虑数据中属性之间的交互。非加性测度理论用于描述这些相互作用。考虑相互作用是处理数据非线性的一个突破。通过将非加性度量成功地应用于基于优化的分类中,它增加了计算量,也增加了专门为处理非线性而设计的二次规划模型。本文提出了一种带有符号k交互测度的基于优化的分类方法。实验结果表明,该方法在保留分类能力的前提下,成功地减少了计算量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Using k-Interactive Measure in Optimization-Based Data Mining
Optimization-based methods have been used for data separation in different domains and applications since 1960s. The commonality of those methods is to separate data by minimizing the overlapping between the groups and regard contribution from all the attributes toward the target of classification is the sum of every single attribute. However, the interaction among the attributes in the data is not considered at all. The theory of non-additive measures is used to describe those interactions. The consideration of the interactions is a breakthrough for dealing with the nonlinearity of data. Through the non-additive measure has been successfully utilized in optimization-based classification, it increases the computation cost as well as the quadratic programming models particularly designed for dealing with the nonlinearity. In this paper, we proposed the optimization-based classification method with the signed k-interactive measure. The experimental results shows that it successfully reduced the computation but retained the classification power.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Effective Usage of Computational Trust Models in Rational Environments Link-Based Anomaly Detection in Communication Networks Quality Information Retrieval for the World Wide Web A k-Nearest-Neighbour Method for Classifying Web Search Results with Data in Folksonomies Concept Extraction and Clustering for Topic Digital Library Construction
×
引用
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