为了提高潜在支持向量机求解大规模问题的训练速度,提出了基于样本取样的潜在支持向量机序列最小优化算法,去掉了大部分非支持向量,把支持向量逐渐压缩到取样样本集中.此算法特别适合大样本数据且支持向量个数相对较少的情况.实验表明,改进的序列最小优化算法加速了潜在支持向量机分类器训练时间.
[1] 周水庚, 范晔, 周傲英, ZHOU Shui-geng, FAN Ye, ZHOU Ao-ying. 基于数据取样的DBSCAN算法 [J]. 小型微型计算机系统 2000.doi:10.3969/j.issn.1000-1220.2000.12.012
[2] Sepp Hochreiter, Klaus Obermayer. Support Vector Machines for Dyadic Data [J]. Neural computation 2006, 6(6).
[3] BRODER A Z, GLASSMAN S C, MANASSE M S. Syntactic clustering of the web [J]. Computer Networks and ISDN Systems 1997, 29(8-13).
[4] OSUNA E, FREUND R, GIROSI F. An improved training algorithm for support vector machines [J]. IEEE Neural Networks for Signal Processing Ⅶ-Proceedings 1997.
[5] JOACHIMS T. Making large-scale SVM learning practical [A]. Cambridge, ma:the Mit Press 1998.
[6] PLATT J. Fast training of support vector machines using sequential minimal optimization [A]. Cambridge, ma:the Mit Press 1999.
[7] Knebel T, Hochreiter S, Obermayer K. An SMO algorithm for the potential support vector machine [J]. Neural computation 2008, 1(1).
[8] Ming-Syan Chen, Jiawei Han. Data mining: an overview from a database perspective [J]. IEEE Transactions on Knowledge and Data Engineering 1996, 6(6).
[9] CHANG CHIH CHUNG, LIN CHIH JEN. LIBSVM a library for support vector machines [EB/OL]. http://www.csie.ntu.edu.tw/～cjlin/papers/libsvm, pdf 2010.
