SLSB-forest:approximate k nearest neighbors searching on high dimensional data

SLSB-forest:approximate k nearest neighbors searching on high dimensional data

The study of approximate k nearest neighbors query has attracted broad attention.Local sensitive hash is one of the mainstream ways to solve this problem.Local sensitive hash and its varients have noted the following problems:the uneven distribution of hashed data in the buckets,it cannot calculate...

Full description

Saved in:
Bibliographic Details
Main Authors: Tu QIAN, Jiangbo QIAN, Yihong DONG, Huahui CHEN
Format: Article
Language:zho
Published: Beijing Xintong Media Co., Ltd 2017-09-01
Series:Dianxin kexue
Subjects:
approximate k nearest neighbor
locality sensitive hash
high dimensionality
Online Access:http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2017193/
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2017193/

Similar Items