SPGMVC: Multiview Clustering via Partitioning the Signed Prototype Graph
Multiview clustering (MVC) has been widely studied in machine learning and data mining for its capability of improving clustering performance by fusing the information from multiview data. In the past decade, a large number of MVC methods have made impressive progress, but most of them suffer from computational burdens, especially in large-scale tasks. Binary MVC (BMVC) is proposed to address this issue by representing the large-scale high-dimensional dataset as a group of consensus and low-dimensional binary codes. However, current BMVC-based approaches generate the clustering by executing binary k-means on the obtained binary codes, which fail to capture the embedded geometric information, leading to poor clustering performance. In addition, parameter selection is another "mission impossible" in unsupervised learning tasks including MVC. To tackle these challenges, a framework of multiview clustering via partitioning the signed prototype graph (SPGMVC) is proposed in this work. The SPGMVC framework offers several contributions. First, SPGMVC is designed as a unified framework for MVC. It combines effective technologies, such as consensus binary coding, code compression (CC), signed prototype graph (SPG) partitioning, and prototype-based cluster assignment. Second, SPGMVC partitions the signed graph (SG) based on the relationships between positive and negative edges. By capturing the underlying structure of the data, this partitioning strategy improves clustering accuracy (ACC). CC techniques are applied to reduce the graph's scale, enabling further partitioning and enhancing computational efficiency. Third, SPGMVC employs an alternate minimizing strategy to efficiently handle the optimization problem. This strategy has nearly linear time and space complexity with respect to the data volume, making it suitable for large-scale tasks. Fourth, SPGMVC proposes an automatic parameter selection strategy, eliminating the need for extensive parameter exploration. Comprehensive experiments illustrate the superiority of our model. The implementation of SPGMVC is available at: https://github.com/gepingyang/PSGMVC.
Authors
- Geping Yang (ORCID: https://orcid.org/0000-0003-1403-3324)
- Zhiguo Gong (ORCID: https://orcid.org/0000-0002-4588-890X)
- Shusen Yang (ORCID: https://orcid.org/0009-0001-9149-9534)
- Xiang Chen (ORCID: https://orcid.org/0000-0002-9800-6472)
- Can Chen (ORCID: https://orcid.org/0000-0001-8741-8941)
- Zhifeng Hao (ORCID: https://orcid.org/0000-0002-9731-1504)
- Yiyang Yang (ORCID: https://orcid.org/0000-0002-9306-4489)
Institutions
- Guangdong University of Technology (CN)
- Sun Yat-sen University (CN)
- University of Macau (MO)
- Dongguan University of Technology (CN)
- Shantou University (CN)
- City University of Macau (MO)
Publication Details
- Journal
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2024-08-15
- DOI
- https://doi.org/10.1109/tnnls.2024.3439735
- Citations
- 3
- Primary Topic
- Video Analysis and Summarization
- Type
- article
- Field-Weighted Citation Impact
- 0.75
Funders
- Guangdong Science and Technology Department
- National Key Research and Development Program of China
- Basic and Applied Basic Research Foundation of Guangdong Province