| 書目名稱 | On The Efficient Determination of Most Near Neighbors | | 編輯 | Mark S. Manasse | | 視頻video | http://file.papertrans.cn/702/701085/701085.mp4 | | 叢書名稱 | Synthesis Lectures on Information Concepts, Retrieval, and Services | | 圖書封面 |  | | 描述 | The time-worn aphorism "close only counts in horseshoes and hand-grenades" is clearly inadequate. Close also counts in golf, shuffleboard, archery, darts, curling, and other games of accuracy in which hitting the precise center of the target isn‘t to be expected every time, or in which we can expect to be driven from the target by skilled opponents. This lecture is not devoted to sports discussions, but to efficient algorithms for determining pairs of closely related web pages -- and a few other situations in which we have found that inexact matching is good enough; where proximity suffices. We will not, however, attempt to be comprehensive in the investigation of probabilistic algorithms, approximation algorithms, or even techniques for organizing the discovery of nearest neighbors. We are more concerned with finding nearby neighbors; if they are not particularly close by, we are not particularly interested. In thinking of when approximation is sufficient, remember the oft-told joke about two campers sitting around after dinner. They hear noises coming towards them. One of them reaches for a pair of running shoes, and starts to don them. The second then notes that even with runnin | | 出版日期 | Book 2012 | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-031-02281-4 | | isbn_ebook | 978-3-031-02281-4Series ISSN 1947-945X Series E-ISSN 1947-9468 | | issn_series | 1947-945X | | copyright | Springer Nature Switzerland AG 2012 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-6 02:51
發(fā)表于 2025-3-21 17:05:28
