352 search results - page 28 / 71 » A local search approximation algorithm for k-means clusterin... |
COMPGEOM
2001
ACM
15 years 1 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
100
click to vote
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
102
click to vote
JBI
2004
14 years 11 months ago
2004
Microarray analysis using clustering algorithms can suffer from lack of inter-method consistency in assigning related gene-expression profiles to clusters. Obtaining a consensus s...
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a nonparametric mode-seeking algorithm, called medoidshift, based on approximating the local gradient using a weighted estimate of medoids. Like meanshift, medoidshift ...
BMCBI
2005
14 years 9 months ago
2005
Background: Clustering is a key step in the analysis of gene expression data, and in fact, many classical clustering algorithms are used, or more innovative ones have been designe...