A fast kernel-based multilevel algorithm for graph clustering
- 21 August 2005
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 629-634
- https://doi.org/10.1145/1081870.1081948
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Kernel k-meansPublished by Association for Computing Machinery (ACM) ,2004
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular GraphsSIAM Journal on Scientific Computing, 1998
- Spectral K-way ratio-cut partitioning and clusteringIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994
- Lower Bounds for the Partitioning of GraphsIBM Journal of Research and Development, 1973