484 search results - page 42 / 97 » Measuring the Quality of Approximated Clusterings |
95
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
156
click to vote
FOGA
2011
14 years 5 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
111
click to vote
EDBT
2004
ACM
16 years 2 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
129
click to vote
ICPP
2002
IEEE
15 years 6 months ago
2002
IEEE
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...
110
click to vote
ISI
2008
Springer
15 years 1 months ago
2008
Springer
Often several cooperating parties would like to have a global view of their joint data for various data mining objectives, but cannot reveal the contents of individual records due...