Estimating the selectivity of tf-idf based cosine similarity predicates
ACM SIGMOD Record · 2007-06 · 36 (2) · 7-12
DOI: 10.1145/1328854.1328855 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM SIGMOD Record, 2007-06. Verfasst von Sandeep Tata und 1 weiteren Autor:innen. Die Arbeit wurde bisher 141-mal zitiert (Crossref) und nennt 10 Literaturangaben.
Abstract (Originalsprache)
An increasing number of database applications today require sophisticated approximate string matching capabilities. Examples of such application areas include data integration and data cleaning. Cosine similarity has proven to be a robust metric for scoring the similarity between two strings, and it is increasingly being used in complex queries. An immediate challenge faced by current database optimizers is to find accurate and efficient methods for estimating the selectivity of cosine similarity predicates. To the best of our knowledge, there are no known methods for this problem. In this paper, we present the first approach for estimating the selectivity of tf.idf based cosine similarity predicates. We evaluate our approach on three different real datasets and show that our method often produces estimates that are within 40% of the actual selectivity.
Zitieren
APA
Tata, S., & Patel, J. M. (2007). Estimating the selectivity of tf-idf based cosine similarity predicates. ACM SIGMOD Record, 36(2), 7-12. https://doi.org/10.1145/1328854.1328855
Vancouver
Tata S, Patel JM. Estimating the selectivity of tf-idf based cosine similarity predicates. ACM SIGMOD Record. 2007;36(2):7-12. doi:10.1145/1328854.1328855
BibTeX
@article{Tata2007,
author = {Tata, Sandeep and Patel, Jignesh M.},
title = {Estimating the selectivity of tf-idf based cosine similarity predicates},
journal = {ACM SIGMOD Record},
year = {2007},
volume = {36},
number = {2},
pages = {7--12},
doi = {10.1145/1328854.1328855}
}
EUVIMED