5595 search results - page 294 / 1119 » Approximation Algorithms for Clustering Problems |
198
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
175
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
159
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
Web Clustering is useful for several activities in the WWW, from automatically building web directories to improve retrieval performance. Nevertheless, due to the huge size of the...
142
click to vote
ICDM
2006
IEEE
16 years 21 days ago
2006
IEEE
The ultimate goal of data mining is to extract knowledge from massive data. Knowledge is ideally represented as human-comprehensible patterns from which end-users can gain intuiti...
198
click to vote
COCOON
2004
Springer
15 years 10 months ago
2004
Springer
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...