Uncovering Hidden Block Structure for Clustering.
2019
We present a multistage procedure to cluster directed and undirected weighted graphs by finding the block structure of their adjacency matrices. A central part of the process is to scale the adjacency matrix into a doubly-stochastic form, which permits detection of the whole matrix block structure with minimal spectral information (theoretically a single pair of singular vectors suffices).
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
35
References
2
Citations
NaN
KQI