.png){kind=icon}
.png){kind=icon}
Return
Multi-view graph learning based on efficient neighbors
.png){kind=icon}
OA
AI
DOI：10.1007/s10479-025-06916-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In multi-view machine learning problems we have multiple descriptions of the same objects. Multi-view clustering is about finding cluster structures from these multi-view descriptions. The goal is to integrate the complementary information that is found in these different views. In this work, we develop a graph-based approach for multi-view clustering. In particular, we introduce the Joint Multiple Efficient Neighbors and Graph (JMEG) learning method for multi-view clustering. Our objective is to find a good balance between sparsity and connectivity. To do so, we introduce a post-processing technique. Then, JMEG also employs partition space and consensus graph learning to uncover data structures effectively. The whole clustering process is defined in terms of an optimization problem, which is solved using an iterative alternating algorithm. We illustrate the usefulness of our approach with experiments that outperform state-of-the-art methods. We also discuss in this paper the computational cost of JMEG.
Keywords:
Multi-view clustering
Efficient neighborhood
Connectivity and sparsity
Fusion graph
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W