用于机器学习的加权向量:应用于边界检测的数值谐波分析
Weighting vectors for machine learning: numerical harmonic analysis applied to boundary detection
摘要:
度量空间大小是代数拓扑学中的一个活跃研究领域,它是一个标量,概括了一般度量空间中不同点的有效数量。{ \em加权向量}是一个密切相关的概念,它以一种非平凡的方式捕获了原始度量空间的许多底层几何。最近的工作表明,当度量空间是欧几里德,加权向量作为一个有效的工具进行边界检测。我们重铸这个结果,并显示加权向量可以被视为一个解决方案的核SVM。因此,我们将这种新的见解应用于离群值检测任务,并且我们在基准数据集上展示了具有竞争力或超过最先进技术的性能。在适当的假设下,我们证明了具有矩阵求逆计算代价的加权向量可以在线性时间内有效地近似。我们展示了如何最近邻方法可以近似的解决方案,由SVM定义的最小化问题。
英文摘要:
Metric space magnitude, an active field of research in algebraic topology, is a scalar quantity that summarizes the effective number of distinct points that live in a general metric space. The {\em weighting vector} is a closely-related concept that captures, in a nontrivial way, much of the underlying geometry of the original metric space. Recent work has demonstrated that when the metric space is Euclidean, the weighting vector serves as an effective tool for boundary detection. We recast this result and show the weighting vector may be viewed as a solution to a kernelized SVM. As one consequence, we apply this new insight to the task of outlier detection, and we demonstrate performance that is competitive or exceeds performance of state-of-the-art techniques on benchmark data sets. Under mild assumptions, we show the weighting vector, which has computational cost of matrix inversion, can be efficiently approximated in linear time. We show how nearest neighbor methods can approximate solutions to the minimization problems defined by SVMs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。