2600 search results - page 81 / 520 » Clustering with or without the Approximation |
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
Abstract We develop a distance metric for clustering and classification algorithms which is invariant to affine transformations and includes priors on the transformation parameters...
ICTAI
2007
IEEE
15 years 4 months ago
2007
IEEE
Many real datasets have uncertain categorical attribute values that are only approximately measured or imputed. Uncertainty in categorical data is commonplace in many applications...
PAMI
2011
14 years 4 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
While there is a very long tradition of approximating a data array by projecting row or column vectors into a lower dimensional subspace the direct approximation of a data matrix ...
ESA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...