5046 search results - page 369 / 1010 » Non-redundant data clustering |
220
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
254
click to vote
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
We propose a novel framework for constrained spectral
clustering with pairwise constraints which specify whether
two objects belong to the same cluster or not. Unlike previous
m...
186
Voted
CVPR
2003
IEEE
16 years 9 months ago
2003
IEEE
We introduce two appearance-based methods for clustering a set of images of 3-D objects, acquired under varying illumination conditions, into disjoint subsets corresponding to ind...
167
Voted
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
—In graph-based learning models, entities are often represented as vertices in an undirected graph with weighted edges describing the relationships between entities. In many real...
181
Voted
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...