SVM and SVM Ensembles in Breast Cancer Prediction

ASIAIR > College of Computer Science > Department of Computer Science and Information Engineering > Journal Artical > Item 310904400/108635

Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/108635

Title:	SVM and SVM Ensembles in Breast Cancer Prediction
Authors:	Min-Wei,Huan;Min-Wei,Huang;Chih-Wen,Che;Chih-Wen,Chen;林維昭;Wei-Chao,Lin;Shih-Wen,Ke;Shih-Wen,Ke;Chih-Fong,Ts;Chih-Fong,Tsai
Contributors:	資訊工程學系
Date:	2017-01
Issue Date:	2017-12-08 06:49:00 (UTC+0)
Abstract:	Breast cancer is an all too common disease in women, making how to effectively predict it an active research problem. A number of statistical and machine learning techniques have been employed to develop various breast cancer prediction models. Among them, support vector machines (SVM) have been shown to outperform many related techniques. To construct the SVM classifier, it is first necessary to decide the kernel function, and different kernel functions can result in different prediction performance. However, there have been very few studies focused on examining the prediction performances of SVM based on different kernel functions. Moreover, it is unknown whether SVM classifier ensembles which have been proposed to improve the performance of single classifiers can outperform single SVM classifiers in terms of breast cancer prediction. Therefore, the aim of this paper is to fully assess the prediction performance of SVM and SVM ensembles over small and large scale breast cancer datasets. The classification accuracy, ROC, F-measure, and computational times of training SVM and SVM ensembles are compared. The experimental results show that linear kernel based SVM ensembles based on the bagging method and RBF kernel based SVM ensembles with the boosting method can be the better choices for a small scale dataset, where feature selection should be performed in the data pre-processing stage. For a large scale dataset, RBF kernel based SVM ensembles based on boosting perform better than the other classifiers.
Relation:	PLoS One.
Appears in Collections:	[Department of Computer Science and Information Engineering] Journal Artical

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	444	View/Open

Loading...