Journal
KNOWLEDGE-BASED SYSTEMS
Volume 28, Issue -, Pages 27-37Publisher
ELSEVIER
DOI: 10.1016/j.knosys.2011.11.010
Keywords
Spectral clustering; Discriminant cut; Normalized cut; Graph cut; Regularization; k-means
Categories
Funding
- National Science Foundation of China [60675007, 60975083, U0835005]
- National Natural Science Foundation in China [60675007, 60975083, U0835005]
Ask authors/readers for more resources
Recently, many k-way spectral clustering algorithms have been proposed, satisfying one or both of the following requirements: between-cluster similarities are minimized and within-cluster similarities are maximized. In this paper, a novel graph-based spectral clustering algorithm called discriminant cut (Dcut) is proposed, which first builds the affinity matrix of a weighted graph and normalizes it with the corresponding regularized Laplacian matrix, then partitions the vertices into k parts. Dcut has several advantages. First, it is derived from graph partition and has a straightforward geometrical explanation. Second, it emphasizes the above requirements simultaneously. Besides, it is computationally feasible because the NP-hard intractable graph cut problem can be relaxed into a mild eigenvalue decomposition problem. Toy-data and real-data experimental results show that Dcut is pronounced comparing with other spectral clustering methods. (C) 2011 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available