98%
921
2 minutes
20
Multiview clustering plays an important part in unsupervised learning. Although the existing methods have shown promising clustering performances, most of them assume that the data is completely coupled between different views, which is unfortunately not always ensured in real-world applications. The clustering performance of these methods drops dramatically when handling the uncoupled data. The main reason is that: 1) cross-view correlation of uncoupled data is unclear, which limits the existing multiview clustering methods to explore the complementary information between views and 2) features from different views are uncoupled with each other, which may mislead the multiview clustering methods to partition data into wrong clusters. To address these limitations, we propose a tensor approach for uncoupled multiview clustering (T-UMC) in this article. Instead of pairwise correlation, T-UMC chooses a most reliable view by view-specific silhouette coefficient (VSSC) at first, and then couples the self-representation matrix of each view with it by pairwise cross-view coupling learning. After that, by integrating recoupled self-representation matrices into a third-order tensor, the high-order correlations of all views are explored with tensor singular value decomposition (t-SVD)-based tensor nuclear norm (TNN). And the view-specific local structures of each individual view are also preserved with the local structure learning scheme with manifold learning. Besides, the physical meaning of view-specific coupling matrix is also discussed in this article. Extensive experiments on six commonly used benchmark datasets have demonstrated the superiority of the proposed method compared with the state-of-the-art multiview clustering methods.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1109/TCYB.2022.3212480 | DOI Listing |
IEEE J Biomed Health Inform
September 2025
Drug-target interaction (DTI) identification is of great significance in drug development in various areas, such as drug repositioning and potential drug side effects. Although a great variety of computational methods have been proposed for DTI prediction, it is still a challenge in the face of sparsely correlated drugs or targets. To address the impact of data sparsity on the model, we propose a multi-view neighborhood-enhanced graph contrastive learning approach (MneGCL), which is based on graph clustering according to the adjacency relationship in various similarity networks between drugs or targets, to fully exploit the information of drugs and targets with few corrections.
View Article and Find Full Text PDFJ R Stat Soc Series B Stat Methodol
April 2025
Department of Statistical Science, Duke University, NC, USA.
While there is an immense literature on Bayesian methods for clustering, the multiview case has received little attention. This problem focuses on obtaining distinct but statistically dependent clusterings in a common set of entities for different data types. For example, clustering patients into subgroups with subgroup membership varying according to the domain of the patient variables.
View Article and Find Full Text PDFNeural Netw
August 2025
Faculty of Science and Engineering, Anglia Ruskin University, Cambridge, UK. Electronic address:
Incomplete Multi-View Clustering (IMVC) focuses on uncovering the consensus and complementary information present in datasets with multiple incomplete views. However, existing IMVC methods face several limitations. First, many approaches exhibit high computational complexity.
View Article and Find Full Text PDFIEEE Trans Pattern Anal Mach Intell
August 2025
Federated multi-view clustering is an emerging machine learning paradigm that groups the data with each view distributed on an isolated client while preserving their privacies. Although recent researches have proposed a few feasible solutions, they are severely limited by two drawbacks. In specific, the clients are required to share their data representations at each iteration of model training, leading to heavy communication overhead.
View Article and Find Full Text PDFIEEE Trans Pattern Anal Mach Intell
August 2025
Multi-view bipartite graph clustering (MVBGC) is an active pipeline in unsupervised learning to tackle the limited scalability issue of traditional graph clustering. Despite improved performance, numerous variants still fall under conventional modeling that plugs additional modules, which however induces increasingly intricate models and fails to reveal the inherent variable relationship. We make the first attempt to introduce probabilistic graphical models for modeling the multi-view bipartite graph clustering task, reformulating it as a maximum likelihood estimation (MLE) problem.
View Article and Find Full Text PDF