Charles Explorer logo
🇬🇧

On Nonmetric Similarity Search Problems in Complex Domains

Publication at Faculty of Mathematics and Physics |
2011

Abstract

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 semantically unstructured data entities requires a form of aggregated qualification that selects entities relevant to a query.

A popular type of such a mechanism is similarity querying. For a long time, the database-oriented applications of similarity search employed the definition of similarity restricted to metric distances.

Due to its topological properties, metric similarity can be effectively used to index a database which can be then queried efficiently by so-called metric access methods. However, together with the increasing complexity of data entities across various domains, in recent years there appeared many similarities that were not metrics -- we call them nonmetric similarity functions.

In this paper we survey domains employing nonmetric functions for effective similarity search, and methods for efficient...