Skip to main content

Density Sensitive Based Spectral Clustering

  • Conference paper
  • First Online:
Computer and Information Sciences

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 62))

  • 890 Accesses

Abstract

The clustering effect by using spectral method depends heavily on the description of similarity between instances of the datasets. In this paper, we introduce a density sensitive distance measure which squeezes the distances in high density regions while widening them in low density regions. Experimental results show that compared with conventional spectral clustering algorithms, our proposed algorithm with density sensitive similarity measure can obtain desirable clusters with high performance

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

Access this chapter

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. D. Verma and M. Meil¸a, “A Comparison of Spectral Clustering Algorithms”, UW CSE. Technical report 03-05-01, (2003)

    Google Scholar 

  2. M. Meila, J. Shi, “A random walks view of spectral segmentation,” Proceedings of the 8th International Workshop on Artificial Intelligence and Statistics, (2001)

    Google Scholar 

  3. M. Meila, J. Shi, “Learning Segmentation by Random Walks,” Neural Information Processing Systems 13, (2001)

    Google Scholar 

  4. A. Y. Ng, M. Jardan, Y. Weiss, “On spectral clustering: analysis and an algorithm,” Neural Information Process- ing Systems 14, (2002)

    Google Scholar 

  5. WANG Ling, BO Liefeng, JIAO Licheng, “Density Sensitive Spectral Clustering,” ACTA ELECTRONICA SINICA, Vol. 35, No. 8, pp. 1577–1581, (2007)

    Google Scholar 

  6. M. Meila, “Comparing Clusterings - An Axiomatic View,” Proceedings of the 22nd International Conference on Machine Learning, (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peng Yang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media B.V.

About this paper

Cite this paper

Zhu, Q., Yang, P. (2011). Density Sensitive Based Spectral Clustering. In: Gelenbe, E., Lent, R., Sakellari, G., Sacan, A., Toroslu, H., Yazici, A. (eds) Computer and Information Sciences. Lecture Notes in Electrical Engineering, vol 62. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-9794-1_28

Download citation

  • DOI: https://doi.org/10.1007/978-90-481-9794-1_28

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-9793-4

  • Online ISBN: 978-90-481-9794-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics