{"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}
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 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.