返回
Data-dependent metric filtering
DOI:10.1016/j.is.2021.101980.png)
摘要
En 中文
Filtering is a fundamental strategy of metric similarity indexes to minimise the number of computed distances. Given a triplet of objects for which distances of two pairs are known, the lower and upper bounds on the third distance can be determined using the triangle inequality property. Obviously, tightness of the bounds is crucial for efficiency reasons - the more precise the estimation, the more distance computations can be avoided, and the more efficient the search is. We show that it is not necessary to consider arbitrary angles in triangles formed by pairwise distances of three objects, as specific range of possible angles is data dependent. When considering realistic ranges of angles, the bounds on distances can be much more tight and filtering much more effective. We formalise the problem of the data dependent estimation of bounds on distances and deeply analyse limited angles in triangles of distances. We justify the potential of the data dependent metric filtering both, analytically and experimentally, executing many distance estimations on several real-life datasets. (c) 2021 Elsevier Ltd. All rights reserved.
Keyword:
Metric Space Searching
Similarity Search
Metric Filtering
Data Dependent Filtering
期刊
IF:
3.9
论文数:
2.8K
被引数:
1.8K
机构
引用论文
Stapled Hemorrhoidectomy versus Conventional Excision Hemorrhoidectomy for Acute Hemorrhoidal Crisis
Deuteron nuclear magnetic resonance study of the dynamic organization of phospholipid/cholesterol bilayer membranes: molecular properties and viscoelastic behavior
Biochemistry
IF0
Structure and Stability of Monomeric .lambda. Repressor: NMR Evidence for Two-State Folding
Biochemistry
IF0

