Multi-View Discrete Clustering: A Concise Model
Pages 15154 - 15170
Abstract
In most existing graph-based multi-view clustering methods, the eigen-decomposition of the graph Laplacian matrix followed by a post-processing step is a standard configuration to obtain the target discrete cluster indicator matrix. However, we can naturally realize that the results obtained by the two-stage process will deviate from that obtained by directly solving the primal clustering problem. In addition, it is essential to properly integrate the information from different views for the enhancement of the performance of multi-view clustering. To this end, we propose a concise model referred to as Multi-view Discrete Clustering (MDC), aiming at directly solving the primal problem of multi-view graph clustering. We automatically weigh the view-specific similarity matrix, and the discrete indicator matrix is directly obtained by performing clustering on the aggregated similarity matrix without any post-processing to best serve graph clustering. More importantly, our model does not introduce an additive, nor does it has any hyper-parameters to be tuned. An efficient optimization algorithm is designed to solve the resultant objective problem. Extensive experimental results on both synthetic and real benchmark datasets verify the superiority of the proposed model.
References
[1]
M. Vento, “A long trip in the charming world of graphs for pattern recognition,” Pattern Recognit., vol. 48, no. 2, pp. 291–301, 2015.
[2]
A. Saxena et al., “A review of clustering techniques and developments,” Neurocomputing, vol. 267, pp. 664–681, 2017.
[3]
K. Kameshwaran and K. Malarvizhi, “Survey on clustering techniques in data mining,” Int. J. Comput. Sci. Inf. Technol., vol. 5, no. 2, pp. 2272–2276, 2014.
[4]
L. Zhang, Q. Zhang, B. Du, J. You, and D. Tao, “Adaptive manifold regularized matrix factorization for data clustering,” in Proc. Int. Joint Conf. Artif. Intell., 2017, pp. 3399–3405.
[5]
M. T. Mills and N. G. Bourbakis, “Graph-based methods for natural language processing and understanding a survey and analysis,” IEEE Trans. Syst., Man, Cybern. Syst., vol. 44, no. 1, pp. 59–71, Jan. 2014.
[6]
V. Nastase, R. Mihalcea, and D. R. Radev, “A survey of graphs in natural language processing,” Natural Lang. Eng., vol. 21, no. 5, pp. 665–698, 2015.
[7]
T. Schultz and G. L. Kindlmann, “Open-box spectral clustering: Applications to medical image analysis,” IEEE Trans. Vis. Comput. Graph., vol. 19, no. 12, pp. 2100–2108, Dec. 2013.
[8]
H. Sharma, N. Zerbe, S. Lohmann, K. Kayser, O. Hellwich, and P. Hufnagl, “A review of graph-based methods for image analysis in digital histopathology,” Diagn. Pathol., vol. 1, no. 1, pp. 1–51, 2015.
[9]
Y. Yan, G. Liu, S. Wang, J. Zhang, and K. Zheng, “Graph-based clustering and ranking for diversified image search,” Multimedia Syst., vol. 23, no. 1, pp. 41–52, 2017.
[10]
X. Y. Stella and J. Shi, “Multiclass spectral clustering,” in Proc. Int. Conf. Comput. Vis., 2003, pp. 313–319.
[11]
Y. Han, L. Zhu, Z. Cheng, J. Li, and X. Liu, “Discrete optimal graph clustering,” IEEE Trans. Cybern., vol. 50, no. 4, pp. 1697–1710, Apr. 2020.
[12]
A. Kumar and H. Daumé, “A co-training approach for multi-view spectral clustering,” in Proc. 28th Int. Conf. Mach. Learn., 2011, pp. 393–400.
[13]
A. Kumar, P. Rai, and H. Daume, “Co-regularized multi-view spectral clustering,” in Proc. Adv. Neural Inf. Process. Syst., 2011, pp. 1413–1421.
[14]
F. Nie et al., “Parameter-free auto-weighted multiple graph learning: A framework for multiview clustering and semi-supervised classification,” in Proc. Int. Joint Conf. Artif. Intell., 2016, pp. 1881–1887.
[15]
Y. Liang, D. Huang, and C.-D. Wang, “Consistency meets inconsistency: A unified graph learning framework for multi-view clustering,” in Proc. IEEE Int. Conf. Data Mining, 2019, pp. 1204–1209.
[16]
P. Zhou, Y.-D. Shen, L. Du, F. Ye, and X. Li, “Incremental multi-view spectral clustering,” Knowl.-Based Syst., vol. 174, pp. 73–86, 2019.
[17]
A. Ng, M. Jordan, and Y. Weiss, “On spectral clustering: Analysis and an algorithm,” Adv. Neural Inf. Process. Syst., vol. 14, pp. 849–856, 2001.
[18]
F. Nie et al., “Self-weighted multiview clustering with multiple graphs,” in Proc. Int. Joint Conf. Artif. Intell., 2017, pp. 2564–2570.
[19]
F. Nie, G. Cai, J. Li, and X. Li, “Auto-weighted multi-view learning for image clustering and semi-supervised classification,” IEEE Trans. Image Process., vol. 27, no. 3, pp. 1501–1511, Mar. 2018.
[20]
R. Tarjan, “Depth-first search and linear graph algorithms,” SIAM J. Comput., vol. 1, no. 2, pp. 146–160, 1972.
[21]
K. Zhan, C. Zhang, J. Guan, and J. Wang, “Graph learning for multiview clustering,” IEEE Trans. Cybern., vol. 48, no. 10, pp. 2887–2895, Oct. 2018.
[22]
X. Zhu, S. Zhang, W. He, R. Hu, C. Lei, and P. Zhu, “One-step multi-view spectral clustering,” IEEE Trans. Knowl. Data Eng., vol. 31, no. 10, pp. 2022–2034, Oct. 2019.
[23]
H. Wang, Y. Yang, and B. Liu, “GMC: Graph-based multi-view clustering,” IEEE Trans. Knowl. Data Eng., vol. 32, no. 6, pp. 1116–1129, Jun. 2020.
[24]
L. Hagen and A. B. Kahng, “New spectral methods for ratio cut partitioning and clustering,” IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 11, no. 9, pp. 1074–1085, Sep. 1992.
[25]
J. Shi and J. Malik, “Normalized cuts and image segmentation,” in Proc. IEEE Comput. Soc. Conf. Comput. Vis. Pattern Recognit., 1997, pp. 731–737.
[26]
F. R. Chung and F. C. Graham, Spectral Graph Theory. Providence, RI, USA: American Mathematical Soc., 1997.
[27]
X. He and P. Niyogi, “Locality preserving projections,” Adv. Neural Inf. Process. Syst., vol. 16, no. 16, pp. 153–160, 2004.
[28]
X. He, D. Cai, and P. Niyogi, “Laplacian score for feature selection,” Adv. Neural Inf. Process. Syst., vol. 18, pp. 507–514, 2005.
[29]
F. Nie, X. Wang, M. I. Jordan, and H. Huang, “The constrained Laplacian rank algorithm for graph-based clustering,” in Proc. 30th AAAI Conf. Artif. Intell., 2016, pp. 1969–1976.
[30]
Z. Lin, R. Liu, and Z. Su, “Linearized alternating direction method with adaptive penalty for low-rank representation,” 2011,.
[31]
S. J. Wright, “Coordinate descent algorithms,” Math. Program., vol. 151, no. 1, pp. 3–34, 2015.
[32]
R. D. Monteiro and I. Adler, “Interior path following primal-dual algorithms. Part II: Convex quadratic programming,” Math. Program., vol. 44, no. 1, pp. 43–66, 1989.
[33]
M. J. Powell, “A method for nonlinear constraints in minimization problems,” Optimization, no. 5, pp. 1–6, pp. 283–298, 1969.
[34]
M. R. Hestenes, “Multiplier and gradient methods,” J. Optim. Theory Appl., vol. 4, no. 5, pp. 303–320, 1969.
[35]
D. P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods. New York, NY, USA: Academic Press, 2014.
[36]
J. Huang, F. Nie, and H. Huang, “A new simplex sparse learning model to measure data similarity for clustering,” in Proc. 24th Int. Joint Conf. Artif. Intell., 2015, pp. 3569–3575.
[37]
A. H. Sherman, “On Newton-iterative methods for the solution of systems of nonlinear equations,” SIAM J. Numer. Anal., vol. 15, no. 4, pp. 755–771, 1978.
[38]
C. Zhang, H. Fu, S. Liu, G. Liu, and X. Cao, “Low-rank tensor constrained multiview subspace clustering,” in Proc. IEEE Int. Conf. Comput. Vis., 2015, pp. 1582–1590.
[39]
D. Greene and P. Cunningham, “Producing accurate interpretable clusters from high-dimensional data,” in Proc. Eur. Conf. Princ. Data Mining Knowl. Discov., Springer, 2005, pp. 486–494.
[40]
C. Apté, F. Damerau, and S. M. Weiss, “Automated learning of decision rules for text categorization,” ACM Trans. Inf. Syst., vol. 12, no. 3, pp. 233–251, 1994.
[41]
L. Fei-Fei, R. Fergus, and P. Perona, “Learning generative visual models from few training examples: An incremental Bayesian approach tested on 101 object categories,” in Proc. Conf. Comput. Vis. Pattern Recognit. Workshop, 2004, pp. 178–178.
[42]
T.-S. Chua, J. Tang, R. Hong, H. Li, Z. Luo, and Y. Zheng, “NUS-WIDE: A real-world web image database from national University of Singapore,” in Proc. ACM Int. Conf. Image Video Retrieval, 2009, pp. 1–9.
[43]
A. Strehl and J. Ghosh, “Cluster ensembles—A knowledge reuse framework for combining multiple partitions,” J. Mach. Learn. Res., vol. 3, no. Dec, pp. 583–617, 2002.
[44]
Y. Zhao and G. Karypis, “Empirical and theoretical comparisons of selected criterion functions for document clustering,” Mach. Learn., vol. 55, no. 3, pp. 311–331, 2004.
[45]
H. W. Kuhn, “The Hungarian method for the assignment problem,” Nav. Res. Logistics Quart., vol. 2, no. 1/2, pp. 83–97, 1955.
[46]
Z. Zhang, L. Liu, F. Shen, H. T. Shen, and L. Shao, “Binary multi-view clustering,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 41, no. 7, pp. 1774–1782, Jul. 2019.
[47]
S. Huang, I. W. Tsang, Z. Xu, and J. Lv, “Measuring diversity in graph learning: A unified framework for structured multi-view clustering,” IEEE Trans. Knowl. Data Eng., vol. 34, no. 12, pp. 5869–5883, Dec. 2022.
[48]
C. Tang, Z. Li, J. Wang, X. Liu, W. Zhang, and E. Zhu, “Unified one-step multi-view spectral clustering,” IEEE Trans. Knowl. Data Eng., vol. 35, no. 6, pp. 6449–6460, Jun. 2023.
[49]
L. Van der Maaten and G. Hinton, “Visualizing data using t-SNE,” J. Mach. Learn. Res., vol. 9, no. 11, pp. 2579–2605, 2008.
[50]
Y. Zhao and E. Ayanoglu, “Gaussian kernel variance for an adaptive learning method on signals over graphs,” IEEE Trans. Signal Inf. Process. Netw., vol. 8, pp. 389–403, 2022.
[51]
Y. Takano et al., “Improving document similarity calculation using cosine-similarity graphs,” in Proc. Adv. Inf. Netw. Appl., Proc. 33rd Int. Conf. Adv. Inf. Netw. Appl., Springer, 2020, pp. 512–522.
Index Terms
- Multi-View Discrete Clustering: A Concise Model
Index terms have been assigned to the content through auto-classification.
Recommendations
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., ...
Multi-view clustering via spectral partitioning and local refinement
A new multi-view clustering algorithm is proposed.The proposed MVNC algorithm uses spectral partitioning and local refinement.MVNC is compared to state-of-the-art algorithms using three real-world datasets.MVNC significantly outperforms the other ...
Comment-based multi-view clustering of web 2.0 items
WWW '14: Proceedings of the 23rd international conference on World wide webClustering Web 2.0 items (i.e., web resources like videos, images) into semantic groups benefits many applications, such as organizing items, generating meaningful tags and improving web search. In this paper, we systematically investigate how user-...
Comments
Information & Contributors
Information
Published In
0162-8828 © 2023 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.
Publisher
IEEE Computer Society
United States
Publication History
Published: 27 September 2023
Qualifiers
- Research-article
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 22 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in