Skip to content

Transport Barycenter-Guided Sample-to-Cluster Matching for Unaligned Multi-view Clustering.

Aug 2026 · IEEE Transactions on Pattern Analysis and Machine Intelligence · Vol PP, pp. 1-18 · 0 citations
Medicine

TL;DR

Multi-view Discrete Optimal Transport is instantiated as a cluster-level transport matching framework that first adopts semi-discrete OT to learn a global OT barycenter via aggregating semantic-geometric information from all views, and then transports samples to barycenter-anchored consensus clusters under consistency constraints on semantic assignment and geometric measure.

Abstract

Multi-view clustering (MVC) relies on consistency learning to align and fuse multi-view information for building clustering decision boundaries. However, mainstream methods adopt sample-to-sample/distribution/structure similarity smoothing for consistency alignment, which builds upon continuous cluster manifolds with semantic and geometric overlap and reliable paired priors of sample correspondences. They suffer from semantic- and instance-level view-unaligned problems inherent in the real-world data with discrete non-convex structures and unreliable cross-view correspondences. Misled by unaligned noise, they weaken discriminative semantic boundaries via similarity smoothing over false-positive pairs, and degrade discrete non-convex structures by mistakenly bridging distinct cluster manifolds via pseudo-semantic interpolation. Such consistency alignment pursues highly similar representations, distributions and structures, which deviates from the clustering logic of many-to-one partitioning as well as its learning goal for separable semantic boundaries. Guided by the many-to-one principle, we jointly formulate consistency alignment and clustering decision as a novel sample-to-cluster map, termed Multi-view Discrete Optimal Transport. Specifically, MvDOT is instantiated as a cluster-level transport matching framework that first adopts semi-discrete OT to learn a global OT barycenter via aggregating semantic-geometric information from all views, and then transports samples to barycenter-anchored consensus clusters under consistency constraints on semantic assignment and geometric measure. Even with discrete cluster manifolds and unreliable sample correspondences, MvDOT achieves cross-view consistent alignment while preserving inter-cluster semantic boundaries to uncover the underlying cluster structures. Extensive experiments show MvDOT outperforms 10 baselines with higher confidence and stronger robustness in complex MVC tasks.

View source

Similar papers

Aug 2026

Self-Refining Spherical Consensus Embedding for Constrained Multi-View Clustering.

This work proposes a novel deep constrained multi-view clustering framework, namely SeSCE, which encodes view embeddings into a spherical space, leveraging pairwise constraints to maximize intra-class compactness and inter-class separability and introduces a confidence-aware pseudo-constraint mining mechanism.

Jun Wang, Zhenglai Li, Chuan Tang et al. · 0 citations
Aug 2026

D2M-Net: decoupled dual matching for few-shot 3D point-cloud semantic segmentation

Results suggest that decoupled matching improves robustness to appearance-driven confusion in indoor point-cloud segmentation and propose D2M-Net, a decoupled dual-matching network that separates backbone features into geometry-oriented and semantic-oriented subspaces before prototype comparison.

Han-Bin Fang, Cheng-Long Peng, Xue-Yong Xiang et al. · 0 citations
Open access Aug 2026

AMCA-SGG: Adaptive multi-prototype learning and cross-modal alignment for unbiased scene graph generation

This work proposes AMCA, an unbiased SGG framework integrating adaptive multi-prototype learning with cross-modal alignment, which achieves consistently competitive performance across multiple SGG tasks, with particularly strong improvements on the unbiased mR@K metric.

Jinhao Fan, Yuan-Hao Xi, Chuanping Hu et al. · 0 citations
Conference Open access Sep 2026

Mixture of Clustering Experts with Dual Consistency for Multi-View Clustering

Multi-view clustering aims to discover shared semantic structures from multiple complementary data views to improve clustering performance. However, most existing methods rely on a single clustering representation for each semantic cluster, which limits the ability to model complex cluster structures and diverse patter...

Dai-Dai Zhu, Yang Zhao, Dandan Ma et al. · 0 citations
Conference Open access Sep 2026

Dual-Topology Learning with Adaptive Anchors for Multi-View Clustering

The Dual-tOpology learning with adapTive Anchors (DOTA) is proposed, which not only learns the sample-anchor relationship but also preserves the topology structure among anchors, significantly enhancing the discriminability of learned representation while preserving the underlying data manifold.

Cheng-Long Zhang, Chao Zhang, Jun-Hao Zhang et al. · 0 citations
Conference Open access Sep 2026

Multi-view Regression Clustering via Low-Rank Manifold Decomposition

Multi-view Clustering via Manifold Decomposition is proposed, which directly infers cluster labels from multi-view data without explicit similarity graph construction or anchor selection, and reformulates multi-view clustering as a unified multi-view regression problem, where cluster labels are optimized as model varia...

Xiao-Wei Zhao, Xin-Yue Kou, Yan Chen et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.