WebTI - Binary Sketches for Secondary Filtering JF - ACM Transactions on Information Systems VL - 37 IS - 1 SP - "1:1"-"1:28" EP - "1:1"-"1:28" PB - ACM Press SN - 10468188 KW - Top-k retrieval in databases;Retrieval efficiency;Retrieval effectiveness;Similarity measures; UR - http://dx.doi.org/10.1145/3231936 WebOct 5, 2024 · We also propose a pioneering implementation of the relational similarity search for the Euclidean spaces and report its extreme filtering power in comparison with 3 contemporary techniques. References 1. Amato, G., Falchi, F., Vadicamo, L.: Visual recognition of ancient inscriptions using convolutional neural network and fisher vector.

Data-Driven Learned Metric Index: An Unsupervised Approach

WebOct 22, 2024 · Four unsupervised machine learning algorithms were selected, as described in Sect. 4.3 to test the capabilities of an unsupervised approach experimentally. Two of … WebAug 13, 2024 · Binary sketches were proposed recently [ 12 ], where a system of independent hyperplanes is converted to a bit-string. It leads to very efficient and effective filtering with Hamming distance. To speed up search on secondary memory, the sketches must be stored apart from the data objects. lithisil 829 tds

Binary Sketches for Secondary Filtering - is.muni.cz

WebData-Driven Learned Metric Index: An Unsupervised Approach Ter´ezia Slanin´akov´a(B), Matej Antol , Jaroslav OˇIha ,Vojtˇech Kaˇna, and Vlastislav Dohnal Faculty of Informatics, Masaryk University, WebSep 24, 2024 · We propose dynamic filter trie (DyFT), a dynamic similarity search method for both binary and integer sketches. An extensive experimental analysis using large real-world datasets shows that DyFT performs superiorly with respect to scalability, time performance, and memory efficiency. For example, on a huge dataset of 216 million data … lithish name meaning