333 search results - page 9 / 67 » B-Matching for Spectral Clustering |
ECML
2006
Springer
13 years 9 months ago
2006
Springer
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 maxi...
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
PR
2008
13 years 7 months ago
2008
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with ...
PAKDD
2011
ACM
12 years 10 months ago
2011
ACM
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
EUSFLAT
2009
13 years 5 months ago
2009
-- An approach to estimate the number of rules by spectral analysis of the training dataset has been recently proposed [1]. This work presents an analysis of such a method in high ...