Weighted Graph Cuts without Eigenvectors A Multilevel Approach
Why is this work in the frame?
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
No Canadian affiliation. An affiliation-only frame — the usual design — would never have seen this work. It is one of the works that make the case for inverting the frame.
Abstract
A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods. In this paper, we discuss an equivalence between the objective functions used in these seemingly different methods--in particular, a general weighted kernel k-means objective is mathematically equivalent to a weighted graph clustering objective. We exploit this equivalence to develop a fast, high-quality multilevel algorithm that directly optimizes various weighted graph clustering objectives, such as the popular ratio cut, normalized cut, and ratio association criteria. This eliminates the need for any eigenvector computation for graph clustering problems, which can be prohibitive for very large graphs. Previous multilevel graph partitioning methods, such as Metis, have suffered from the restriction of equal-sized clusters; our multilevel algorithm removes this restriction by using kernel k-means to optimize weighted graph cuts. Experimental results show that our multilevel algorithm outperforms a state-of-the-art spectral clustering algorithm in terms of speed, memory usage, and quality. We demonstrate that our algorithm is applicable to large-scale clustering tasks such as image segmentation, social network analysis and gene network analysis.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
The record
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Topic
- Complex Network Analysis Techniques
- Field
- Physics and Astronomy
- Canadian institutions
- —
- Funders
- National Science Foundation
- Keywords
- Cluster analysisCorrelation clusteringSpectral clusteringRand indexComputer sciencePattern recognition (psychology)Kernel (algebra)Hierarchical clusteringCanopy clustering algorithmClustering coefficientGraph partitionComputationCURE data clustering algorithmGraphAlgorithmMathematicsArtificial intelligenceTheoretical computer scienceCombinatorics
- Has abstract in OpenAlex
- yes