78 search results - page 1 / 16 » Subquadratic Approximation Algorithms for Clustering Problem... |
STOC
1999
ACM
13 years 9 months ago
1999
ACM
MICAI
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
WIRN
2005
Springer
13 years 10 months ago
2005
Springer
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
: Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerate...