最大边际最小方差双支持向量机

Sweta Sharma, R. Rastogi
{"title":"最大边际最小方差双支持向量机","authors":"Sweta Sharma, R. Rastogi","doi":"10.1109/SSCI.2018.8628859","DOIUrl":null,"url":null,"abstract":"Traditional Support Vector Machine (SVM) based algorithms seek to distinguish two classes by maximizing the margin between two classes without taking into consideration their class distribution information. However, in many practical cases, the distribution of classes plays a crucial role which traditional SVM based classifiers completely ignores. In this paper, we propose a Twin Support Vector Machine based learning model which combines the advantages of generative and discriminative classifiers to learn a robust discriminative model that efficiently considers class-distribution information as well. The resulting classifier has been termed as Maximum Margin Minimum Variance Twin Support Vector Machine $(M^{3}-$ TWSVM). Experimental comparisons of our proposed approach on well-known machine learning benchmark datasets along with real world activity recognition dataset have been carried out. Computational results show that our method is not only fast and yields comparable generalization performance as well.","PeriodicalId":235735,"journal":{"name":"2018 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Maximum Margin Minimum Variance Twin Support Vector Machine\",\"authors\":\"Sweta Sharma, R. Rastogi\",\"doi\":\"10.1109/SSCI.2018.8628859\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traditional Support Vector Machine (SVM) based algorithms seek to distinguish two classes by maximizing the margin between two classes without taking into consideration their class distribution information. However, in many practical cases, the distribution of classes plays a crucial role which traditional SVM based classifiers completely ignores. In this paper, we propose a Twin Support Vector Machine based learning model which combines the advantages of generative and discriminative classifiers to learn a robust discriminative model that efficiently considers class-distribution information as well. The resulting classifier has been termed as Maximum Margin Minimum Variance Twin Support Vector Machine $(M^{3}-$ TWSVM). Experimental comparisons of our proposed approach on well-known machine learning benchmark datasets along with real world activity recognition dataset have been carried out. Computational results show that our method is not only fast and yields comparable generalization performance as well.\",\"PeriodicalId\":235735,\"journal\":{\"name\":\"2018 IEEE Symposium Series on Computational Intelligence (SSCI)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Symposium Series on Computational Intelligence (SSCI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSCI.2018.8628859\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Symposium Series on Computational Intelligence (SSCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSCI.2018.8628859","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

传统的基于支持向量机(SVM)的算法寻求通过最大化两类之间的余量来区分两类,而不考虑它们的类分布信息。然而,在许多实际情况下,类的分布起着至关重要的作用,而传统的基于SVM的分类器完全忽略了这一点。本文提出了一种基于双支持向量机的学习模型,该模型结合了生成分类器和判别分类器的优点,学习了一个鲁棒的判别模型,并且有效地考虑了类别分布信息。得到的分类器被称为最大边际最小方差双支持向量机$(M^{3}-$ TWSVM)。我们提出的方法在知名的机器学习基准数据集和现实世界的活动识别数据集上进行了实验比较。计算结果表明,该方法不仅速度快,而且具有相当的泛化性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Maximum Margin Minimum Variance Twin Support Vector Machine
Traditional Support Vector Machine (SVM) based algorithms seek to distinguish two classes by maximizing the margin between two classes without taking into consideration their class distribution information. However, in many practical cases, the distribution of classes plays a crucial role which traditional SVM based classifiers completely ignores. In this paper, we propose a Twin Support Vector Machine based learning model which combines the advantages of generative and discriminative classifiers to learn a robust discriminative model that efficiently considers class-distribution information as well. The resulting classifier has been termed as Maximum Margin Minimum Variance Twin Support Vector Machine $(M^{3}-$ TWSVM). Experimental comparisons of our proposed approach on well-known machine learning benchmark datasets along with real world activity recognition dataset have been carried out. Computational results show that our method is not only fast and yields comparable generalization performance as well.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信