支持向量分类的核演化

Mehrdad Alizadeh, M. Ebadzadeh
{"title":"支持向量分类的核演化","authors":"Mehrdad Alizadeh, M. Ebadzadeh","doi":"10.1109/EAIS.2011.5945924","DOIUrl":null,"url":null,"abstract":"Support vector machines (SVMs) have been used in a variety of classification tasks. SVMs undoubtedly are one of the most effective classifiers in several data mining applications. Determination of a kernel function and related parameters has been a bottleneck for this group of classifiers. In this paper a novel approach is proposed to use genetic programming (GP) to design domain-specific and optimal kernel functions for support vector classification (SVC) which automatically adjusts the parameters. Complex low dimensional mapping function is evolved using GP to construct an optimal linear and Gaussian kernel functions in new feature space. By using the principled kernel closure properties, these basic kernels are then used to evolve more optimal kernels. To evaluate the proposed method, benchmark datasets from UCI are applied. The result indicates that for some cases the proposed methods can find a more optimal solution than evolving known kernels.","PeriodicalId":243348,"journal":{"name":"2011 IEEE Workshop on Evolving and Adaptive Intelligent Systems (EAIS)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Kernel evolution for support vector classification\",\"authors\":\"Mehrdad Alizadeh, M. Ebadzadeh\",\"doi\":\"10.1109/EAIS.2011.5945924\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Support vector machines (SVMs) have been used in a variety of classification tasks. SVMs undoubtedly are one of the most effective classifiers in several data mining applications. Determination of a kernel function and related parameters has been a bottleneck for this group of classifiers. In this paper a novel approach is proposed to use genetic programming (GP) to design domain-specific and optimal kernel functions for support vector classification (SVC) which automatically adjusts the parameters. Complex low dimensional mapping function is evolved using GP to construct an optimal linear and Gaussian kernel functions in new feature space. By using the principled kernel closure properties, these basic kernels are then used to evolve more optimal kernels. To evaluate the proposed method, benchmark datasets from UCI are applied. The result indicates that for some cases the proposed methods can find a more optimal solution than evolving known kernels.\",\"PeriodicalId\":243348,\"journal\":{\"name\":\"2011 IEEE Workshop on Evolving and Adaptive Intelligent Systems (EAIS)\",\"volume\":\"80 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE Workshop on Evolving and Adaptive Intelligent Systems (EAIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EAIS.2011.5945924\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Workshop on Evolving and Adaptive Intelligent Systems (EAIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EAIS.2011.5945924","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

支持向量机(svm)已被用于各种分类任务中。支持向量机无疑是许多数据挖掘应用中最有效的分类器之一。核函数和相关参数的确定一直是这组分类器的瓶颈。提出了一种基于遗传规划的支持向量分类(SVC)核函数自动调整的方法。利用GP在新的特征空间中构造最优的线性核函数和高斯核函数来演化复杂的低维映射函数。通过使用有原则的内核闭包属性,这些基本内核可以用来演化出更优的内核。为了评估所提出的方法,应用了来自UCI的基准数据集。结果表明,在某些情况下,所提出的方法可以找到比进化已知核更优的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Kernel evolution for support vector classification
Support vector machines (SVMs) have been used in a variety of classification tasks. SVMs undoubtedly are one of the most effective classifiers in several data mining applications. Determination of a kernel function and related parameters has been a bottleneck for this group of classifiers. In this paper a novel approach is proposed to use genetic programming (GP) to design domain-specific and optimal kernel functions for support vector classification (SVC) which automatically adjusts the parameters. Complex low dimensional mapping function is evolved using GP to construct an optimal linear and Gaussian kernel functions in new feature space. By using the principled kernel closure properties, these basic kernels are then used to evolve more optimal kernels. To evaluate the proposed method, benchmark datasets from UCI are applied. The result indicates that for some cases the proposed methods can find a more optimal solution than evolving known kernels.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信