Abstract
Applying the pairwise constraint algorithm to spectral clustering has become a hot topic in data mining research in recent years. In this paper, a clustering algorithm is proposed, called an active constraint spectral clustering based on Hessian matrix (ACSCHM); this algorithm not only use Hessian matrix instead of Laplacian matrix to free the parameter but also use an active query function to dynamically select constraint pairs and use these constraints to tune and optimize data points. In this paper, we used active query strategy to replace the previous random query strategy, which overcame the instability of the clustering results brought by the random query and enhanced the robustness of the algorithm. The unique parameter in the Hessian matrix was obtained by the spectral radius of the matrix, and the parameter selection problem in the original spectral clustering algorithm was also solved. Experiments on multiple UCI data sets can prove the effectiveness of this algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alaa S, Florent K, Lenka Z (2014) Spectral density of the non-backtracking operator on random graphs. EPL 107(5):401–408
Alok AK, Saha S, Ekbal A (2017) Semi-supervised clustering for gene-expression data in multiobjective optimization framework. Int J Mach Learn Cybern 8(2):421–439
Basu S, Bilenko M, Mooney R (2004) A probabilistic framework for semi-supervised clustering. In: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, 59–68
Celikyilmaz A (2009) Soft-link spectral clustering for infor-mation extraction. Proc IEEE Int Conf Commun 434–441
Deng W, Chen R, He B et al (2012) A novel two-stage hybrid swarm intelligence optimization algorithm and application. Soft Computing 16(10):1707–1722
Deng W, Zhao H, Yang X et al (2017a) Study on an improved adaptive PSO algorithm for solving multi-objective gate assignment. Applied Soft Computing 59:288–302
Deng W, Zhao H, Zou L et al (2017b) A novel collaborative optimization algorithm in solving complex optimization problems. Soft Comput 21(15):4387–4398
Deng W, Zhang S, Zhao H et al (2018) A novel fault diagnosis method based on integrating empirical wavelet transform and fuzzy entropy for motor bearing. IEEE Access 6:35042–35056
Deng W, Yao R, Zhao H et al (2019) A novel intelligent diagnosis method using optimal LS-SVM with improved PSO algorithm. Soft Comput 23(7):2445–2462
Dhanjal C, Gaudel R, Clemencon S (2014) Efficient eigen-updating for spectral graph clustering. Neurocomputing 131(1):440–452
Ding S, Jia H, Du M et al (2018) A semi-supervised approximate spectral clustering algorithm based on HMRF model. Inform Sci 429(1):215–228
Jia H, Ding S, Du M (2015) Self-tuning p-spectral clustering based on shared nearest neighbors. Cognit Comput 7(5):622–632
Joris MM, Hilbert JK et al (2004) Validity estimates for loopy belief propagation on binary real-world networks. NIPS 17(210):945–952
Klein D, Kamvar SD, Manning CD (2002) From Instance-level Constraints to apace-level constraints: making the most of prior knowledge in data clustering. In: Proceedings of the nineteenth international conference on machine learning, 307–314
Krzakala F, Moore C, Mossel E, Neeman J, Sly A, Zdeborová L, Zhang P (2013) Spectral redemption in clustering sparse networks. Proc Natl Acad Sci 110(52):20935–20940
Li Z, Liu J, Tang X (2009) Constrained clustering via spectral regularization. IEEE Conf Comput Vis Pattern Recognit 2009:421–428
Lu Z, Leen TK (2005) Semi-supervised learning with penalized probabilistic clustering. Adv Neural Inf Process Syst 849–856
Masud MM, Woolam C, Gao J et al (2012) Facing the reality of data stream classification: coping with scarcity of labeled data. Knowl Inf Syst 33(1):213–244
Qian P, Jiang Y, Wang S et al (2017) Affinity and penalty jointly constrained spectral clustering with all-compatibility, flexibility, and robustness. IEEE Trans Neural Netw Learn Syst 28(5):1123–1138
Rangapuram SS, Hein M (2012) Constrained 1-Spectral clustering. In: The 15th international conference on artificial intelligence and statistics
Ricci-Tersenghi F (2012) The Bethe approximation for solving the inverse Ising problem: a comparison with other inference methods. J Stat Mech: Theory Exp 2012(8):15–38
Rogers T, Castillo IP, Kühn R (2008) Cavity approach to the spectral density of sparse symmetric random matrices. Phys Rev E 78(3):031116
Saade A, Krzakala F (2014) Spectral clustering of graphs with the Bethe Hessian. Int Conf Neural Inf Process Syst 406–414
Shi JB, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888–905
Sun J, Liu J, Zhao L (2008) Clustering algorithms research. Ruan Jian Xue Bao/J Softw 19(19):48–61
Voiron N, Benoit A, Lambert P et al. (2016) Deep learning vs spectral clustering into an active clustering with pairwise constraints propagation. In: 2016 14th international workshop on content-based multimedia indexing (CBMI)
Wagstaff K, Cardie C (2000) Clustering with instance-level constraints. AAAI/IAAI 1097:577–584
Wainwright MJ, Jordan MI (2008) Graphical models, exponential families, and variational inference. Found Trends Mach Learn 1(1–2):1–305
Wang X, Davidson I (2010) Flexible constrained spectral clustering. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, 563–572
Wang X, Qian B, Davidson I (2014) On constrained spectral clustering and its applications. Data Min Knowl Discov 28(1):1–30
Xiong C, Johnson DM, Corso JJ (2016) Active clustering with model-based uncertainty reduction. IEEE Trans Pattern Anal Mach Intell 39(1):5–17
Zhang X, You Q (2011) An improved spectral clustering algorithm based on random walk. Front Comput Sci China 5(3):268–278
Zhao H et al (2016) A new feature extraction method based on EEMD and multi-scale fuzzy entropy for motor bearing. Entropy 19(1):14
Zhao H, Yao R et al (2018) Study on a novel fault damage degree identification method using high-order differential mathematical morphology gradient spectrum entropy. Entropy 20(9):682
Acknowledgements
This work is supported by the National Natural Science Foundation of China (Nos. 61672522, 61379101).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
Shifei Ding, Hongmei Liao and Yu Xue declare that they have no conflict of interest.
Informed consent
All procedures followed were in accordance with the ethical standards of the responsible committee on human experimentation (institutional and national) and with the Helsinki Declaration of 1975, as revised in 2008 (5). Additional informed consent was obtained from all patients for which identifying information is included in this article.
Human and animal rights
This article does not contain any studies with human or animal subjects performed by the any of the authors.
Additional information
Communicated by V. Loia.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Wang, X., Ding, S. & Jia, W. Active constraint spectral clustering based on Hessian matrix. Soft Comput 24, 2381–2390 (2020). https://doi.org/10.1007/s00500-019-04069-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-019-04069-1