1105 search results - page 71 / 221 » Approximate Spectral Clustering. |
138
click to vote
ICDM
2010
IEEE
15 years 13 days ago
2010
IEEE
Abstract--Most well-known discriminative clustering models, such as spectral clustering (SC) and maximum margin clustering (MMC), are non-Bayesian. Moreover, they merely considered...
117
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
146
click to vote
JCSS
2002
15 years 2 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
150
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
159
click to vote
CG
2006
Springer
15 years 3 months ago
2006
Springer
s: clustering, denoising, sharp feature, shape abstraction, reverse engineering In this paper we describe a hierarchical face clustering algorithm for triangle meshes based on fit...