35 search results - page 2 / 7 » Efficient Mean-shift Clustering Using Gaussian KD-Tree |
200
Voted
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
173
Voted
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Gaussian blurring mean-shift (GBMS) is a nonparametric clustering algorithm, having a single bandwidth parameter that controls the number of clusters. The algorithm iteratively sh...
160
Voted
KDD
2002
ACM
16 years 6 months ago
2002
ACM
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
235
Voted
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
166
Voted
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Median-shift is a mode seeking algorithm that relies on
computing the median of local neighborhoods, instead of
the mean. We further combine median-shift with Locality
Sensitive...