Adaptive Weighted Multi-View Clustering

Shuo Shuo Liu, Lin Lin
Proceedings of the Conference on Health, Inference, and Learning, PMLR 209:19-36, 2023.

Abstract

Learning multi-view data is an emerging problem in machine learning research, and nonnegative matrix factorization (NMF) is a popular dimensionality-reduction method for integrating information from multiple views. These views often provide not only consensus but also complementary information. However, most multi-view NMF algorithms assign equal weight to each view or tune the weight via line search empirically, which can be infeasible without any prior knowledge of the views or computationally expensive. In this paper, we propose a weighted multi-view NMF (WM-NMF) algorithm. In particular, we aim to address the critical technical gap, which is to learn both view-specific weight and observation-specific reconstruction weight to quantify each view’s information content. The introduced weighting scheme can alleviate unnecessary views’ adverse effects and enlarge the positive effects of the important views by assigning smaller and larger weights, respectively. Experimental results confirm the effectiveness and advantages of the proposed algorithm in terms of achieving better clustering performance and dealing with the noisy data compared to the existing algorithms.

Cite this Paper

BibTeX
@InProceedings{pmlr-v209-liu23a, title = {Adaptive Weighted Multi-View Clustering}, author = {Liu, Shuo Shuo and Lin, Lin}, booktitle = {Proceedings of the Conference on Health, Inference, and Learning}, pages = {19--36}, year = {2023}, editor = {Mortazavi, Bobak J. and Sarker, Tasmie and Beam, Andrew and Ho, Joyce C.}, volume = {209}, series = {Proceedings of Machine Learning Research}, month = {22 Jun--24 Jun}, publisher = {PMLR}, pdf = {https://proceedings.mlr.press/v209/liu23a/liu23a.pdf}, url = {https://proceedings.mlr.press/v209/liu23a.html}, abstract = {Learning multi-view data is an emerging problem in machine learning research, and nonnegative matrix factorization (NMF) is a popular dimensionality-reduction method for integrating information from multiple views. These views often provide not only consensus but also complementary information. However, most multi-view NMF algorithms assign equal weight to each view or tune the weight via line search empirically, which can be infeasible without any prior knowledge of the views or computationally expensive. In this paper, we propose a weighted multi-view NMF (WM-NMF) algorithm. In particular, we aim to address the critical technical gap, which is to learn both view-specific weight and observation-specific reconstruction weight to quantify each view’s information content. The introduced weighting scheme can alleviate unnecessary views’ adverse effects and enlarge the positive effects of the important views by assigning smaller and larger weights, respectively. Experimental results confirm the effectiveness and advantages of the proposed algorithm in terms of achieving better clustering performance and dealing with the noisy data compared to the existing algorithms.} }
Endnote
%0 Conference Paper %T Adaptive Weighted Multi-View Clustering %A Shuo Shuo Liu %A Lin Lin %B Proceedings of the Conference on Health, Inference, and Learning %C Proceedings of Machine Learning Research %D 2023 %E Bobak J. Mortazavi %E Tasmie Sarker %E Andrew Beam %E Joyce C. Ho %F pmlr-v209-liu23a %I PMLR %P 19--36 %U https://proceedings.mlr.press/v209/liu23a.html %V 209 %X Learning multi-view data is an emerging problem in machine learning research, and nonnegative matrix factorization (NMF) is a popular dimensionality-reduction method for integrating information from multiple views. These views often provide not only consensus but also complementary information. However, most multi-view NMF algorithms assign equal weight to each view or tune the weight via line search empirically, which can be infeasible without any prior knowledge of the views or computationally expensive. In this paper, we propose a weighted multi-view NMF (WM-NMF) algorithm. In particular, we aim to address the critical technical gap, which is to learn both view-specific weight and observation-specific reconstruction weight to quantify each view’s information content. The introduced weighting scheme can alleviate unnecessary views’ adverse effects and enlarge the positive effects of the important views by assigning smaller and larger weights, respectively. Experimental results confirm the effectiveness and advantages of the proposed algorithm in terms of achieving better clustering performance and dealing with the noisy data compared to the existing algorithms.
APA
Liu, S.S. & Lin, L.. (2023). Adaptive Weighted Multi-View Clustering. Proceedings of the Conference on Health, Inference, and Learning, in Proceedings of Machine Learning Research 209:19-36 Available from https://proceedings.mlr.press/v209/liu23a.html.

Related Material