Sciweavers

260 search results - page 7 / 52
» An Adaptive Index Structure for High-Dimensional Similarity ...
Sort
View
73
Voted
ADC
2003
Springer
123views Database» more  ADC 2003»
15 years 2 months ago
A Distance-Based Packing Method for High Dimensional Data
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
Tae-wan Kim, Ki-Joune Li
116
Voted
ERSHOV
2009
Springer
15 years 1 months ago
Indexing Dense Nested Metric Spaces for Efficient Similarity Search
Abstract. Searching in metric spaces is a very active field since it offers methods for indexing and searching by similarity in collections of unstructured data. These methods sele...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...
153
Voted
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
15 years 11 months ago
Similarity Search in Sets and Categorical Data Using the Signature Tree
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
Nikos Mamoulis, David W. Cheung, Wang Lian
75
Voted
VLDB
2001
ACM
129views Database» more  VLDB 2001»
15 years 1 months ago
Similarity Search for Adaptive Ellipsoid Queries Using Spatial Transformation
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
Yasushi Sakurai, Masatoshi Yoshikawa, Ryoji Kataok...
IEEECIT
2005
IEEE
15 years 3 months ago
Case Study: Distance-Based Image Retrieval in the MoBIoS DBMS
Similarity search leveraging distance-based index structures is increasingly being used for complex data types. It has been shown that for high dimensional uniform vectors with si...
Rui Mao, Wenguo Liu, Daniel P. Miranker, Qasim Iqb...