Skip to main content

Advertisement

Springer Nature Link
Log in

A spectral clustering algorithm based on attribute fluctuation and density peaks clustering algorithm

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Spectral clustering (SC) has become a popular choice for data clustering by converting a dataset to a graph structure and then by identifying optimal subgraphs by graph partitioning to complete the clustering. However, k-means is taken at the clustering stage to randomly select the initial cluster centers, which leads to unstable performance. Notably, k-means needs to specify the number of clusters (prior knowledge). Second, SC calculates the similarity matrix using the linear Euclidean distance, losing part of the effective information. Third, real datasets usually contain redundant features, but traditional SC does not adequately address multi-attribute data. To solve these issues, we propose an SC algorithm based on the attribute fluctuation and density peaks clustering algorithm (AFDSC) to improve the clustering accuracy and effect. Furthermore, to verify the idea of the AFDSC algorithm, we extract the attribute fluctuation factor and propose a histogram clustering algorithm based on attribute fluctuation (AFHC) divorced from spectral clustering. Experimental results show that both the AFDSC algorithm and AFHC algorithm have achieved better performance on fifteen UCI datasets compared with other clustering algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Algorithm 1
Fig. 2
Algorithm 2
Fig. 3
Fig. 4

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Zhang Q, Zhu C, Yang L, Chen Z, Zhao L, Li P (2017) An incremental CFS algorithm for clustering large data in industrial internet of things. IEEE Trans Industr Inform 13:1193–1201

    Article  Google Scholar 

  2. Bodea CN, Dascalu MI, Lipai A (2012) Clustering of the web search results in educational recommender systems. Educational recommender systems and technologies: practices and challenges, pp 154–181

  3. Fabrizio C, Bo Friis N, Otto Anker N, Steven SH (2018) Application of data clustering to railway delay pattern recognition. J Adv Transp 2018:121

    Google Scholar 

  4. Zhang C, Zhu G, Chen M, Chen H, Wu C (2021) Image segmentation based on multiscale fast spectral clustering. Multimed Tools Appl 80:24969–24994. https://doi.org/10.1007/s11042-021-10831-1https://doi.org/10.1007/s11042-021-10831-1

    Article  Google Scholar 

  5. HLi H, He X, Tao D, Tang Y, Wang R (2018) Joint medical image fusion, denoising and enhancement via discriminative low-rank sparse dictionaries learning. Pattern Recogn 79:130–146

    Article  Google Scholar 

  6. Zhu Y, Ting K, Carman M (2016) Density-ratio based clustering for discovering clusters with varying densities. Pattern Recogn 60:983–997

    Article  MATH  Google Scholar 

  7. Zhu Y, Zhong Z, Cao W, Cheng D (2016) Graph feature selection for dementia diagnosis. Neurocomputing 195:19–22

    Article  Google Scholar 

  8. Zhu X, Zhang S, Li Y, Zhang J, Yang L, Fang Y (2019) Low-Rank Sparse subspace for spectral clustering. IEEE Trans Knowl Data Eng 31:1532–1543

    Article  Google Scholar 

  9. Cour T, Benezit F, Shi J (2015) 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’05), vol 2, pp 1124–1131

  10. Macqueen J (1967) In 5-th Berkeley symposium on mathematical statistics and probability, pp 281–297

  11. Chung F, Graham F (1997) Spectral graph theory, CBMS Regional conference series in mathematics

  12. Huang J, Nie F, Huang H (2013) Proceedings of the Twenty-Seventh AAAI conference on artificial intelligence, 431–437, AAAI press, Bellevue, Washington

  13. Li Z, Nie F, Chang X, Nie L, Zhang H, Yang Y (2018) Rank-constrained spectral clustering with flexible embedding. IEEE Trans Neural Netw Learn Syst 29:6073–6082

    Article  MathSciNet  Google Scholar 

  14. Mehrkanoon S, Alzate C, Mall R, Langone R, Suykens JAK (2015) Multiclass semisupervised learning based upon kernel spectral clustering. IEEE Trans Neural Netw Learn Syst 26:720–733

    Article  MathSciNet  Google Scholar 

  15. Yang Y, Ma Z, Yang Y, Nie F, Shen H (2017) Multitask spectral clustering by exploring intertask correlation. IEEE Trans Cybern 48:836–847

    Google Scholar 

  16. Panda R, Kuanar S, Chowdhury AS (2018) Nyström approximated temporally constrained multisimilarity spectral clustering approach for movie scene detection. IEEE Trans Cybern 48:836–847

    Article  Google Scholar 

  17. Tasdemir K (2013) 2013 IEEE International Geoscience and Remote Sensing Symposium - IGARSS, pp 3136–3139

  18. Tasdemir K, Yalcin B, Yildirim I (2015) Approximate spectral clustering with utilized similarity information using geodesic based hybrid distance measures. Pattern Recogn 48:1465– 1477

    Article  Google Scholar 

  19. Tyuryukanov I, Popov M, Mijden Mvd, Terzija V (2018) Discovering clusters in power networks from orthogonal structure of spectral embedding. IEEE Trans Power Syst 33:6441–6451

    Article  Google Scholar 

  20. Wang T, Lin H, Wang P (2017) Weighted-spectral clustering algorithm for detecting community structures in complex networks. Artif Intell Rev 47:463–483

    Article  Google Scholar 

  21. Kohonen T (2013) Essentials of the self-organizing map. Neural Netw 37:52–65

    Article  Google Scholar 

  22. Arthur D, Vassilvitskii S (2007) In proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp 1027–1035 Stanford

  23. Pang Y, Wang S, Yuan Y (2014) Learning Regularized LDA By Clustering. IEEE Trans Neural Netw Learn Syst 25:2191–2201

    Article  Google Scholar 

  24. Wang L, Ding S, Wang Y, Ding LA (2021) Robust spectral clustering algorithm based on grid-partition and decision-graph. Int J Mach Learn Cyber 12:1243–1254

    Article  Google Scholar 

  25. Zhu J, Jang-Jaccard J, Liu T, Zhou J (2021) Joint Spectral Clustering based on Optimal Graph and Feature Selection. Neural Process Lett 53:257–273

    Article  Google Scholar 

  26. Liu T, Martin G (2020) Joint feature selection with dynamic spectral clustering. Neural Process Lett 52:1745–1763

    Article  Google Scholar 

  27. Duan L, Ma S, Aggarwal C, Sathe S (2021) Improving spectral clustering with deep embedding, cluster estimation and metric learning. Knowl Inf Syst 63:675–694

    Article  Google Scholar 

  28. Tong T, Zhu X, Du T (2019) Connected graph decomposition for spectral clustering. Multimed Tools Appl 78:33247–33259

    Article  Google Scholar 

  29. Yang L, Liu X, Nie F, Liu M (2019) Large-Scale Spectral clustering based on representative points, Mathematical Problems in Engineering, 2019

  30. Zhang H, Cao L (2014) A spectral clustering based ensemble pruning approach. Neurocomputing 139:289–297

    Article  Google Scholar 

  31. Hu Z, Nie F, Wang R, Li X (2020) Multi-view spectral clustering via integrating nonnegative embedding and spectral embedding. Infor Fusion 55:251–259

    Article  Google Scholar 

  32. Allab K, Labiod L, Nadif M (2018) Simultaneous spectral data embedding and clustering. IEEE Trans Neural Netw Learn Syst 12:6396–6401

    Article  MathSciNet  Google Scholar 

  33. Tautenhain C, Nascimento M (2020) An ensemble based on a bi-objective evolutionary spectral algorithm for graph clustering. Expert Syst Appl 141:112911

    Article  Google Scholar 

  34. Wang Y, Duan X, Liu X, Wang C, Li Z (2018) A spectral clustering method with semantic interpretation based on axiomatic fuzzy set theory. Appl Soft Comput 64:59–74

    Article  Google Scholar 

  35. Rodriguez A, Laio A (2014) Clustering by fast search and find of density peaks. Science 344:1492–1496

    Article  Google Scholar 

  36. Ding S, Du M, Sun T, Xu X, Xue Y (2017) An entropy-based density peaks clustering algorithm for mixed type data employing fuzzy neighborhood. Knowl Based Syst 133:294–313

    Article  Google Scholar 

  37. Xie J, Gao H, Xie W, Liu X, Grant P (2016) Robust clustering by detecting density peaks and assigning points based on fuzzy weighted K-nearest neighbors. Inf Sci 354:19–40

    Article  Google Scholar 

  38. Liu R, Wang H, Yu X (2018) Shared-nearest-neighbor-based clustering by fast search and find of density peaks. Inf Sci 450:200–226

    Article  MathSciNet  Google Scholar 

  39. Xu X, Ding S, Shi Z (2018) An improved density peaks clustering algorithm with fast finding cluster centers. Knowl Based Syst 158:65–74

    Article  Google Scholar 

  40. Sra S (2016) Positive definite matrices and the S-divergence. Proc Am Math Soc 144:2787–2797

    Article  MathSciNet  MATH  Google Scholar 

  41. Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888–905

    Article  Google Scholar 

  42. Zhu X, Gan J Lu G, Li J, Zhang S (2020) Spectral clustering via half-quadratic optimization. World Wide Web 23:1969–1988. https://doi.org/10.1007/s11280-019-00731-8

    Article  Google Scholar 

  43. Liu G, Lin Z, Yan S, Ju S, Yu Y, Ma Y (2013) Robust recovery of subspace structures by low-rank representation. IEEE Trans Pattern Anal Mach Intell 35(1):171

    Article  Google Scholar 

  44. Zhu X, Zhang S, Rongyao H, Zhu Y, Song J (2018) Local and global structure preservation for robust unsupervised spectral feature selection. IEEE Trans Knowl Data Eng 30(3):517–529

    Article  Google Scholar 

  45. Zhu X, Zhang S, Li Y, Zhang J, Yang L, Fang Y (2019) Low-rank sparse subspace for spectral clustering. IEEE Trans Knowl Data Eng 31(8):1532–1543. https://doi.org/10.1109/TKDE.2018.2858782https://doi.org/10.1109/TKDE.2018.2858782

    Article  Google Scholar 

  46. Peng X, Feng J, Xiao S, Lu J, Zhang Y, Shuicheng Y (2017) Deep sparse subspace clustering Computer vision and pattern recognition. arXiv:1709.08374

  47. Hu R, Zhu X, Cheng D, He W, Yan Y, Song J, Zhang S (2017) Graph self-representation method for unsupervised feature selection. Neuro comput 220:130–137

    Google Scholar 

  48. Elhamifar E, Vidal R (2013) Sparse subspace clustering: Algorithm, theory, and applications. IEEE Trans Pattern Anal Mach Intell 35(11):2765–2781

    Article  Google Scholar 

Download references

Acknowledgment

This research was supported by the National Natural Science Foundation of China under Grant No. 61603083, the Fundamental Research Funds of the Central Universities under Grant No. N162304009, the Major Project of Science and Technology Research of Hebei University under Grant No. ZD2017303, and the open research fund of State Key Laboratory of Management and Control for Complex Systems, Institute of Automation, Chinese Academy of Sciences under grant No. 20180105.

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Northeastern University, Shenyang, 110169, China

    Xin Song, Shuhua Li, Ziqiang Qi & Jianlin Zhu

  2. School of Computer and Communication Engineering, Northeastern University at Qinhuangdao, Qinhuangdao, 066004, China

    Xin Song

Authors
  1. Xin Song
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Shuhua Li
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Ziqiang Qi
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Jianlin Zhu
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Xin Song.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Song, X., Li, S., Qi, Z. et al. A spectral clustering algorithm based on attribute fluctuation and density peaks clustering algorithm. Appl Intell 53, 10520–10534 (2023). https://doi.org/10.1007/s10489-022-04058-2

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-022-04058-2

Keywords