arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.02161cs.LGcs.ITmath.IT
收藏

包围分类的最优N元ECOC矩阵

Optimal N-ary ECOC Matrices for Ensemble Classification

Rowan University(罗文大学)

Hieu D. Nguyen, Lucas J. Lavalva, Shen-Shyang Ho, Mohammed Sarosh Khan, Nicholas Kaegi

摘要:

提出了一种新的用于集成分类方法的$N$-元纠错输出码(ECOC)矩阵的递归构造方法,推广了经典的二元Hadamard矩阵的加倍构造方法.给定任何素数$N$,该确定性构造生成素数幂维的基$N$对称方阵$M$,其行和列中的任何两个之间具有最佳最小汉明距离。六个数据集的实验结果表明,使用这些确定性的编码矩阵的$N$-ary ECOC分类产生可比的,在许多情况下更高的精度相比,使用随机生成的编码矩阵。当自适应地选择$N$以使得$M$的维度与数据集中的类的数量紧密匹配时,这尤其正确,这减少了当截断$M$以拟合数据集时最小汉明距离的损失。这是验证通过距离公式$M$,这表明,这些自适应矩阵具有显着更高的最小汉明距离相比,随机生成的。

英文摘要:

A new recursive construction of $N$-ary error-correcting output code (ECOC) matrices for ensemble classification methods is presented, generalizing the classic doubling construction for binary Hadamard matrices. Given any prime integer $N$, this deterministic construction generates base-$N$ symmetric square matrices $M$ of prime-power dimension having optimal minimum Hamming distance between any two of its rows and columns. Experimental results for six datasets demonstrate that using these deterministic coding matrices for $N$-ary ECOC classification yields comparable and in many cases higher accuracy compared to using randomly generated coding matrices. This is particular true when $N$ is adaptively chosen so that the dimension of $M$ matches closely with the number of classes in a dataset, which reduces the loss in minimum Hamming distance when $M$ is truncated to fit the dataset. This is verified through a distance formula for $M$ which shows that these adaptive matrices have significantly higher minimum Hamming distance in comparison to randomly generated ones.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑