Sciweavers

60 search results - page 1 / 12
» Density geodesics for similarity clustering
Sort
View
ICASSP
2008
IEEE
13 years 11 months ago
Density geodesics for similarity clustering
We address the problem of similarity metric selection in pairwise affinity clustering. Traditional techniques employ standard algebraic context-independent sample-distance measur...
Umut Ozertem, Deniz Erdogmus, Miguel Á. Car...
ICASSP
2011
IEEE
12 years 8 months ago
Polytope kernel density estimates on Delaunay graphs
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
Erhan Bas, Deniz Erdogmus
ICPR
2008
IEEE
14 years 6 months ago
Geodesic K-means clustering
We introduce a class of geodesic distances and extend the K-means clustering algorithm to employ this distance metric. Empirically, we demonstrate that our geodesic K-means algori...
Arian Maleki, Nima Asgharbeygi
PAKDD
2007
ACM
158views Data Mining» more  PAKDD 2007»
13 years 11 months ago
Density-Sensitive Evolutionary Clustering
In this study, we propose a novel evolutionary algorithm-based clustering method, named density-sensitive evolutionary clustering (DSEC). In DSEC, each individual is a sequence of ...
Maoguo Gong, Licheng Jiao, Ling Wang, Liefeng Bo
AUSAI
2006
Springer
13 years 8 months ago
Clustering Similarity Comparison Using Density Profiles
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...
Eric Bae, James Bailey, Guozhu Dong