Cluster Based Training for Scaling Non-linear Support Vector Machines

S. Asharaf, M. Murty, S. Shevade
{"title":"Cluster Based Training for Scaling Non-linear Support Vector Machines","authors":"S. Asharaf, M. Murty, S. Shevade","doi":"10.1109/ICCTA.2007.39","DOIUrl":null,"url":null,"abstract":"Support vector machines (SVMs) are hyperplane classifiers defined in a kernel induced feature space. The data size dependent training time complexity of SVMs usually prohibits its use in applications involving more than a few thousands of data points. In this paper, we propose a novel kernel based incremental data clustering approach and its use for scaling non-linear support vector machines to handle large data sets. The clustering method introduced can find cluster abstractions of the training data in a kernel induced feature space. These cluster abstractions are then used for selective sampling based training of support vector machines to reduce the training time without compromising the generalization performance. Experiments done with real world datasets show that this approach gives good generalization performance at reasonable computational expense","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCTA.2007.39","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Support vector machines (SVMs) are hyperplane classifiers defined in a kernel induced feature space. The data size dependent training time complexity of SVMs usually prohibits its use in applications involving more than a few thousands of data points. In this paper, we propose a novel kernel based incremental data clustering approach and its use for scaling non-linear support vector machines to handle large data sets. The clustering method introduced can find cluster abstractions of the training data in a kernel induced feature space. These cluster abstractions are then used for selective sampling based training of support vector machines to reduce the training time without compromising the generalization performance. Experiments done with real world datasets show that this approach gives good generalization performance at reasonable computational expense
基于聚类的缩放非线性支持向量机训练
支持向量机(svm)是在核诱导特征空间中定义的超平面分类器。支持向量机的数据大小依赖于训练时间复杂度,通常禁止在涉及数千个数据点以上的应用中使用支持向量机。在本文中,我们提出了一种新的基于核的增量数据聚类方法,并将其用于缩放非线性支持向量机来处理大型数据集。引入的聚类方法可以在核诱导特征空间中找到训练数据的聚类抽象。然后将这些聚类抽象用于基于选择性采样的支持向量机训练,在不影响泛化性能的情况下减少训练时间。用真实数据集进行的实验表明,该方法在合理的计算开销下具有良好的泛化性能
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信