Skip to main content Accessibility help
Internet Explorer 11 is being discontinued by Microsoft in August 2021. If you have difficulties viewing the site on Internet Explorer 11 we recommend using a different browser such as Microsoft Edge, Google Chrome, Apple Safari or Mozilla Firefox.

Chapter Thirteen: Graph Partitioning: III. Spectral Clustering

Chapter Thirteen: Graph Partitioning: III. Spectral Clustering

pp. 346-361

Authors

, Temple University, Philadelphia
  • Add bookmark
  • Cite
  • Share

Summary

The previous two chapters have focused on the problem of graph partitioning, which has seen enormous interest and research work in recent years. We continue that aspect of network analysis by introducing the notion of spectral clustering. The main tool of this chapter is the graph Laplacian, which can be unnormalized or normalized. Also discussed is a regularized version of the adjacency matrix.

About the book

Access options

Review the options below to login to check your access.

Purchase options

eTextbook
US$79.00
Hardback
US$79.00

Have an access code?

To redeem an access code, please log in with your personal login.

If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.

Also available to purchase from these educational ebook suppliers