“…For a complete picture of the field, readers may refer to the survey by Min et al (2018). We emphasize deep-clustering-based approaches, which attempt to learn the feature representation of the data while simultaneously discovering the underlying clusters: K-means Caron et al, 2018), information maximization (Menapace et al, 2020;Ji et al, 2019;Kim and Ha, 2021;Do et al, 2021), transport alignment (Asano et al, 2019;Caron et al, 2020;Wang et al, 2022), neighborhood-clustering (Xie et al, 2016;Huang et al, 2019;Dang et al, 2021), contrastive learning (Pan and Kang, 2021;Shen et al, 2021), probabilistic approaches Monnier et al, 2020;Falck et al, 2021;Manduchi et al, 2021), and kernel density (Yang and Li, 2021). These works primarily focus on clustering data for downstream tasks for a single domain, whereas our clustering algorithm is designed to cluster the data from multiple domains.…”