3æ¥ã§ä½ãé«éç¹å®ç©ä½èªèã·ã¹ãã (6) ç·å½¢æ¢ç´¢ãç¨ããç¹å®ç©ä½èªèï¼2009/11/22ï¼ã®ã¤ã¥ãã§ããä»åããã®ã·ãªã¼ãºã®æçµåã§ãã ååã®ç·å½¢æ¢ç´¢ã¯é ãããã®ã§æè¿åæ¢ç´¢ãé«éåãã¾ããããã§è¡¨é¡ã®é«éç¹å®ç©ä½èªèã·ã¹ãã ãã§ããããã¾ããé«éåã«ã¯ããã¤ãã®æ¹æ³ãããã¾ãããç©ä½ã¢ãã«ãã¼ã¿ãã¼ã¹ããªãããã®ãã¼ã¿æ§é ã«ãããããæ ¼ç´ãã¦ããã¨ããã®ããã¤ã³ãã§ããä»åã¯ãè³æã§ãè¿°ã¹ããã¦ããkd-treeã¨Locality Sensitive Hashing (LSH)ã¨ããææ³ã試ãã¦ã¿ã¾ããkd-treeã¯æ¨æ§é ãLSHã¯ããã·ã¥ã§ãã¼ã¿ãæ§é åï¼ã¤ã³ããã·ã³ã°ï¼ãã¾ããkd-treeã¯ãå³å¯ãªæè¿åãæ±ãã¾ãããLSHã¯è¿ä¼¼æè¿åæ¤ç´¢ã¨å¼ã°ããå³å¯ãªæè¿åã¯æ±ããããªã代ããã«è¨ç®ãå¤§å¹ ã«é«éåã§ãã¾ãã è³æã§ã¯ãANN (Approximate Nearest
{{#tags}}- {{label}}
{{/tags}}