On The Efficient Determination of Most Near Neighbors (Record no. 84879)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03336nam a22004575i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-031-02281-4 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240730163704.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 221111s2012 sz | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783031022814 |
| -- | 978-3-031-02281-4 |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 004.6 |
| 100 1# - AUTHOR NAME | |
| Author | Manasse, Mark. |
| 245 10 - TITLE STATEMENT | |
| Title | On The Efficient Determination of Most Near Neighbors |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2012. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | IV, 88 p. |
| 490 1# - SERIES STATEMENT | |
| Series statement | Synthesis Lectures on Information Concepts, Retrieval, and Services, |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Remark 2 | Introduction -- Comparing Web Pages for Similarity: An Overview -- A Personal History of Web Search -- Uniform Sampling after Alta Vista -- Why Weight (and How)? -- A Few Applications. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | 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 running shoes, they cannot hope to outrun a bear, to which the first notes that most likely the bear will be satiated after catching the slower of them. We seek problems in which we don't need to be faster than the bear, just faster than the others fleeing the bear. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | https://doi.org/10.1007/978-3-031-02281-4 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cham : |
| -- | Springer International Publishing : |
| -- | Imprint: Springer, |
| -- | 2012. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer networks . |
| 650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer Communication Networks. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| -- | 1947-9468 |
| 912 ## - | |
| -- | ZDB-2-SXSC |
No items available.