000 03586nam a22004575i 4500
001 978-3-031-02296-8
003 DE-He213
005 20240730165222.0
007 cr nn 008mamaa
008 220601s2015 sz | s |||| 0|eng d
020 _a9783031022968
_9978-3-031-02296-8
024 7 _a10.1007/978-3-031-02296-8
_2doi
050 4 _aTK5105.5-5105.9
072 7 _aUKN
_2bicssc
072 7 _aCOM043000
_2bisacsh
072 7 _aUKN
_2thema
082 0 4 _a004.6
_223
100 1 _aManasse, Mark S.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_987905
245 1 0 _aOn the Efficient Determination of Most Near Neighbors
_h[electronic resource] :
_bHorseshoes, Hand Grenades, Web Search and Other Situations When Close Is Close Enough, Second Edition /
_cby Mark S. Manasse.
250 _a2nd ed. 2015.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _aXIX, 80 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSynthesis Lectures on Information Concepts, Retrieval, and Services,
_x1947-9468
505 0 _aForward -- Foreword to the First Edition -- Acknowledgments -- 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 -- Forks in the Road: Flajolet and Slightly Biased Sampling -- Author's Biography.
520 _aThe 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 book 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 abouttwo 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.
650 0 _aComputer networks .
_931572
650 1 4 _aComputer Communication Networks.
_987907
710 2 _aSpringerLink (Online service)
_987911
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031011689
776 0 8 _iPrinted edition:
_z9783031034244
830 0 _aSynthesis Lectures on Information Concepts, Retrieval, and Services,
_x1947-9468
_987912
856 4 0 _uhttps://doi.org/10.1007/978-3-031-02296-8
912 _aZDB-2-SXSC
942 _cEBK
999 _c86170
_d86170