Virtual label guided multi-view non-negative matrix factorization for data clustering

Non-negative matrix factorization (NMF) has attracted widespread attention due to its good performance and physical interpretation. However, it remains challenging when handling multi-view data for clustering. On one hand, the current multi-view NMF methods do not fully utilize the virtual label inf...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Digital signal processing Ročník 133; s. 103888
Hlavní autoři: Liu, Xiangyu, Song, Peng
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.03.2023
Témata:
Clustering
Multi-view learning
Non-negative matrix factorization
Virtual label
Virtual label
Non-negative matrix factorization
Clustering
Multi-view learning
ISSN:1051-2004, 1095-4333
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Non-negative matrix factorization (NMF) has attracted widespread attention due to its good performance and physical interpretation. However, it remains challenging when handling multi-view data for clustering. On one hand, the current multi-view NMF methods do not fully utilize the virtual label information that can be learned in the clustering process. On the other hand, they usually perform the procedures of learning latent representation and clustering individually. To solve these problems, we develop a novel multi-view clustering model, named virtual label guided multi-view non-negative matrix factorization (VLMNMF). Specifically, we learn the virtual label information of each view, which is used to guide the learning of the latent representation of data. Then, we integrate the latent representation learning and clustering process of the data into a joint framework. A multi-view graph Laplacian is further imposed on the learned low-dimensional representation, which can well preserve the local geometric structure of multi-view data. Experiments on several benchmark datasets illustrate the efficacy of the proposed method.
ISSN:1051-2004
1095-4333
DOI:10.1016/j.dsp.2022.103888