[图书][B] Similarity search: the metric space approach

P Zezula, G Amato, V Dohnal, M Batko - 2006 - books.google.com
The area of similarity searching is a very hot topic for both research and c-mercial
applications. Current data processing applications use data with c-siderably less structure …

On nonmetric similarity search problems in complex domains

T Skopal, B Bustos - ACM Computing Surveys (CSUR), 2011 - dl.acm.org
The task of similarity search is widely used in various areas of computing, including
multimedia databases, data mining, bioinformatics, social networks, etc. In fact, retrieval of …

Indexing metric spaces for exact similarity search

L Chen, Y Gao, X Song, Z Li, Y Zhu, X Miao… - ACM Computing …, 2022 - dl.acm.org
With the continued digitization of societal processes, we are seeing an explosion in
available data. This is referred to as big data. In a research setting, three aspects of the data …

Index-driven similarity search in metric spaces (survey article)

GR Hjaltason, H Samet - ACM Transactions on Database Systems …, 2003 - dl.acm.org
Similarity search is a very important operation in multimedia databases and other database
applications involving complex objects, and involves finding objects in a data set S similar to …

Multiregional co-evolutionary algorithm for dynamic multiobjective optimization

X Ma, J Yang, H Sun, Z Hu, L Wei - Information Sciences, 2021 - Elsevier
Dynamic multiobjective optimization problems (DMOPs) require Evolutionary algorithms
(EAs) to track the time-dependent Pareto-optimal front (PF) or Pareto-optimal set (PS), and …

[PDF][PDF] LB_Keogh supports exact indexing of shapes under rotation invariance with arbitrary representations and distance measures

E Keogh, L Wei, X Xi, SH Lee, M Vlachos - Proceedings of the 32nd …, 2006 - vldb.org
The matching of two-dimensional shapes is an important problem with applications in
domains as diverse as biometrics, industry, medicine and anthropology. The distance …

Warp: Accurate retrieval of shapes using phase of fourier descriptors and time warping distance

I Bartolini, P Ciaccia, M Patella - IEEE transactions on pattern …, 2005 - ieeexplore.ieee.org
Effective and efficient retrieval of similar shapes from large image databases is still a
challenging problem in spite of the high relevance that shape information can have in …

[PDF][PDF] Top-k query evaluation with probabilistic guarantees

M Theobald, G Weikum, R Schenkel - … conference on Very large data bases …, 2004 - vldb.org
Top-k queries based on ranking elements of multidimensional datasets are a fundamental
building block for many kinds of information discovery. The best known general-purpose …

Effective proximity retrieval by ordering permutations

E Chávez, K Figueroa, G Navarro - IEEE Transactions on …, 2008 - ieeexplore.ieee.org
We introduce a new probabilistic proximity search algorithm for range and A"-nearest
neighbor (A"-NN) searching in both coordinate and metric spaces. Although there exist …

[PDF][PDF] Klee: A framework for distributed top-k query algorithms

S Michel, P Triantafillou, G Weikum - … conference on Very large data bases, 2005 - Citeseer
This paper addresses the efficient processing of top-k queries in wide-area distributed data
repositories where the index lists for the attribute values (or text terms) of a query are …