000			04329nam a2200253 a 4500
001			vtls000059641
003			KUKTEM
005			20251114204451.0
008			120503t2011 my a f m 000 0 eng d
020			_aTHE0001689(Local)
039		9	_a201905131155 _byusri _y201205031432 _zida
040			_aUMP
090			_aQ325.5 .S26 2011 rs Thesis
100	0		_aSanti Wulan Purnami
245	1	0	_aEnhancement of new smooth support vector machines for classification problems / _cSanti Wulan Purnami
260			_aKuantan, Pahang : _bUMP, _c2011
300			_axxi, 198 p. : _bill. (some col.) ; _c30 cm. + _e1 CD-ROM
502			_aThesis (Doctor of Philosophy in Computer Science) -- Universiti Malaysia Pahang - 2011
504			_aBibliography: p. 125-132
520	3		_aResearch on Smooth Support Vector Machine (SSVM) for classification problem is an active field in data mining. SSVM is reformulation of standard Support Vector Machines (SVM). In SSVM, smoothing technique must be applied to convert constraint optimization to the unconstraint optimization problem since the objective function of this unconstraint optimization is not twice differentiable. The smooth function is used to replace the plus function to obtain a smooth support vector machine (SSVM). To get more accuracy performance, Multiple Knot Spline SSVM (MKS-SSVM) is proposed. MKS-SSVM is a new SSVM which used multiple knot spline function to approximate the plus function instead the integral sigmoid function in SSVM. To obtain optimal accuracy results, Uniform Design method is used to select parameter. The performance of the method is evaluated using 10-fold cross validation accuracy, confusion matrix, sensitivity and specificity. To evaluate the effectiveness of our method, an experiment is carried out on four medical dataset, i.e. Pima Indian diabetes dataset, heart disease, breast cancer prognosis, and breast cancer diagnosis. The results of this study showed that MKS-SSVM was effective to diagnose medical dataset and this is promising results compared to the previously reported results. SSVM algorithms are developed for binary classification. However, in many real problems data points are discriminated into multiple categories. Hence, MKS-SSVM is extended for multiclass classification. Two popular multiclass classification methods One against All (OAA) and One against One (OAO)) were used to extend MKS-SSVM. Numerical experiments show that the classification accuracy of OAA and OAO method are competitive with each other and there is no clear superiority of one method over another. While the computation time, the OAO method is lower than the OAA method on three dataset. This indicated that the OAO method is usually more efficient than the OAA. In the final part, the reduced support vector machine (RSVM) was proposed to solve computational difficulties of SSVM in large dataset. To generate representative reduce set for RSVM, clustering reduced support vector machine (CRSVM) had been proposed. However, CRSVM is restricted to solve classification problems for large dataset with numeric attributes. In this research, an alternative algorithm, k-mode RSVM (KMo-RSVM) that combines RSVM and k-mode clustering technique to handle classification problems on categorical large dataset and k-prototype RSVM (KPro-RSVM) which combine k-prototype and RSVM to classify large dataset with mixed attributes were proposed. In our experiments, the effectiveness of KMo-RSVM is tested on four public available dataset. It turns out that KMo-RSVM can improve speed of running time significantly than SSVM and still obtained a high accuracy. Comparison with RSVM indicates that KMo-RSVM is faster, gets smaller reduced set and comparable testing accuracy than RSVM. From experiments on three public dataset also show that KPro- RSVM can tremendously reduces the computational time and can handling classification for large mixed dataset, when the SSVM method ran out of memory (in case: census dataset). The comparison with RSVM indicate that the computational time of KPro RSVM less than RSVM method, and obtained testing accuracy of KPro-RSVM a little decrease than RSVM.
650		0	_aSupport vector machines
650		0	_aData mining
999			_aVIRTUA40 _c2546 _d2552
999			_aVTLSSORT0080*0200*0400*0900*1000*2450*2600*3000*5020*5040*5200*6500*6501*9992