计算机工程与科学2011，Vol.33Issue(10)：145-148,4.DOI:10.3969/j.issn.1007-130X.2011.10.026
一种改进的有向无环图支持向量机
A Improved Directed Acyclic Graphs Support Vector Machine
摘要
Abstract
Constructing reasonable directed acyclic graphs is a key problem that is to be solved urgently. An improved directed acyclic graphs support vector machine is presented, which obtains the minimal hyper-spheres according to the hyper-sphere support vector machine, computes the minimal distances among classes according to the minimal hyper-spheres, gets the minimal distance matrix according to the minimal distances, and constructs the directed acyclic graphs according to the minimal distance matrix. The experimental results show that the algorithm has a higher classification precision, compared with the old directed acyclic graphs support vector machines.关键词
有向无环图支持向量机(DAGSVM)/超球支持向量机/最短距离矩阵Key words
directed acyclic graphs support vector machine(DAGSVM)/ hyper-sphere support vector machine/minimal distance matrix分类
信息技术与安全科学引用本文复制引用
艾青,秦玉平,赵骥..一种改进的有向无环图支持向量机[J].计算机工程与科学,2011,33(10):145-148,4.基金项目
国家自然科学基金资助项目(60603023) （60603023）
辽宁省教育厅资助科研课题(2010076) （2010076）
