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.%构造合理的有向无环图是有向无环图支持向量机亟需解决的一个关键问题.本文提出一种改进的有向无环图支持向量机,根据超球支持向量机获得类的最小包围球,根据该最小包围球计算类与类之间的最短距离,根据该最短距离形成最短距离矩阵,根据该最短距离矩阵来构造有向无环图.实验结果表明,该改进算法较传统有向无环图支持向量机分类精度有明显提高.
展开▼
