Sciweavers

582 search results - page 42 / 117
» Distance Measures for Well-Distributed Sets
Sort
View
COMPGEOM
2007
ACM
14 years 18 days ago
Bi-criteria linear-time approximations for generalized k-mean/median/center
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev
NIPS
2004
13 years 10 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
SAC
2008
ACM
13 years 8 months ago
Trajectory retrieval with latent semantic analysis
The problem of trajectory similarity has been recently attracted research interest considerably, due to its importance in diverse fields. In this work, we study trajectory similar...
Apostolos N. Papadopoulos
KAIS
2006
110views more  KAIS 2006»
13 years 8 months ago
Multi-step density-based clustering
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfei...
PAMI
2008
197views more  PAMI 2008»
13 years 8 months ago
LEGClust - A Clustering Algorithm Based on Layered Entropic Subgraphs
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity meas...
Jorge M. Santos, Joaquim Marques de Sá, Lu&...