Nearest neighbor search algorithm for high dimensional data based on weighted self-taught hashing
Because of efficiency in query and storage,learning hash is applied in solving the nearest neighbor search problem.The learning hash usually converts high-dimensional data into binary codes.In this way,the similarities between binary codes from two objects are conserved as they were in the original...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Beijing Xintong Media Co., Ltd
2017-06-01
|
| Series: | Dianxin kexue |
| Subjects: | |
| Online Access: | http://www.telecomsci.com/thesisDetails#10.11959/j.issn.1000-0801.2017100 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|