适于P2P网络流量识别的SVM快速增量学习方法
毕孝儒
【期刊名称】《现代计算机（专业版）》 【年(卷),期】2014(000)010
【摘要】In P2P network traffic identification, aims to such the problems that SVM does not support incremental learning. Proposes a fast incremen-tal learning method of SVM for P2P network traffic identification. After clustering of positive and negative training samples that violate Karush-Kuhn-Tucker conditions, a temporary classification hyperplane close to classification hyperplane of incremental learning is ob-tained by using clustering centers to train standard SVM. Based on it, transfers support-vector and non-support-vector in original training samples to produce new training samples for incremental learning of SVM. Analysis and simulation shows that the method effectively sim-plifies training samples of incremental learning and greatly reduces the training and traffic identification time of SVM in incremental learning.%针对标准支持向量机在P2P网络流量识别中不支持增量学习的问题，提出一种适于P2P网络流量识别的SVM快速增量学习方法。在对违背Karush-Kuhn-Tucker条件的新增正负样本集分别进行聚类分析基础上，运用聚类簇中心对支持向量机训练生成一个接近增量学习最优分类超平面的过渡超平面，并以此超平面为基准确定初始训练样本集上非支持向量和支持向量的互相转化，进而生成新的样本集实现SVM增量学习。理论分析和实验结果表明，该方法能有效
适于P2P网络流量识别的SVM快速增量学习方法
