Robust Transductive Support Vector Machine for Multi-View Classification

2018 ◽  
Vol 27 (12) ◽  
pp. 1850185 ◽  
Author(s):  
Yanchao Li ◽  
Yongli Wang ◽  
Junlong Zhou ◽  
Xiaohui Jiang

Semi-Supervised Learning (SSL) aims to improve the performance of models trained with a small set of labeled data and a large collection of unlabeled data. Learning multi-view representations from different perspectives of data has proved to be very effectively for improving generalization performance. However, existing semi-supervised multi-view learning methods tend to ignore the specific difficulty of different unlabeled examples, such as the outliers and noise, leading to error-prone classification. To address this problem, this paper proposes Robust Transductive Support Vector Machine (RTSVM) that introduces the margin distribution into TSVM, which is robust to the outliers and noise. Specifically, the first-order (margin mean) and second-order statistics (margin variance) are regularized into TSVM, which try to achieve strong generalization performance. Then, we impose a global similarity constraint between distinct RTSVMs each trained from one view of the data. Moreover, our algorithm runs with fast convergence by using concave–convex procedure. Finally, we validate our proposed method on a variety of multi-view datasets, and the experimental results demonstrate that our proposed algorithm is effective. By exploring large amount of unlabeled examples and being robust to the outliers and noise among different views, the generalization performance of our method show the superiority to single-view learning and other semi-supervised multi-view learning methods.

Entropy ◽  
2021 ◽  
Vol 23 (11) ◽  
pp. 1473
Author(s):  
Yan Wang ◽  
Jiali Chen ◽  
Xuping Xie ◽  
Sen Yang ◽  
Wei Pang ◽  
...  

Support vector clustering (SVC) is a boundary-based algorithm, which has several advantages over other clustering methods, including identifying clusters of arbitrary shapes and numbers. Leveraged by the high generalization ability of the large margin distribution machine (LDM) and the optimal margin distribution clustering (ODMC), we propose a new clustering method: minimum distribution for support vector clustering (MDSVC), for improving the robustness of boundary point recognition, which characterizes the optimal hypersphere by the first-order and second-order statistics and tries to minimize the mean and variance simultaneously. In addition, we further prove, theoretically, that our algorithm can obtain better generalization performance. Some instructive insights for adjusting the number of support vector points are gained. For the optimization problem of MDSVC, we propose a double coordinate descent algorithm for small and medium samples. The experimental results on both artificial and real datasets indicate that our MDSVC has a significant improvement in generalization performance compared to SVC.


Author(s):  
Rafael Torres ◽  
Hiromichi Kawanami ◽  
Tomoko Matsui ◽  
Hiroshi Saruwatari ◽  
Kiyohiro Shikano

2021 ◽  
Vol 11 (2) ◽  
pp. 332-336
Author(s):  
Lifang Peng ◽  
Kefu Chen ◽  
Bin Huang ◽  
Leyuan Zhou

As the number of breast cancer patients increases and the age of onset is younger, early detection and prevention have become the key to prevention and treatment of breast cancer. At present, many classification or clustering algorithms are used to diagnose breast cancer data. However, these algorithms directly lose the minimum source domain information, resulting in a significant improvement in the recognition rate. Based on this, this paper proposes an ensemble transfer support vector machine (ET-SVM) algorithm based on classic support vector machine (SVM). The algorithm can effectively use the knowledge in the source domain to guide the learning of the target task. The result of a single SVM is usually the local optimal solution. And its performance is unstable and its generalization performance is poor. Therefore, this article introduces an ensemble strategy based on AdaBoost algorithm. Experiments on the Wisconsin breast cancer data set proved that the proposed ET-SVM algorithm can achieve better classification results and good generalization performance.


2016 ◽  
Vol 173 ◽  
pp. 1288-1298 ◽  
Author(s):  
Xibin Wang ◽  
Junhao Wen ◽  
Shafiq Alam ◽  
Zhuo Jiang ◽  
Yingbo Wu

2021 ◽  
Author(s):  
Qifei Zhao ◽  
Xiaojun Li ◽  
Yunning Cao ◽  
Zhikun Li ◽  
Jixin Fan

Abstract Collapsibility of loess is a significant factor affecting engineering construction in loess area, and testing the collapsibility of loess is costly. In this study, A total of 4,256 loess samples are collected from the north, east, west and middle regions of Xining. 70% of the samples are used to generate training data set, and the rest are used to generate verification data set, so as to construct and validate the machine learning models. The most important six factors are selected from thirteen factors by using Grey Relational analysis and multicollinearity analysis: burial depth、water content、specific gravity of soil particles、void rate、geostatic stress and plasticity limit. In order to predict the collapsibility of loess, four machine learning methods: Support Vector Machine (SVM), Random Subspace Based Support Vector Machine (RSSVM), Random Forest (RF) and Naïve Bayes Tree (NBTree), are studied and compared. The receiver operating characteristic (ROC) curve indicators, standard error (SD) and 95% confidence interval (CI) are used to verify and compare the models in different research areas. The results show that: RF model is the most efficient in predicting the collapsibility of loess in Xining, and its AUC average is above 80%, which can be used in engineering practice.


Sign in / Sign up

Export Citation Format

Share Document