检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]太原理工大学计算机与软件学院,山西太原030024
出 处:《计算机工程与设计》2009年第19期4497-4499,4527,共4页Computer Engineering and Design
基 金:国家自然科学基金项目(60773004);山西省自然科学基金项目(2007011050)
摘 要:传统的基于聚类的SVM多类分类方法在聚类时并不考虑样本的类别信息,最终形成的二叉树分支一般很多,当异类样本特征相近时该方法性能下降明显。针对这一问题,将线性判别分析法引入二叉树建树过程中,每次在对待训练样本集聚类之前先进行优化处理,通过寻找最佳投影子空间使得同类样本聚集、异类样本松散,从而优化二叉树结构,以此改进分类效果,并在UCI数据集上进行实验,结果表明该方法减少了二叉树分支,提高了分类的准确率。Because the information of class-labels is not considered by the traditional multi-class SVM based on clustering, too much branches of the binary-tree are formed, especially in the case of samples in different classes having similar features. To solve the problem, linear discriminant analysis is introduced to binary-tree, the pretreatment that training samples before clustering is done to find optimal feature space in which the samples in the same classes will be gathered together, while the samples in different classes will be loosed, so binary-tree is optimized and the implementation of the algorithm is improved. The experiment is carried out on the UCI data sets. The results show that this method reduces the branches of binary-tree and improves the accuracy of the algorithm.
关 键 词:支持向量机 多类分类 二叉树 模糊C均值聚类 线性判别分析
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30