COMPGEOM
2011
ACM
13 years 3 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
SIAMSC
2008
13 years 11 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
DIS
2006
Springer
14 years 3 months ago
2006
Springer
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
ICPR
2008
IEEE
14 years 5 months ago
2008
IEEE
Two Dimensional Linear Discriminant Analysis (2DLDA) has received much interest in recent years. However, 2DLDA could make pairwise distances between any two classes become signiï...
PAKDD
2009
ACM
14 years 6 months ago
2009
ACM
Abstract. Clustering high dimensional data with sparse features is challenging because pairwise distances between data items are not informative in high dimensional space. To addre...
ICML
2009
IEEE
15 years 8 days ago
2009
IEEE
We consider the problem of embedding arbitrary objects (e.g., images, audio, documents) into Euclidean space subject to a partial order over pairwise distances. Partial order cons...