Probabilistically Aligned View-unaligned Clustering with Adaptive Template Selection
<|reference_start|>Probabilistically Aligned View-unaligned Clustering with Adaptive Template Selection: In most existing multi-view modeling scenarios, cross-view correspondence (CVC) between instances of the same target from different views, like paired image-text data, is a crucial prerequisite for effortlessly deriving a consistent representation. Nevertheless, this premise is frequently compromised in certain applications, where each view is organized and transmitted independently, resulting in the view-unaligned problem (VuP). Restoring CVC of unaligned multi-view data is a challenging and highly demanding task that has received limited attention from the research community. To tackle this practical challenge, we propose to integrate the permutation derivation procedure into the bipartite graph paradigm for view-unaligned clustering, termed Probabilistically Aligned View-unaligned Clustering with Adaptive Template Selection (PAVuC-ATS). Specifically, we learn consistent anchors and view-specific graphs by the bipartite graph, and derive permutations applied to the unaligned graphs by reformulating the alignment between two latent representations as a 2-step transition of a Markov chain with adaptive template selection, thereby achieving the probabilistic alignment. The convergence of the resultant optimization problem is validated both experimentally and theoretically. Extensive experiments on six benchmark datasets demonstrate the superiority of the proposed PAVuC-ATS over the baseline methods.<|reference_end|>
@article{dong2024probabilistically,
    title={Probabilistically Aligned View-unaligned Clustering with Adaptive
  Template Selection},
    author={Wenhua Dong, Xiao-Jun Wu, Zhenhua Feng, Sara Atito, Muhammad Awais,
  and Josef Kittler},
    journal={arXiv preprint arXiv:2409.14882},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.14882},
    primaryClass={cs.CV}
}