Sciweavers

985 search results - page 55 / 197
» An Experiment with Distance Measures for Clustering
Sort
View
TKDE
2010
251views more  TKDE 2010»
14 years 8 months ago
Clustering Uncertain Data Using Voronoi Diagrams and R-Tree Index
—We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises...
Ben Kao, Sau Dan Lee, Foris K. F. Lee, David Wai-L...
RECOMB
2000
Springer
15 years 1 months ago
Contig selection in physical mapping
In physical mapping, one orders a set of genetic landmarks or a library of cloned fragments of DNA according to their position in the genome. Our approach to physical mapping divi...
Steffen Heber, Jens Stoye, Jörg D. Hoheisel, ...
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
16 years 2 months ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
15 years 3 months ago
Post-processing clustering to reduce XCS variability
XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result ...
Flavio Baronti, Alessandro Passaro, Antonina Stari...
CVPR
2008
IEEE
15 years 11 months ago
Constrained spectral clustering through affinity propagation
Pairwise constraints specify whether or not two samples should be in one cluster. Although it has been successful to incorporate them into traditional clustering methods, such as ...
Miguel Á. Carreira-Perpiñán, ...