77 search results - page 2 / 16 » Clustering for metric and non-metric distance measures |
TALG
2010
12 years 11 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
ICML
2005
IEEE
14 years 5 months ago
2005
IEEE
Despite of the large number of algorithms developed for clustering, the study on comparing clustering results is limited. In this paper, we propose a measure for comparing cluster...
BMCBI
2006
13 years 5 months ago
2006
Background: The recent advancement of microarray technology with lower noise and better affordability makes it possible to determine expression of several thousand genes simultane...
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
We address the problem of similarity metric selection in pairwise affinity clustering. Traditional techniques employ standard algebraic context-independent sample-distance measur...