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.
Review the options below to login to check your access.
Log in with your Cambridge Aspire website account to check access.
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.