说明:Semantic hashing[1] seeks compact binary codes of data-points so that the
Hamming distance between codewords correlates with semantic similarity.
In this paper, we show that the problem of finding a best code for a given
dataset is closely related to
<u012490380> 在 上传 | 大小:1019904