Sciweavers

89 search results - page 6 / 18
» Indexing Metric Spaces with M-Tree
Sort
View
ALENEX
2001
105views Algorithms» more  ALENEX 2001»
13 years 10 months ago
A Probabilistic Spell for the Curse of Dimensionality
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
Edgar Chávez, Gonzalo Navarro
KAIS
2000
87views more  KAIS 2000»
13 years 8 months ago
An Index Structure for Data Mining and Clustering
Abstract. In this paper we present an index structure, called MetricMap, that takes a set of objects and a distance metric and then maps those objects to a k-dimensional space in s...
Xiong Wang, Jason Tsong-Li Wang, King-Ip Lin, Denn...
DASFAA
2010
IEEE
189views Database» more  DASFAA 2010»
14 years 1 months ago
Peer-to-Peer Similarity Search Based on M-Tree Indexing
Similarity search in metric spaces has several important applications both in centralized and distributed environments. In centralized applications, such as similarity-based image ...
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotid...
FOCS
2009
IEEE
14 years 19 days ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
SPIRE
2005
Springer
14 years 2 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez