Skip to main navigation
Skip to search
Skip to main content
University of Edinburgh Research Explorer Home
Help & FAQ
Home
Research output
Profiles
Research units
Projects
Datasets
Prizes
Activities
Press/Media
Equipment
Search by expertise, name or affiliation
Partitioning Well-Clustered Graphs: Spectral Clustering Works!
Richard Peng,
He Sun
, Luca Zanetti
Data Science and Artificial Intelligence
School of Informatics
Laboratory for Foundations of Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Profiles
(1)
Fingerprint
Dive into the research topics of 'Partitioning Well-Clustered Graphs: Spectral Clustering Works!'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Partitioning
100%
Graph
100%
Clustering
40%
Laplacian Matrix
20%
Stochastic Model
20%
Good Approximation
20%
Algorithm
20%
Data Structure
20%
Linear Time
20%
Vertex of a Graph
20%
Dimensional Space
20%
Eigenvector
20%
Partition
20%
Approximates
20%
Nearest Neighbor
20%
Wide Class
20%
Points
20%
Computer Science
Spectral Clustering
100%
Partitioning
100%
Stochastic Model
20%
Data Structure
20%
Application
20%
Embedding
20%
Clustering
20%
Good Approximation
20%
Classes
20%
Computing
20%
Mean Algorithm
20%
Eigenvector
20%
Laplacian Matrix
20%
Algorithms
20%
Lower Dimensional Space
20%