Transductive support vector machine optimization problem is a NP problem, in the case of larger number of labeled samples, it is often difficult to obtain a global optimal solution, thereby the good generalization abi...Transductive support vector machine optimization problem is a NP problem, in the case of larger number of labeled samples, it is often difficult to obtain a global optimal solution, thereby the good generalization ability of transductive learning has been affected. Previous methods can not give consideration to both running efficiency and classification precision. In this paper, a transductive support vector machine algorithm based on ant colony optimization is proposed to overcome the drawbacks of the previous methods. The proposed algorithm approaches the approximate optimal solution of Transductive support vector machine optimization problem by ant colony optimization algorithm, and the advantage of transductive learning can be fully demonstrated. Experiments on several UCI standard datasets and the newsgroups 20 dataset showed that, with respect to running time and classification precision, the proposed algorithm has obvious advantage over the previous algorithms.展开更多
In many machine learning problems, a large amount of data is available but only a few of them can be labeled easily. This provides a research branch to effectively combine unlabeled and labeled data to infer the label...In many machine learning problems, a large amount of data is available but only a few of them can be labeled easily. This provides a research branch to effectively combine unlabeled and labeled data to infer the labels of unlabeled ones, that is, to develop transductive learning. In this article, based on Pattern classification via single sphere （SSPC）, which seeks a hypersphere to separate data with the maximum separation ratio, a progressive transductive pattern classification method via single sphere （PTSSPC） is proposed to construct the classifier using both the labeled and unlabeled data. PTSSPC utilize the additional information of the unlabeled samples and obtain better classification performance than SSPC when insufficient labeled data information is available. Experiment results show the algorithm can yields better performance.展开更多
针对识别加密P2P网络流量比较困难的问题,提出一种基于K均值和直推式支持向量机(TSVM)的半监督学习模型———两阶段策略模型(KTSVM,k-means based transductive supportvector machine),以提高P2P流量的识别精度.该模型首先使用K均值...针对识别加密P2P网络流量比较困难的问题,提出一种基于K均值和直推式支持向量机(TSVM)的半监督学习模型———两阶段策略模型(KTSVM,k-means based transductive supportvector machine),以提高P2P流量的识别精度.该模型首先使用K均值半监督聚类算法计算训练集中正例样本的数目,然后根据正例样本的数目来训练TSVM分类模型,提高了TSVM模型的稳定性和准确性.该模型的优势是可以使用未标注样本和标注样本共同训练分类模型,非常适合于识别标注比较困难的P2P流量.实验结果表明,在标注样本较少的情况下,该模型的识别精度和稳定性均优于TSVM模型和SVM模型.展开更多
基金This work is sponsored by the National Natural Science Foundation of China (Nos. 61402246, 61402126, 61370083, 61370086, 61303193, and 61572268), a Project of Shandong Province Higher Educational Science and Technology Program (No. J15LN38,J14LN31), Qingdao indigenous innovation program (No. 15-9-1-47-jch), the Project of Shandong Provincial Natural Science Foundation of China (No. ZR2014FL019), the Open Project of Collaborative Innovation Center of Green Tyres & Rubber (No. 2014GTR0020), the National Research Foundation for the Doctoral Program of Higher Education of China (No.20122304110012), the Science and Technology Research Project Foundation of Heilongjiang Province Education Department (No. 12531105), Heilongjiang Province Postdoctoral Research Start Foundation (No. LBH-Q13092), and the National Key Technology R&D Program of the Ministry of Science and Technology under Grant No. 2012BAH81F02.
文摘Transductive support vector machine optimization problem is a NP problem, in the case of larger number of labeled samples, it is often difficult to obtain a global optimal solution, thereby the good generalization ability of transductive learning has been affected. Previous methods can not give consideration to both running efficiency and classification precision. In this paper, a transductive support vector machine algorithm based on ant colony optimization is proposed to overcome the drawbacks of the previous methods. The proposed algorithm approaches the approximate optimal solution of Transductive support vector machine optimization problem by ant colony optimization algorithm, and the advantage of transductive learning can be fully demonstrated. Experiments on several UCI standard datasets and the newsgroups 20 dataset showed that, with respect to running time and classification precision, the proposed algorithm has obvious advantage over the previous algorithms.
基金supported by the National Natural Science of China(6057407560705004).
文摘In many machine learning problems, a large amount of data is available but only a few of them can be labeled easily. This provides a research branch to effectively combine unlabeled and labeled data to infer the labels of unlabeled ones, that is, to develop transductive learning. In this article, based on Pattern classification via single sphere （SSPC）, which seeks a hypersphere to separate data with the maximum separation ratio, a progressive transductive pattern classification method via single sphere （PTSSPC） is proposed to construct the classifier using both the labeled and unlabeled data. PTSSPC utilize the additional information of the unlabeled samples and obtain better classification performance than SSPC when insufficient labeled data information is available. Experiment results show the algorithm can yields better performance.
文摘针对识别加密P2P网络流量比较困难的问题,提出一种基于K均值和直推式支持向量机(TSVM)的半监督学习模型———两阶段策略模型(KTSVM,k-means based transductive supportvector machine),以提高P2P流量的识别精度.该模型首先使用K均值半监督聚类算法计算训练集中正例样本的数目,然后根据正例样本的数目来训练TSVM分类模型,提高了TSVM模型的稳定性和准确性.该模型的优势是可以使用未标注样本和标注样本共同训练分类模型,非常适合于识别标注比较困难的P2P流量.实验结果表明,在标注样本较少的情况下,该模型的识别精度和稳定性均优于TSVM模型和SVM模型.
