Variational perspective on local graph clustering
© 2017, Springer-Verlag GmbH Germany, part of Springer Nature and Mathematical Optimization Society. Modern graph clustering applications require the analysis of large graphs and this can be computationally expensive. In this regard, local spectral graph clustering methods aim to identify well-conne...
Main Authors: | Fountoulakis, Kimon, Roosta-Khorasani, Farbod, Shun, Julian, Cheng, Xiang, Mahoney, Michael W |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
Springer Nature
2021
|
Online Access: | https://hdl.handle.net/1721.1/134838 |
Similar Items
-
Parallel Index-Based Structural Graph Clustering and Its Approximation
by: Tseng, Tom, et al.
Published: (2022) -
Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering
by: Tseng, Tom, et al.
Published: (2022) -
Clustering via adaptive and locality-constrained graph learning and unsupervised ELM
by: Zeng, Yijie, et al.
Published: (2022) -
A model-based approach to attributed graph clustering
by: Xu, Zhiqiang, et al.
Published: (2013) -
Cluster analysis on dynamic graphs
by: Er, Jia Chin
Published: (2021)