847 search results - page 15 / 170 » Approximation algorithms for projective clustering |
KDD
2007
ACM
14 years 9 months ago
2007
ACM
XML has become a popular method of data representation both on the web and in databases in recent years. One of the reasons for the popularity of XML has been its ability to encod...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
MOBIHOC
2002
ACM
14 years 8 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
PKDD
2005
Springer
14 years 2 months ago
2005
Springer
For discrete co-occurrence data like documents and words, calculating optimal projections and clustering are two different but related tasks. The goal of projection is to find a ...