Kernel Alignment for Unsupervised Feature Selection via Matrix Factorization
Ziyuan Lin, Deanna Needell

TL;DR
This paper introduces a novel unsupervised feature selection method that integrates kernel alignment with matrix factorization, effectively capturing nonlinear feature relationships and automatically selecting optimal kernels, leading to improved clustering and redundancy reduction.
Contribution
It proposes a new kernel alignment-based matrix factorization model for unsupervised feature selection and a multiple kernel learning approach to adaptively choose kernels.
Findings
Outperforms existing methods in clustering accuracy.
Reduces feature redundancy more effectively.
Captures nonlinear feature structures successfully.
Abstract
By removing irrelevant and redundant features, feature selection aims to find a good representation of the original features. With the prevalence of unlabeled data, unsupervised feature selection has been proven effective in alleviating the so-called curse of dimensionality. Most existing matrix factorization-based unsupervised feature selection methods are built upon subspace learning, but they have limitations in capturing nonlinear structural information among features. It is well-known that kernel techniques can capture nonlinear structural information. In this paper, we construct a model by integrating kernel functions and kernel alignment, which can be equivalently characterized as a matrix factorization problem. However, such an extension raises another issue: the algorithm performance heavily depends on the choice of kernel, which is often unknown a priori. Therefore, we further…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFace and Expression Recognition
MethodsFeature Selection
