arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1901.09643cs.LGstat.ML
收藏

支持功能机器

Support Feature Machines

Department of Informatics, Nicolaus Copernicus University(哥白尼大学信息学系);is.umk.pl(哥白尼大学信息学系(注:此处为原机构网站,根据上下文应为哥白尼大学信息学系的一部分,严格按原文机构名提取))

Tomasz Maszczyk, Włodzisław Duch

摘要:

具有各种核函数的支持向量机在机器学习中占据主导地位已有多年,并得到了广泛的应用。虽然他们有许多有吸引力的功能解释他们的解决方案是相当困难的,使用一个单一的内核类型可能并不适合在所有领域的输入空间,收敛问题的一些内核并不罕见,标准的二次规划解决方案有$O(m^3)$的时间和$O(m^2)$空间复杂度为$m$训练模式。内核方法之所以有效,是因为它们隐式地提供了新的、有用的特性。从各种内核和其他向量变换导出的这些特征可以直接用于任何机器学习算法中,从而促进数据的多分辨率、异构模型。因此,基于扩展特征空间中的线性模型的支持特征机(SFM),能够控制支持特征的选择,至少与任何基于核的SVM一样好的结果,消除了与解释,缩放和收敛相关的所有问题。这是证明了一些基准数据集分析线性歧视,SVM,决策树和最近邻方法。

英文摘要:

Support Vector Machines (SVMs) with various kernels have played dominant role in machine learning for many years, finding numerous applications. Although they have many attractive features interpretation of their solutions is quite difficult, the use of a single kernel type may not be appropriate in all areas of the input space, convergence problems for some kernels are not uncommon, the standard quadratic programming solution has $O(m^3)$ time and $O(m^2)$ space complexity for $m$ training patterns. Kernel methods work because they implicitly provide new, useful features. Such features, derived from various kernels and other vector transformations, may be used directly in any machine learning algorithm, facilitating multiresolution, heterogeneous models of data. Therefore Support Feature Machines (SFM) based on linear models in the extended feature spaces, enabling control over selection of support features, give at least as good results as any kernel-based SVMs, removing all problems related to interpretation, scaling and convergence. This is demonstrated for a number of benchmark datasets analyzed with linear discrimination, SVM, decision trees and nearest neighbor methods.

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

↑