基于中心核排列的新型模糊孪生支持向量机

IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Jialiang Xie, Jianxiang Qiu, Dongxiao Zhang, Ruping Zhang
{"title":"基于中心核排列的新型模糊孪生支持向量机","authors":"Jialiang Xie, Jianxiang Qiu, Dongxiao Zhang, Ruping Zhang","doi":"10.1007/s00500-024-09917-3","DOIUrl":null,"url":null,"abstract":"<p>Twin Support Vector Machine (TSVM) transforms a single large quadratic programming problem (QPP) in support vector machine (SVM) into two smaller QPPs by finding two non-parallel classification hyperplanes, so that its computational time is reduced to a quarter of what the traditional SVM takes. However, TSVM ignores the data distribution of class, which makes TSVM sensitive to noise. In this paper, a fuzzy twin support vector machine based on centered kernel alignment (FTSVM-CKA) is proposed to solve the problem that TSVM is sensitive to noise. Firstly, a feature-weighted kernel function is constructed by using the information gain, and it is applied to the calculation of the centered kernel alignment (CKA). This assigns greater weight to strongly correlated features, emphasizing their classification importance over weakly correlated features. Secondly, the CKA method is utilized to derive a heuristic function for calculating the dependency between samples and their corresponding labels, which assigns fuzzy membership to different samples. Based on this, a fuzzy membership assignment strategy is proposed that can effectively address the sensitivity of TSVM to noise. Thirdly, this strategy is combined with TSVM to propose the FTSVM-CKA model. Moreover, this study employs a coordinate descent strategy with shrinking by active set to tackle the computational complexity arising from high-dimensional inputs. This can effectively accelerate the training speed of the model while ensuring classification performance. In order to evaluate the performance of FTSVM-CKA, this study conducts experiments designed on artificial and UCI datasets. The results demonstrate that FTSVM-CKA can efficiently and quickly solve binary classification problems with noise.</p>","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"59 1","pages":""},"PeriodicalIF":3.1000,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A novel fuzzy twin support vector machine based on centered kernel alignment\",\"authors\":\"Jialiang Xie, Jianxiang Qiu, Dongxiao Zhang, Ruping Zhang\",\"doi\":\"10.1007/s00500-024-09917-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Twin Support Vector Machine (TSVM) transforms a single large quadratic programming problem (QPP) in support vector machine (SVM) into two smaller QPPs by finding two non-parallel classification hyperplanes, so that its computational time is reduced to a quarter of what the traditional SVM takes. However, TSVM ignores the data distribution of class, which makes TSVM sensitive to noise. In this paper, a fuzzy twin support vector machine based on centered kernel alignment (FTSVM-CKA) is proposed to solve the problem that TSVM is sensitive to noise. Firstly, a feature-weighted kernel function is constructed by using the information gain, and it is applied to the calculation of the centered kernel alignment (CKA). This assigns greater weight to strongly correlated features, emphasizing their classification importance over weakly correlated features. Secondly, the CKA method is utilized to derive a heuristic function for calculating the dependency between samples and their corresponding labels, which assigns fuzzy membership to different samples. Based on this, a fuzzy membership assignment strategy is proposed that can effectively address the sensitivity of TSVM to noise. Thirdly, this strategy is combined with TSVM to propose the FTSVM-CKA model. Moreover, this study employs a coordinate descent strategy with shrinking by active set to tackle the computational complexity arising from high-dimensional inputs. This can effectively accelerate the training speed of the model while ensuring classification performance. In order to evaluate the performance of FTSVM-CKA, this study conducts experiments designed on artificial and UCI datasets. The results demonstrate that FTSVM-CKA can efficiently and quickly solve binary classification problems with noise.</p>\",\"PeriodicalId\":22039,\"journal\":{\"name\":\"Soft Computing\",\"volume\":\"59 1\",\"pages\":\"\"},\"PeriodicalIF\":3.1000,\"publicationDate\":\"2024-07-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Soft Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s00500-024-09917-3\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00500-024-09917-3","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

双支持向量机(TSVM)通过寻找两个不平行的分类超平面,将支持向量机(SVM)中的一个大型二次编程问题(QPP)转化为两个较小的QPP,从而使其计算时间减少到传统SVM的四分之一。但是,TSVM 忽略了类的数据分布,这使得 TSVM 对噪声很敏感。本文提出了一种基于中心核排列的模糊孪生支持向量机(FTSVM-CKA),以解决 TSVM 对噪声敏感的问题。首先,利用信息增益构建特征加权核函数,并将其应用于居中核配准(CKA)的计算。这就为强相关特征赋予了更大的权重,强调了它们相对于弱相关特征的分类重要性。其次,利用 CKA 方法推导出一个启发式函数,用于计算样本与其相应标签之间的依赖关系,从而为不同样本分配模糊成员权。在此基础上,提出了一种模糊成员分配策略,可有效解决 TSVM 对噪声的敏感性问题。第三,将该策略与 TSVM 结合,提出了 FTSVM-CKA 模型。此外,本研究还采用了坐标下降策略和主动集收缩策略,以解决高维输入带来的计算复杂性问题。这可以有效加快模型的训练速度,同时确保分类性能。为了评估 FTSVM-CKA 的性能,本研究在人工数据集和 UCI 数据集上进行了实验。结果表明,FTSVM-CKA 可以高效、快速地解决有噪声的二元分类问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

A novel fuzzy twin support vector machine based on centered kernel alignment

A novel fuzzy twin support vector machine based on centered kernel alignment

Twin Support Vector Machine (TSVM) transforms a single large quadratic programming problem (QPP) in support vector machine (SVM) into two smaller QPPs by finding two non-parallel classification hyperplanes, so that its computational time is reduced to a quarter of what the traditional SVM takes. However, TSVM ignores the data distribution of class, which makes TSVM sensitive to noise. In this paper, a fuzzy twin support vector machine based on centered kernel alignment (FTSVM-CKA) is proposed to solve the problem that TSVM is sensitive to noise. Firstly, a feature-weighted kernel function is constructed by using the information gain, and it is applied to the calculation of the centered kernel alignment (CKA). This assigns greater weight to strongly correlated features, emphasizing their classification importance over weakly correlated features. Secondly, the CKA method is utilized to derive a heuristic function for calculating the dependency between samples and their corresponding labels, which assigns fuzzy membership to different samples. Based on this, a fuzzy membership assignment strategy is proposed that can effectively address the sensitivity of TSVM to noise. Thirdly, this strategy is combined with TSVM to propose the FTSVM-CKA model. Moreover, this study employs a coordinate descent strategy with shrinking by active set to tackle the computational complexity arising from high-dimensional inputs. This can effectively accelerate the training speed of the model while ensuring classification performance. In order to evaluate the performance of FTSVM-CKA, this study conducts experiments designed on artificial and UCI datasets. The results demonstrate that FTSVM-CKA can efficiently and quickly solve binary classification problems with noise.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Soft Computing
Soft Computing 工程技术-计算机:跨学科应用
CiteScore
8.10
自引率
9.80%
发文量
927
审稿时长
7.3 months
期刊介绍: Soft Computing is dedicated to system solutions based on soft computing techniques. It provides rapid dissemination of important results in soft computing technologies, a fusion of research in evolutionary algorithms and genetic programming, neural science and neural net systems, fuzzy set theory and fuzzy systems, and chaos theory and chaotic systems. Soft Computing encourages the integration of soft computing techniques and tools into both everyday and advanced applications. By linking the ideas and techniques of soft computing with other disciplines, the journal serves as a unifying platform that fosters comparisons, extensions, and new applications. As a result, the journal is an international forum for all scientists and engineers engaged in research and development in this fast growing field.
×
引用
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学术官方微信