Sciweavers

217 search results - page 27 / 44
» Searching in metric spaces with user-defined and approximate...
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
SSDBM
1999
IEEE
124views Database» more  SSDBM 1999»
13 years 12 months ago
An Indexing Scheme for Fast Similarity Search in Large Time Series Databases
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
Eamonn J. Keogh, Michael J. Pazzani
WIRN
2005
Springer
14 years 1 months ago
Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
Alberto Bertoni, Giorgio Valentini
FOCS
2004
IEEE
13 years 11 months ago
Triangulation and Embedding Using Small Sets of Beacons
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler
SISAP
2009
IEEE
134views Data Mining» more  SISAP 2009»
14 years 2 months ago
Searching by Similarity and Classifying Images on a Very Large Scale
—In the demonstration we will show a system for searching by similarity and automatically classifying images in a very large dataset. The demonstrated techniques are based on the...
Giuseppe Amato, Pasquale Savino