期刊
MACHINE LEARNING
卷 111, 期 1, 页码 273-317出版社
SPRINGER
DOI: 10.1007/s10994-021-05998-5
关键词
Feature ranking; Representation learning; Relief
资金
- Slovenian Research Agency (ARRS) [P2-0103]
- ERC Complementary Scheme [N2-0078]
- TAILOR - EU [952215]
- AI4EU [825619]
This paper explores how to adapt the Relief algorithm to benefit from (Riemannian) manifold-based embeddings of instance and target spaces, proposing the faster and better feature ranking ReliefE algorithm. Evaluation on 20 real-life data sets shows the utility of ReliefE for high-dimensional data sets.
Feature ranking has been widely adopted in machine learning applications such as high-throughput biology and social sciences. The approaches of the popular Relief family of algorithms assign importances to features by iteratively accounting for nearest relevant and irrelevant instances. Despite their high utility, these algorithms can be computationally expensive and not-well suited for high-dimensional sparse input spaces. In contrast, recent embedding-based methods learn compact, low-dimensional representations, potentially facilitating down-stream learning capabilities of conventional learners. This paper explores how the Relief branch of algorithms can be adapted to benefit from (Riemannian) manifold-based embeddings of instance and target spaces, where a given embedding's dimensionality is intrinsic to the dimensionality of the considered data set. The developed ReliefE algorithm is faster and can result in better feature rankings, as shown by our evaluation on 20 real-life data sets for multi-class and multi-label classification tasks. The utility of ReliefE for high-dimensional data sets is ensured by its implementation that utilizes sparse matrix algebraic operations. Finally, the relation of ReliefE to other ranking algorithms is studied via the Fuzzy Jaccard Index.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据