Higher-Order Spectral Clustering of Directed Graphs.
Steinar LaenenHe SunPublished in: NeurIPS (2020)
Keyphrases
- spectral clustering
- directed graph
- higher order
- pairwise
- random walk
- high order
- clustering method
- data clustering
- markov random field
- graph structure
- clustering algorithm
- eigendecomposition
- evolutionary clustering
- directed acyclic graph
- affinity matrix
- k means
- image segmentation
- graph partitioning
- graph laplacian
- alternative clusterings
- unsupervised learning
- constrained spectral clustering
- spectral methods
- normalized cut
- undirected graph
- social network analysis
- graph structures
- social networks
- strongly connected
- disjoint paths
- similarity measure
- semi supervised