On scalable approximate search with the signature quadratic form distance

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The signature quadratic form distance and feature signatures have become a respected similarity space for effective content-based retrieval. Furthermore, the similarity space is configurable by a parameter alpha affecting both retrieval precision and intrinsic dimensionality, and thus interesting trade-offs can be achieved when a metric index is used for exact search. In this paper we combine such configurable model with state of the art approximate search techniques developed for the M-Index. In the experiments, we show that employing a configuration resulting in the best effectiveness of the measure leads also to very competitive approximate search effectiveness when using the M-Index, regardless the high intrinsic dimensionality of the corresponding similarity space. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Lokoč, J., Grošup, T., & Skopal, T. (2013). On scalable approximate search with the signature quadratic form distance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8199 LNCS, pp. 312–318). https://doi.org/10.1007/978-3-642-41062-8_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free