Classification with Nonmetric Distances: Image Retrieval and Class Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
ACM Computing Surveys (CSUR)
Fast Nearest-Neighbor Search in Dissimilarity Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
DynDex: a dynamic and non-metric space indexer
Proceedings of the tenth ACM international conference on Multimedia
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Probabilistic Spell for the Curse of Dimensionality
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Similarity Search: The Metric Space Approach (Advances in Database Systems)
Similarity Search: The Metric Space Approach (Advances in Database Systems)
Unified framework for fast exact and approximate search in dissimilarity spaces
ACM Transactions on Database Systems (TODS)
Efficient Similarity Search in Nonmetric Spaces with Local Constant Embedding
IEEE Transactions on Knowledge and Data Engineering
On fast non-metric similarity search by metric access methods
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
On Fuzzy vs. Metric Similarity Search in Complex Databases
FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
Efficient RkNN retrieval with arbitrary non-metric similarity measures
Proceedings of the VLDB Endowment
Efficient reverse skyline retrieval with arbitrary non-metric similarity measures
Proceedings of the 14th International Conference on Extending Database Technology
On nonmetric similarity search problems in complex domains
ACM Computing Surveys (CSUR)
Protein sequences identification using NM-tree
Proceedings of the Fourth International Conference on SImilarity Search and APplications
On optimizing the non-metric similarity search in tandem mass spectra by clustering
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
| Hi-index | 0.00 |
So far, an efficient similarity search in multimedia databases has been carried out by metric access methods (MAMs), where the utilized similarity measure had to satisfy the metric properties (reflexivity, non-negativity, symmetry, triangle inequality). Recently, the introduction of TriGen algorithm (turning any nonmetric into metric) enabled MAMs to perform also nonmetric similarity search. Moreover, it simultaneously enabled faster approximate search (either metric or nonmetric). However, a simple application of TriGen as the first step before MAMs' indexing assumes a fixed "approximation level", that is, a user-defined tolerance of retrieval precision is preset for the whole index lifetime. In this paper, we push the similarity search forward; we propose the NM-tree (nonmetric tree) --- a modification of M-tree which natively aggregates the TriGen algorithm to support flexible approximatenonmetric or metric search. Specifically, at query time the NM-tree provides a user-defined level of retrieval efficiency/precision trade-off. We show the NM-tree could be used for general (non)metric search, while the desired retrieval precision can be flexibly tuned on-demand.