{"type":"ScholarlyArticle","title":"Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph","authors":[{"name":"Kiana Hajebi","slug":"kiana-hajebi","given":"Kiana","family":"Hajebi","affiliation":""},{"name":"Yasin Abbasi-Yadkori","slug":"yasin-abbasi-yadkori","given":"Yasin","family":"Abbasi-Yadkori","affiliation":""},{"name":"Hossein Shahbazi","slug":"hossein-shahbazi","given":"Hossein","family":"Shahbazi","affiliation":""},{"name":"Hong Zhang","slug":"hong-zhang","given":"Hong","family":"Zhang","affiliation":""}],"abstract":"We introduce a new nearest neighbor search al-gorithm. The algorithm builds a nearest neighborgraph in an offline phase and when queried witha new point, performs hill-climbing starting froma randomly sampled node of the graph. We pro-vide theoretical guarantees for the accuracy and thecomputational complexity and empirically showthe effectiveness of this algorithm.","doi":"10.5591/978-1-57735-516-8/IJCAI11-222","url":"https://ijcai.org/proceedings/2011/222","pdf":"https://ijcai.org/proceedings/2011/0222.pdf","markdown":"https://ijcai.org/proceedings/2011/222.md","bibtex":"https://ijcai.org/proceedings/2011/bibtex/222","volume":{"slug":"2011","title":"Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2011","url":"https://ijcai.org/proceedings/2011/","year":2011,"location":"Barcelona, Catalonia, Spain","dates":"16–22 July 2011","editors":"Toby Walsh","isbn":"978-1-57735-512-0; 978-1-57735-513-7; 978-1-57735-514-4; 978-1-57735-515-1; 978-1-57735-516-8","publisher":"AAAI Press/International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":222,"pages":{"first":1312,"last":1316},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}