paper-with-me

Papers

Kernel Alignment-based Multi-view Unsupervised Feature Selection with Sample-level Adaptive Graph Learning

2026-01-12 · Yalan Tan, Yanyong Huang, Zongxin Shen, Dongjie Wang, Fengmao Lv, Tianrui Li arxiv

Although multi-view unsupervised feature selection (MUFS) has demonstrated success in dimensionality reduction for unlabeled multi-view data, most existing methods reduce feature redundancy by focusing on linear correlations among features but often overlook complex nonlinear dependencies. This limits the effectiveness of feature selection. In addition, existing methods fuse similarity graphs from multiple views by employing sample-invariant weights to preserve local structure. However, this process fails to account for differences in local neighborhood clarity among samples within each view, thereby hindering accurate characterization of the intrinsic local structure of the data. In this paper, we propose a Kernel Alignment-based multi-view unsupervised FeatUre selection with Sample-level adaptive graph lEarning method (KAFUSE) to address these issues. Specifically, we first employ kernel alignment with an orthogonal constraint to reduce feature redundancy in both linear and nonlinear relationships. Then, a cross-view consistent similarity graph is learned by applying sample-level fusion to each slice of a tensor formed by stacking similarity graphs from different views, which automatically adjusts the view weights for each sample during fusion. These two steps are integrated into a unified model for feature selection, enabling mutual enhancement between them. Extensive experiments on real multi-view datasets demonstrate the superiority of KAFUSE over state-of-the-art methods.

📄 PDF Abstract BibTeX arXiv:2601.07288

Code (0)

등록된 구현이 없습니다.

Tasks

Dimensionality ReductionGraph Learning

Similar Papers 제목 키워드 기반

Kernel Alignment for Unsupervised Feature Selection via Matrix Factorization

2024-03-13 · Ziyuan Lin, Deanna Needell

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 effectiv…

feature selection

Kernelized Multiview Projection

2015-08-03 · Mengyang Yu, Li Liu, Ling Shao

Conventional vision algorithms adopt a single type of feature or a simple concatenation of multiple features, which is always represented in a high-dimensional space. In this paper, we propose a novel unsupervised spectr…

Maximizing Conditional Independence for Unsupervised Domain Adaptation

2022-03-07 · Yi-Ming Zhai, You-Wei Luo

Unsupervised domain adaptation studies how to transfer a learner from a labeled source domain to an unlabeled target domain with different distributions. Existing methods mainly focus on matching the marginal distributio…

Domain AdaptationUnsupervised Domain Adaptation

Robust Multiple Kernel k-means Clustering using Min-Max Optimization

2018-03-06 · Seojin Bang, Yao-Liang Yu, Wei Wu

Multiple kernel learning is a type of multiview learning that combines different data modalities by capturing view-specific patterns using kernels. Although supervised multiple kernel learning has been extensively studie…

ClusteringDisease PredictionMultiview Learning

Cross-view kernel transfer

2019-10-14 · Riikka Huusari, Cécile Capponi, Paul Villoutreix, Hachem Kadri

We consider the kernel completion problem with the presence of multiple views in the data. In this context the data samples can be fully missing in some views, creating missing columns and rows to the kernel matrices tha…

Missing Values