On the Efficient Determination of Most Near Neighbors
eBook - PDF

On the Efficient Determination of Most Near Neighbors

Horseshoes, Hand Grenades, Web Search and Other Situations When Close Is Close Enough, Second Edition

  1. English
  2. PDF
  3. Available on iOS & Android
eBook - PDF

On the Efficient Determination of Most Near Neighbors

Horseshoes, Hand Grenades, Web Search and Other Situations When Close Is Close Enough, Second Edition

Book details
Table of contents
Citations

About This Book

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 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.

Frequently asked questions

Simply head over to the account section in settings and click on “Cancel Subscription” - it’s as simple as that. After you cancel, your membership will stay active for the remainder of the time you’ve paid for. Learn more here.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlego’s features. The only differences are the price and subscription period: With the annual plan you’ll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access On the Efficient Determination of Most Near Neighbors by Mark S. Manasse in PDF and/or ePUB format, as well as other popular books in Computer Science & Computer Networking. We have over one million books available in our catalogue for you to explore.

Information

Publisher
Springer
Year
2022
ISBN
9783031022968
Edition
2

Table of contents

  1. Cover
  2. Copyright Page
  3. Title Page
  4. Contents
  5. Forward
  6. Foreword to the First Edition
  7. Acknowledgments
  8. Introduction
  9. Comparing Web Pages for Similarity: An Overview
  10. A Personal History of Web Search
  11. Uniform Sampling after Alta Vista
  12. Why Weight (and How)?
  13. A Few Applications
  14. Forks in the Road: Flajolet and Slightly Biased Sampling
  15. Afterword
  16. Bibliography
  17. Author's Biography