B-Matching for Spectral Clustering

@inproceedings{Jebara2006BMatchingFS,
  title={B-Matching for Spectral Clustering},
  author={Tony Jebara and Vlad Shchogolev},
  booktitle={ECML},
  year={2006}
}
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… CONTINUE READING
Highly Cited
This paper has 33 citations. REVIEW CITATIONS
25 Citations
11 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 25 extracted citations

Similar Papers

Loading similar papers…