Sciweavers

CLASSIFICATION
2006
103views more  CLASSIFICATION 2006»
14 years 19 days ago
On the Complexity of Ordinal Clustering
Abstract. Given a set of pairwise distances on a set of n points, constructing an edge-weighted tree whose leaves are these n points such that the tree distances would mimic the or...
Rahul Shah, Martin Farach-Colton