spectral hashing
Semantichashingseekscompactbinarycodesofdata-pointssothattheHammingdistancebetweencodewordscorrelateswithsemanticsimilarity.Inthispaper,weshowthattheproblemoffindingabestcodeforagivendatasetiscloselyrelatedtotheproblemofgraphpartitioningandcanbeshowntobeNPhard.Byrelaxingtheorig
下载地址
用户评论
