Title: Graph Partitioning: III. Spectral Clustering
Abstract: 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.
Publication Year: 2023
Publication Date: 2023-01-05
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot