返回
Adaptive Similarity Embedding for Unsupervised Multi-View Feature Selection
DOI:10.1109/TKDE.2020.2969860.png)
摘要
En 中文
Multi-view learning has become a significant research topic in image processing, data mining and machine learning due to the proliferation of multi-view data. Considering the difficulty in obtaining labeled data in many real applications, we focus on the multi-view unsupervised feature selection problem. Most existing multi-view feature selection introduce an identical similarity matrix among different views, which cannot preserve the specific correlation between each single view. Also, some of these methods just consider either global or local structures. In this paper, we propose an embedding method, Adaptive Similarity Embedding for Unsupervised Multi-View Feature Selection (ASE-UMFS). This method reduces the high-dimensional data to the low dimensions and unifies different views to a combination weight matrix. We also use parameters to constraint the similarity matrix for the local structure, where the regularization term is used to add a prior of uniform distribution; taking into account of the independence in projection matrix among different views, optimization of the similarity matrix is further improved. To confirm the effectiveness of ASE-UMFS, comparisons are made with benchmark algorithm on real-world data sets. The experimental results demonstrate that the proposed algorithm outperforms several state-of-the-art methods in multi-view learning.
Keyword:
Feature extraction
Sparse matrices
Laplace equations
Manifolds
Correlation
Sun
Data structures
Multi-view embedding
unsupervised feature selection
combination weight matrix
adaptive similarity
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
引用论文
Global and local structure preserving sparse subspace learning: An iterative approach to unsupervised feature selection
PATTERN RECOGNITION
IF7.6

