5595 search results - page 323 / 1119 » Approximation Algorithms for Clustering Problems |
174
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Most existing methods of semi-supervised clustering introduce supervision from outside, e.g., manually label some data samples or introduce constrains into clustering results. Thi...
170
click to vote
AUSAI
2006
Springer
15 years 10 months ago
2006
Springer
The unsupervised nature of cluster analysis means that objects can be clustered in many different ways. This means that different clustering algorithms can lead to vastly different...
147
click to vote
BIRTHDAY
2010
Springer
15 years 10 months ago
2010
Springer
The present paper analyzes the usefulness of the normalized compression distance for the problem to cluster the hemagglutinin (HA) sequences of influenza virus data for the HA gene...
194
click to vote
TCSB
2008
15 years 6 months ago
2008
Clustering gene expression data given in terms of time-series is a challenging problem that imposes its own particular constraints, namely exchanging two or more time points is not...
304
click to vote
NLP
2000
15 years 10 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...