期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Entire Solution Path for Support Vector Machine for Positive and Unlabeled Classification
1
作者 姚利敏 唐杰 李涓子 《Tsinghua Science and Technology》 SCIE EI CAS 2009年第2期242-251,共10页
Support vector machines (SVMs) aim to find an optimal separating hyper-plane that maximizes separation between two classes of training examples (more precisely, maximizes the margin between the two classes of examp... Support vector machines (SVMs) aim to find an optimal separating hyper-plane that maximizes separation between two classes of training examples (more precisely, maximizes the margin between the two classes of examples). The choice of the cost parameter for training the SVM model is always a critical issue. This analysis studies how the cost parameter determines the hyper-plane; especially for classifications using only positive data and unlabeled data. An algorithm is given for the entire solution path by choosing the 'best' cost parameter while training the SVM model. The performance of the algorithm is compared with conventional implementations that use default values as the cost parameter on two synthetic data sets and two real-world data sets. The results show that the algorithm achieves better results when dealing with positive data and unlabeled classification. 展开更多
关键词 support vector machine cost parameter positive and unlabeled classification
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部