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...
Na minha lista:
| Principais autores: | , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Chinês |
| Publicado em: |
Beijing Xintong Media Co., Ltd
2017-09-01
|
| coleção: | Dianxin kexue |
| Assuntos: | |
| Acesso em linha: | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2017193/ |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|