A graph-inspired classifier, known as Optimum-Path Forest (OPF), has proven to be a state-of-the-art algorithm comparable to Logistic Regressors, Support Vector Machines in a wide variety of tasks. Recently, its Python-based version, denoted as OPFython, has been proposed to provide a more friendly framework and a faster prototyping environment. Nevertheless, Python-based algorithms are slower than their counterpart C-based algorithms, impacting their performance when confronted with large amounts of data. Therefore, this paper proposed a simple yet highly efficient speed up using the Numba package, which accelerates Numpy-based calculations and attempts to increase the algorithm's overall performance. Experimental results showed that the proposed approach achieved better results than the na\"ive Python-based OPF and speeded up its distance measurement calculation.
翻译:以图解为主的分类器(Optimum-Path Forest (OPF))已被证明是一种最先进的算法,可以与后勤递减器(Forest Regress)相比,支持矢量机(Support Regress)执行各种各样的任务。最近,它以Python为主的版本(称为OPFython)被提议提供一个更友好的框架和更快的原型环境。然而,基于Python的算法比对应的C型算法慢,在面对大量数据时影响其性能。因此,本文建议使用Numba 软件包加快简单而高效的速度,加速基于Numba的计算,并试图提高算法的总体性能。实验结果表明,拟议的方法取得了比“na\ive Python 基础 OPFFPFS”更好的效果,并加快了距离测量计算速度。