all AI news
Experimental Analysis of Machine Learning Techniques for Finding Search Radius in Locality Sensitive Hashing. (arXiv:2211.09093v1 [cs.DB])
cs.LG updates on arXiv.org arxiv.org
Finding similar data in high-dimensional spaces is one of the important tasks
in multimedia applications. Approaches introduced to find exact searching
techniques often use tree-based index structures which are known to suffer from
the curse of the dimensionality problem that limits their performance.
Approximate searching techniques prefer performance over accuracy and they
return good enough results while achieving a better performance. Locality
Sensitive Hashing (LSH) is one of the most popular approximate nearest neighbor
search techniques for high-dimensional spaces. One …
analysis arxiv experimental hashing machine machine learning machine learning techniques search