徐冉冉, 琚昊霖, 李朝锋. 非平衡二叉树主动学习支持向量机[J]. 微电子学与计算机, 2013, 30(5): 55-58.
引用本文: 徐冉冉, 琚昊霖, 李朝锋. 非平衡二叉树主动学习支持向量机[J]. 微电子学与计算机, 2013, 30(5): 55-58.
XU Ran-ran, JU Hao-lin, LI Chao-feng. Non-balanced Binary Tree with Active Learning Support Vector Machine[J]. Microelectronics & Computer, 2013, 30(5): 55-58.
Citation: XU Ran-ran, JU Hao-lin, LI Chao-feng. Non-balanced Binary Tree with Active Learning Support Vector Machine[J]. Microelectronics & Computer, 2013, 30(5): 55-58.

非平衡二叉树主动学习支持向量机

Non-balanced Binary Tree with Active Learning Support Vector Machine

  • 摘要: 针对传统的二分类支持向量机在数据种类繁多并含有很多不带标签的样本时的固有缺陷,提出了一种主动学习与非平衡二叉树结合的多类分类支持向量机.该方法首先通过类距离构造一个非平衡二叉树结构,从易到难依次构造节点,将最容易分出的类放在根节点,然后利用主动学习策略,自动为选择的样本添加标签,并添加到训练样本集中.实验结果表明本文提出算法性能优于常规主动学习支持向量机,有效提高了分类精度,且大大缩短了算法运行时间.

     

    Abstract: In order to solve the inherent defects of traditional two—class classification support vector machine when the types of data is variety and many samples is without being labeled,an algorithm was proposed through a combination of active learning and non—balanced binary tree multi—class classification support vector machine. First,a non—balanced binary tree structure is constructed through the class distance,from easy to difficult in turn construct node,put most likely to separate the class on the root node,then,using active learning strategies the corresponding labels will be added for the selected samples,and automatically the labeled samples will be append to the training sample set.The experimental results show that the performance of the proposed algorithm is superior to the ordinary active learning support vector machine algorithm,by improving the classification accuracy,and greatly reducing running time of the algorithm.

     

/

返回文章
返回