Skip to main content
Erschienen in: Soft Computing 3/2020

25.05.2019 | Methodologies and Application

Active constraint spectral clustering based on Hessian matrix

verfasst von: Xiaoyu Wang, Shifei Ding, Weikuan Jia

Erschienen in: Soft Computing | Ausgabe 3/2020

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Alaa S, Florent K, Lenka Z (2014) Spectral density of the non-backtracking operator on random graphs. EPL 107(5):401–408 Alaa S, Florent K, Lenka Z (2014) Spectral density of the non-backtracking operator on random graphs. EPL 107(5):401–408
Zurück zum Zitat 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–439CrossRef 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–439CrossRef
Zurück zum Zitat 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 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
Zurück zum Zitat Celikyilmaz A (2009) Soft-link spectral clustering for infor-mation extraction. Proc IEEE Int Conf Commun 434–441 Celikyilmaz A (2009) Soft-link spectral clustering for infor-mation extraction. Proc IEEE Int Conf Commun 434–441
Zurück zum Zitat 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–1722CrossRef 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–1722CrossRef
Zurück zum Zitat 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–302CrossRef 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–302CrossRef
Zurück zum Zitat Deng W, Zhao H, Zou L et al (2017b) A novel collaborative optimization algorithm in solving complex optimization problems. Soft Comput 21(15):4387–4398CrossRef Deng W, Zhao H, Zou L et al (2017b) A novel collaborative optimization algorithm in solving complex optimization problems. Soft Comput 21(15):4387–4398CrossRef
Zurück zum Zitat 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–35056CrossRef 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–35056CrossRef
Zurück zum Zitat 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–2462CrossRef 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–2462CrossRef
Zurück zum Zitat Dhanjal C, Gaudel R, Clemencon S (2014) Efficient eigen-updating for spectral graph clustering. Neurocomputing 131(1):440–452CrossRef Dhanjal C, Gaudel R, Clemencon S (2014) Efficient eigen-updating for spectral graph clustering. Neurocomputing 131(1):440–452CrossRef
Zurück zum Zitat 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–228MathSciNetCrossRef 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–228MathSciNetCrossRef
Zurück zum Zitat Jia H, Ding S, Du M (2015) Self-tuning p-spectral clustering based on shared nearest neighbors. Cognit Comput 7(5):622–632CrossRef Jia H, Ding S, Du M (2015) Self-tuning p-spectral clustering based on shared nearest neighbors. Cognit Comput 7(5):622–632CrossRef
Zurück zum Zitat Joris MM, Hilbert JK et al (2004) Validity estimates for loopy belief propagation on binary real-world networks. NIPS 17(210):945–952 Joris MM, Hilbert JK et al (2004) Validity estimates for loopy belief propagation on binary real-world networks. NIPS 17(210):945–952
Zurück zum Zitat 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 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
Zurück zum Zitat 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–20940MathSciNetCrossRef 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–20940MathSciNetCrossRef
Zurück zum Zitat Li Z, Liu J, Tang X (2009) Constrained clustering via spectral regularization. IEEE Conf Comput Vis Pattern Recognit 2009:421–428 Li Z, Liu J, Tang X (2009) Constrained clustering via spectral regularization. IEEE Conf Comput Vis Pattern Recognit 2009:421–428
Zurück zum Zitat Lu Z, Leen TK (2005) Semi-supervised learning with penalized probabilistic clustering. Adv Neural Inf Process Syst 849–856 Lu Z, Leen TK (2005) Semi-supervised learning with penalized probabilistic clustering. Adv Neural Inf Process Syst 849–856
Zurück zum Zitat 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–244CrossRef 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–244CrossRef
Zurück zum Zitat 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–1138CrossRef 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–1138CrossRef
Zurück zum Zitat Rangapuram SS, Hein M (2012) Constrained 1-Spectral clustering. In: The 15th international conference on artificial intelligence and statistics Rangapuram SS, Hein M (2012) Constrained 1-Spectral clustering. In: The 15th international conference on artificial intelligence and statistics
Zurück zum Zitat 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–38CrossRef 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–38CrossRef
Zurück zum Zitat Rogers T, Castillo IP, Kühn R (2008) Cavity approach to the spectral density of sparse symmetric random matrices. Phys Rev E 78(3):031116MathSciNetCrossRef Rogers T, Castillo IP, Kühn R (2008) Cavity approach to the spectral density of sparse symmetric random matrices. Phys Rev E 78(3):031116MathSciNetCrossRef
Zurück zum Zitat Saade A, Krzakala F (2014) Spectral clustering of graphs with the Bethe Hessian. Int Conf Neural Inf Process Syst 406–414 Saade A, Krzakala F (2014) Spectral clustering of graphs with the Bethe Hessian. Int Conf Neural Inf Process Syst 406–414
Zurück zum Zitat Shi JB, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888–905CrossRef Shi JB, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888–905CrossRef
Zurück zum Zitat Sun J, Liu J, Zhao L (2008) Clustering algorithms research. Ruan Jian Xue Bao/J Softw 19(19):48–61MATH Sun J, Liu J, Zhao L (2008) Clustering algorithms research. Ruan Jian Xue Bao/J Softw 19(19):48–61MATH
Zurück zum Zitat 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) 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)
Zurück zum Zitat Wagstaff K, Cardie C (2000) Clustering with instance-level constraints. AAAI/IAAI 1097:577–584 Wagstaff K, Cardie C (2000) Clustering with instance-level constraints. AAAI/IAAI 1097:577–584
Zurück zum Zitat Wainwright MJ, Jordan MI (2008) Graphical models, exponential families, and variational inference. Found Trends Mach Learn 1(1–2):1–305CrossRef Wainwright MJ, Jordan MI (2008) Graphical models, exponential families, and variational inference. Found Trends Mach Learn 1(1–2):1–305CrossRef
Zurück zum Zitat 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, Davidson I (2010) Flexible constrained spectral clustering. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, 563–572
Zurück zum Zitat Wang X, Qian B, Davidson I (2014) On constrained spectral clustering and its applications. Data Min Knowl Discov 28(1):1–30MathSciNetCrossRef Wang X, Qian B, Davidson I (2014) On constrained spectral clustering and its applications. Data Min Knowl Discov 28(1):1–30MathSciNetCrossRef
Zurück zum Zitat Xiong C, Johnson DM, Corso JJ (2016) Active clustering with model-based uncertainty reduction. IEEE Trans Pattern Anal Mach Intell 39(1):5–17CrossRef Xiong C, Johnson DM, Corso JJ (2016) Active clustering with model-based uncertainty reduction. IEEE Trans Pattern Anal Mach Intell 39(1):5–17CrossRef
Zurück zum Zitat Zhang X, You Q (2011) An improved spectral clustering algorithm based on random walk. Front Comput Sci China 5(3):268–278MathSciNetCrossRef Zhang X, You Q (2011) An improved spectral clustering algorithm based on random walk. Front Comput Sci China 5(3):268–278MathSciNetCrossRef
Zurück zum Zitat Zhao H et al (2016) A new feature extraction method based on EEMD and multi-scale fuzzy entropy for motor bearing. Entropy 19(1):14CrossRef Zhao H et al (2016) A new feature extraction method based on EEMD and multi-scale fuzzy entropy for motor bearing. Entropy 19(1):14CrossRef
Zurück zum Zitat 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):682CrossRef 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):682CrossRef
Metadaten
Titel
Active constraint spectral clustering based on Hessian matrix
verfasst von
Xiaoyu Wang
Shifei Ding
Weikuan Jia
Publikationsdatum
25.05.2019
Verlag
Springer Berlin Heidelberg
Erschienen in
Soft Computing / Ausgabe 3/2020
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-019-04069-1

Weitere Artikel der Ausgabe 3/2020

Soft Computing 3/2020 Zur Ausgabe

Premium Partner