An improved Nyström spectral graph clustering using k-core decomposition as a sampling strategy for large networks
Clustering on graphs (networks) is becoming intractable due to increasing sizes. Nyström spectral graph clustering (NSC) is a popular method to circumvent the problem. However, NSC currently faces two issues: (1) how to efficiently obtain representative samples for large networks; (2) the NSC is irr...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2022-06-01
|
| Series: | Journal of King Saud University: Computer and Information Sciences |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S1319157822001379 |