返回
Multi-view clustering algorithm based on feature learning and structure learning
DOI:10.1016/j.neucom.2024.128138.png)
摘要
En 中文
Multi-clustering aims to cluster heterogeneous information from different perspectives, which is an important research direction in Multi-view learning. Many clustering algorithms based on multi-view data usually have the following two problems: (1) high-dimensional data leads to high computing cost, and data noise leads to poor clustering performance. (2) It cannot effectively carry out structure learning and integrate heterogeneous information of each view. In order to address these issues, this work suggests a multi-view clustering algorithm (FS-MVC) based on feature learning and structure learning. For each view, feature learning comes first. The data after dimensionality reduction is used for clustering. The projection matrix is introduced to reduce the dimensionality of each view of the original data. Second, a brand-new structure learning technique is developed that may efficiently utilize the diverse information present in each view and produce the best clustering outcomes. The clustering results on eight multi-view data are compared with those of nine advanced multi-view clustering methods in order to confirm the performance of the proposed approach.
Keyword:
Multi-view clustering
Feature learning
Structural learning
Cluster labels
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
暂无机构信息
引用论文
Self-representation and matrix factorization based multi-view clustering基于自表示和矩阵分解的多视图聚类
NEUROCOMPUTING
IF6.5
Robust anchor-based multi-view clustering via spectral embedded concept factorization基于谱嵌入概念分解的鲁棒锚多视图聚类
NEUROCOMPUTING
IF6.5
Fast Parameter-Free Multi-View Subspace Clustering With Consensus Anchor Guidance共识锚引导的无参数多视图子空间快速聚类

