跳到主要导航 跳到搜索 跳到主要内容

Scalable Unaligned Multi-view k-Means

  • Northwestern Polytechnical University Xian

科研成果: 期刊稿件 › 文章 › 同行评审

摘要

Conventional multi-view clustering methods typically assume exact sample correspondence across views. In real-world applications, this assumption is frequently violated due to heterogeneous sensing modalities and asynchronous data acquisition, leading to the view-unaligned problem (VuP). Although several representative methods have been proposed to address VuP, their computational cost remains a primary limitation, particularly in large-scale settings. To address this limitation, we propose Scalable Unaligned Multi-view k-Means (SUMK), an efficient framework that performs clustering without requiring predefined correspondences. SUMK formulates cross-view alignment from an entropy-regularized optimal transport (OT) perspective by converting the estimation of each view-wise permutation matrix into the computation of a corresponding transport plan, which is obtained by solving a view-wise OT problem. To improve scalability on large datasets, we further employ a sparsification mechanism for the OT solver, thereby substantially reducing computational and memory costs. Consequently, SUMK serves as a strong and scalable baseline for large-scale view-unaligned multi-view k-Means clustering. Despite its simplicity, SUMK is highly effective, delivering clustering performance that is competitive with or superior to state-of-the-art unaligned multi-view methods, while significantly improving efficiency and robustness.

学术指纹

探究 'Scalable Unaligned Multi-view k-Means' 的科研主题。它们共同构成独一无二的学术指纹。

引用此