Sciweavers

5595 search results - page 61 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
SODA
2001
ACM
147views Algorithms» more  SODA 2001»
15 years 6 months ago
Sublinear time approximate clustering
Clustering is of central importance in a number of disciplines including Machine Learning, Statistics, and Data Mining. This paper has two foci: 1 It describes how existing algori...
Nina Mishra, Daniel Oblinger, Leonard Pitt
CORR
2010
Springer
219views Education» more  CORR 2010»
15 years 4 months ago
Clustering high dimensional data using subspace and projected clustering algorithms
: Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerate...
Rahmat Widia Sembiring, Jasni Mohamad Zain, Abdull...
111
Voted
APPROX
2000
Springer
84views Algorithms» more  APPROX 2000»
15 years 9 months ago
On the relative complexity of approximate counting problems
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. ...
ISAAC
2010
Springer
265views Algorithms» more  ISAAC 2010»
15 years 2 months ago
On the Approximability of the Maximum Interval Constrained Coloring Problem
Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, ...
FOCS
1999
IEEE
15 years 9 months ago
A Sublinear Time Approximation Scheme for Clustering in Metric Spaces
The metric 2-clustering problem is de ned as follows: given a metric (X;d), partition X into two sets S1 and S2 in order to minimize the value of X i X fu;vg Si d(u;v) In this pap...
Piotr Indyk