Computer Science ›› 2009, Vol. 36 ›› Issue (7): 179-181.doi: 10.11896/j.issn.1002-137X.2009.07.042
Previous Articles Next Articles
LIU Ye-qing,LIU San-yang,GU Ming-tao
Online:
Published:
Abstract: In order to solve the nonconvex and nonsmooth problem of semi-supervised support vector classification, a polynomial smooth function was introduced in this paper which was used to approach the nonconvex objective function.The introduced polynomial function has a high approximation accuracy in high density regions of samples and poor approximation performance appear in low density regions of samples. The model was solved by the method of conjugate gradient. Experimental results on artificial and real data support that the proposed algorithm can guarantee the accuracy when the percentage of labeled sample is very low and the accuracy is not improved obviously as the number of labeled data increasing. The performance of the proposed classifier is stable.
Key words: Semi supervised learning, Support vector machine(SVM) , Classification
LIU Ye-qing,LIU San-yang,GU Ming-tao. Polynomial Smooth Classification Algorithm of Semi-supervised Support Vector Machines[J].Computer Science, 2009, 36(7): 179-181.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/10.11896/j.issn.1002-137X.2009.07.042
https://www.jsjkx.com/EN/Y2009/V36/I7/179
Cited