B-Matching for Spectral Clustering
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maximum weight matching and is solvable in polynomial time. Instead of a permutation matrix, it produces a binary matrix with rows and columns summing to a positive integer b. The b-matching procedure prunes graph edges such that the in-degree and out-degree of each node is b, producing a more balanced variant of k-nearest-neighbor. The combinatorial algorithm optimally solves for the maximum weight subgraph and makes subsequent spectral clustering more stable and accurate. Experiments on standard datasets, visualizations, and video data support the use of b-matching to prune graphs prior to spectral clustering.
KeywordsVideo Sequence Weighted Graph Spectral Cluster Kernel Parameter Binary Cluster
- 1.Chung, F.: Spectral Graph Theory. American Mathematical Society’s CBMS Regional Conference Series in Mathematics, vol. 92 (1997)Google Scholar
- 2.Edmonds, J.: Paths, trees and flowers. Canadian Journal of Mathematics 17 (1965)Google Scholar
- 4.Gabow, H.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: STOC 1983: Proceedings of the fifteenth annual ACM symposium on theory of computing, pp. 448–456 (1983)Google Scholar
- 6.Ng., A., Jordan, M., Weiss, Y.: On spectral clustering: Analysis and an algorithm. Neural Information Processing Systems 14 (2001)Google Scholar