Indexed by:
Abstract:
Semi-supervised learning has received many attention during the few past years in the machine learning community. But they all treat the two errors equally. Since in many important applications, however, some kinds of errors are more important than others. In this paper, we use cost-sensitive 2v - SVM to solve the semi-supervised binary classification. We convert the problem of Semi-Supervised binary classification into a feasible Semi-definite programming.
Keyword:
Reprint Author's Address:
Source :
2012 THIRD INTERNATIONAL CONFERENCE ON THEORETICAL AND MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE (ICTMF 2012)
ISSN: 2070-1918
Year: 2013
Volume: 38
Page: 238-244
Language: English
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 8
Affiliated Colleges: