skip to content
On the efficient determination of most near neighbors : horseshoes, hand grenades, Web search, and other situations when close is close enough Preview this item
ClosePreview this item
Checking...

On the efficient determination of most near neighbors : horseshoes, hand grenades, Web search, and other situations when close is close enough

Author: Mark S Manasse
Publisher: [San Rafael, Calif.] : Morgan & Claypool Publishers, ©2012.
Series: Synthesis lectures on information concepts, retrieval, and services, #24.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Database:WorldCat
Summary:
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Additional Physical Format: Print version:
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Mark S Manasse
ISBN: 9781608450893 1608450899
OCLC Number: 819423537
Description: 1 online resource (xv, 72 p.) : ill.
Contents: 1. Introduction --
1.1 On similarity, resemblance, look-alikes, and entity resolution --
1.2 You must know at least this much math to read this book --
1.3 Cumulative distribution and probability density functions --
Series Title: Synthesis lectures on information concepts, retrieval, and services, #24.
Responsibility: Mark S. Manasse.

Abstract:

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.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/819423537>
library:oclcnum"819423537"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/819423537>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:bookFormatschema:EBook
schema:copyrightYear"2012"
schema:creator
schema:datePublished"2012"
schema:description"1. Introduction -- 1.1 On similarity, resemblance, look-alikes, and entity resolution -- 1.2 You must know at least this much math to read this book -- 1.3 Cumulative distribution and probability density functions --"
schema:description"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."
schema:exampleOfWork<http://worldcat.org/entity/work/id/1183398072>
schema:genre"Electronic books."
schema:inLanguage"en"
schema:name"On the efficient determination of most near neighbors horseshoes, hand grenades, Web search, and other situations when close is close enough"
schema:numberOfPages"72"
schema:publisher
schema:url<http://site.ebrary.com/id/10631917>
schema:url<http://www.morganclaypool.com/doi/pdf/10.2200/S00444ED1V01Y201208ICR024>
schema:url<http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=503563>
schema:url
schema:workExample
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.