Dual-disentangled Deep Multiple Clustering
<|reference_start|>Dual-disentangled Deep Multiple Clustering: Multiple clustering has gathered significant attention in recent years due to its potential to reveal multiple hidden structures of the data from different perspectives. Most of multiple clustering methods first derive feature representations by controlling the dissimilarity among them, subsequently employing traditional clustering methods (e.g., k-means) to achieve the final multiple clustering outcomes. However, the learned feature representations can exhibit a weak relevance to the ultimate goal of distinct clustering. Moreover, these features are often not explicitly learned for the purpose of clustering. Therefore, in this paper, we propose a novel Dual-Disentangled deep Multiple Clustering method named DDMC by learning disentangled representations. Specifically, DDMC is achieved by a variational Expectation-Maximization (EM) framework. In the E-step, the disentanglement learning module employs coarse-grained and fine-grained disentangled representations to obtain a more diverse set of latent factors from the data. In the M-step, the cluster assignment module utilizes a cluster objective function to augment the effectiveness of the cluster output. Our extensive experiments demonstrate that DDMC consistently outperforms state-of-the-art methods across seven commonly used tasks. Our code is available at https://github.com/Alexander-Yao/DDMC.<|reference_end|>
@article{yao2024dual-disentangled,
    title={Dual-disentangled Deep Multiple Clustering},
    author={Jiawei Yao and Juhua Hu},
    journal={arXiv preprint arXiv:2402.05310},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.05310},
    primaryClass={cs.CV}
}