Multi-view clustering by inter-cluster connectivity guided reward
Article No.: 390, Pages 9846 - 9855
Abstract
Multi-view clustering has been widely explored for its effectiveness in harmonizing heterogeneity along with consistency in different views of data. Despite the significant progress made by recent works, the performance of most existing methods is heavily reliant on strong priori information regarding the true number of clusters k, which is rarely feasible in real-world scenarios. In this paper, we propose a novel graph-based multiview clustering algorithm to infer unknown k through a graph consistency reward mechanism. To be specific, we evaluate the cluster indicator matrix during each iteration with respect to diverse k. We formulate the inference process of unknown k as a parsimonious reinforcement learning paradigm, where the reward is measured by inter-cluster connectivity. As a result, our approach is capable of independently producing the final clustering result, free from the input of a predefined cluster number. Experimental results on multiple benchmark datasets demonstrate the effectiveness of our proposed approach in comparison to existing state-of-the-art methods.
References
[1]
Bergemann, D. and Valimaki, J. Bandit problems. 2006.
[2]
Bickel, S. and Scheffer, T. Multi-view clustering. In ICDM, volume 4, pp. 19-26. Citeseer, 2004.
[3]
Cai, H., Tan, Y., Huang, S., and Lv, J. Lifelong multiview spectral clustering. In Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, pp. 3488-3496, 2023.
[4]
Cai, X., Nie, F., and Huang, H. Multi-view k-means clustering on big data. In Twenty-Third International Joint Conference on Artificial Intelligence, 2013.
[5]
Cao, X., Zhang, C., Fu, H., Liu, S., and Zhang, H. Diversity-induced multi-view subspace clustering. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 586-594, 2015.
[6]
Ester, M., Kriegel, H.-P., Sander, J., Xu, X., et al. A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD, volume 96, pp. 226-231, 1996.
[7]
Huang, S., Kang, Z., Tsang, I. W., and Xu, Z. Autoweighted multi-view clustering via kernelized graph learning. Pattern Recognition, 88:174-184, 2019.
[8]
Huang, S., Kang, Z., and Xu, Z. Auto-weighted multiview clustering via deep matrix decomposition. Pattern Recognition, 97:107015, 2020.
[9]
Huang, S., Tsang, I. W., Xu, Z., and Lv, J. Measuring diversity in graph learning: A unified framework for structured multi-view clustering. IEEE Transactions on Knowledge and Data Engineering, 34(12):5869-5883, 2021.
[10]
Huang, S., Liu, Y., Cai, H., Tan, Y., Tang, C., and Lv, J. Smooth representation learning from multi-view data. Information Fusion, 100:101916, 2023.
[11]
Kang, Z., Guo, Z., Huang, S., Wang, S., Chen, W., Su, Y., and Xu, Z. Multiple partitions aligned clustering. In IJCAI, pp. 2701-2707. ijcai.org, 2019.
[12]
Kang, Z., Zhao, X., Peng, C., Zhu, H., Zhou, J. T., Peng, X., Chen, W., and Xu, Z. Partition level multiview subspace clustering. Neural Networks, 122:279-288, 2020a.
[13]
Kang, Z., Zhou, W., Zhao, Z., Shao, J., Han, M., and Xu, Z. Large-scale multi-view subspace clustering in linear time. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, pp. 4412-4419, 2020b.
[14]
Kodinariya, T. M., Makwana, P. R., et al. Review on determining number of cluster in k-means clustering. International Journal, 1(6):90-95, 2013.
[15]
Kumar, A. and Daumé, H. A co-training approach for multi-view spectral clustering. In Proceedings of the 28th International Conference on Machine Learning (ICML- 11), pp. 393-400, 2011.
[16]
Kumar, A., Rai, P., and Daume, H. Co-regularized multiview spectral clustering. Advances in Neural Information Processing Systems, 24, 2011.
[17]
Langley, P. Crafting papers on machine learning. In ICML, pp. 1207-1216, 2000.
[18]
Li, Z., Tang, C., Liu, X., Zheng, X., Zhang, W., and Zhu, E. Consensus graph learning for multi-view clustering. IEEE Transactions on Multimedia, 24:2461-2472, 2021.
[19]
Liu, J., Wang, C., Gao, J., and Han, J. Multi-view clustering via joint nonnegative matrix factorization. In Proceedings of the 2013 SIAM International Conference on Data Mining, pp. 252-260. SIAM, 2013.
[20]
Liu, J., Liu, X., Yang, Y., Guo, X., Kloft, M., and He, L. Multiview subspace clustering via co-training robust data representation. IEEE Transactions on Neural Networks and Learning Systems, 33(10):5177-5189, 2021.
[21]
Liu, S., Wang, S., Zhang, P., Xu, K., Liu, X., Zhang, C., and Gao, F. Efficient one-pass multi-view subspace clustering with consensus anchors. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 36, pp. 7576-7584, 2022.
[22]
Liu, Y., Liang, K., Xia, J., Yang, X., Zhou, S., Liu, M., Liu, X., and Li, S. Z. Reinforcement graph clustering with unknown cluster number. In Proceedings of the 31st ACM International Conference on Multimedia, pp. 3528-3537, 2023.
[23]
Luo, S., Zhang, C., Zhang, W., and Cao, X. Consistent and specific multi-view subspace clustering. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 32, 2018.
[24]
Nie, F., Cai, G., and Li, X. Multi-view clustering and semi-supervised classification with adaptive neighbours. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 31, 2017.
[25]
Nie, F., Tian, L., and Li, X. Multiview clustering via adaptively weighted procrustes. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 2022-2030, 2018.
[26]
Onumanyi, A. J., Molokomme, D. N., Isaac, S. J., and Abu-Mahfouz, A. M. Autoelbow: An automatic elbow detection method for estimating the number of clusters in a dataset. Applied Sciences, 12(15):7515, 2022.
[27]
Peng, X., Huang, Z., Lv, J., Zhu, H., and Zhou, J. T. Comic: Multi-view clustering without parameter selection. In International Conference on Machine Learning, pp. 5092-5101. PMLR, 2019.
[28]
Rodriguez, A. and Laio, A. Clustering by fast search and find of density peaks. Science, 344(6191):1492-1496, 2014.
[29]
Ronen, M., Finder, S. E., and Freifeld, O. Deepdpm: Deep clustering with an unknown number of clusters. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 9861-9870, 2022.
[30]
Silver, D., Schrittwieser, J., Simonyan, K., Antonoglou, I., Huang, A., Guez, A., Hubert, T., Baker, L., Lai, M., Bolton, A., et al. Mastering the game of go without human knowledge. Nature, 550(7676):354-359, 2017.
[31]
Sun, M., Zhang, P., Wang, S., Zhou, S., Tu, W., Liu, X., Zhu, E., and Wang, C. Scalable multi-view subspace clustering with unified anchors. In Proceedings of the 29th ACM International Conference on Multimedia, pp. 3528-3536, 2021.
[32]
Tan, Y., Liu, Y., Huang, S., Feng, W., and Lv, J. Sample-level multi-view graph clustering. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp. 23966-23975, 2023.
[33]
Tang, C., Liu, X., Zhu, X., Zhu, E., Luo, Z., Wang, L., and Gao, W. Cgd: Multi-view clustering via cross-view graph diffusion. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, pp. 5924-5931, 2020.
[34]
Tian, Y., Krishnan, D., and Isola, P. Contrastive multiview coding. In Computer Vision-ECCV 2020: 16th European Conference, Glasgow, UK, August 23-28, 2020, Proceedings, Part XI 16, pp. 776-794. Springer, 2020.
[35]
Tibshirani, R., Walther, G., and Hastie, T. Estimating the number of clusters in a data set via the gap statistic. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 63(2):411-423, 2001.
[36]
Umargono, E., Suseno, J. E., and Gunawan, S. V. K-means clustering optimization using the elbow method and early centroid determination based on mean and median formula. In The 2nd International Seminar on Science and Technology (ISSTEC 2019), pp. 121-129. Atlantis Press, 2020.
[37]
Van der Maaten, L. and Hinton, G. Visualizing data using t-sne. Journal of Machine Learning Research, 9(11), 2008.
[38]
Wan, X., Liu, J., Liang, W., Liu, X., Wen, Y., and Zhu, E. Continual multi-view clustering. In Proceedings of the 30th ACM International Conference on Multimedia, pp. 3676-3684, 2022.
[39]
Wang, C.-D., Lai, J.-H., and Philip, S. Y. Multi-view clustering based on belief propagation. IEEE Transactions on Knowledge and Data Engineering, 28(4):1007-1021, 2015.
[40]
Wang, H., Yang, Y., and Liu, B. Gmc: Graph-based multiview clustering. IEEE Transactions on Knowledge and Data Engineering, 32(6):1116-1129, 2019.
[41]
Wang, S., Liu, X., Zhu, X., Zhang, P., Zhang, Y., Gao, F., and Zhu, E. Fast parameter-free multi-view subspace clustering with consensus anchor guidance. IEEE Transactions on Image Processing, 31:556-568, 2021.
[42]
Yuan, C. and Yang, H. Research on k-value selection method of k-means clustering algorithm. J, 2(2):226-235, 2019.
[43]
Zhang, P., Liu, X., Xiong, J., Zhou, S., Zhao, W., Zhu, E., and Cai, Z. Consensus one-step multi-view subspace clustering. IEEE Transactions on Knowledge and Data Engineering, 34(10):4676-4689, 2020.
[44]
Zhao, H., Ding, Z., and Fu, Y. Multi-view clustering via deep matrix factorization. In Proceedings of the AAAI Conference on Artificial intelligence, volume 31, 2017.
[45]
Zhao, H., Yang, X., and Deng, C. Parameter-agnostic deep graph clustering. ACM Transactions on Knowledge Discovery from Data, 18(3):1-20, 2024.
Index Terms
- Multi-view clustering by inter-cluster connectivity guided reward
Index terms have been assigned to the content through auto-classification.
Recommendations
Centroids-guided deep multi-view K-means clustering
AbstractWith the progress of deep learning used in unsupervised learning, deep approach based multi-view clustering methods have been increasingly proposed in recent years. However, in most of these methods, deep representation learning is not ...
On cluster tree for nested and multi-density data clustering
Clustering is one of the important data mining tasks. Nested clusters or clusters of multi-density are very prevalent in data sets. In this paper, we develop a hierarchical clustering approach-a cluster tree to determine such cluster structure and ...
Multi-Task Multi-View Clustering
Multi-task clustering and multi-view clustering have severally found wide applications and received much attention in recent years. Nevertheless, there are many clustering problems that involve both multi-task clustering and multi-view clustering, i.e., ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
July 2024
63010 pages
Copyright © 2024.
Publisher
JMLR.org
Publication History
Published: 21 July 2024
Qualifiers
- Research-article
- Research
- Refereed limited
Acceptance Rates
Overall Acceptance Rate 140 of 548 submissions, 26%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025