333 search results - page 32 / 67 » B-Matching for Spectral Clustering |
NIPS
2003
13 years 9 months ago
2003
Significant progress in clustering has been achieved by algorithms that are based on pairwise affinities between the datapoints. In particular, spectral clustering methods have ...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
d Abstract] Christian Borgs Jennifer Chayes Mohammad Mahdian Amin Saberi We propose to use the community structure of Usenet for organizing and retrieving the information stored i...
ICCV
2005
IEEE
14 years 1 months ago
2005
IEEE
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
ICIP
2007
IEEE
14 years 9 months ago
2007
IEEE
A key goal of far-field activity analysis is to learn the usual pattern of activity in a scene and to detect statistically anomalous behavior. We propose a method for unsupervised...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...