Title

Near neighbor searching with K nearest references

Author

EDGAR LEONEL CHAVEZ GONZALEZ

Mario Graff

Gonzalo Navarro

ERIC SADIT TELLEZ AVILA

Access level

Open Access

Summary or description

Proximity searching is the problem of retrieving,from agiven data base,those objects closest to aquery.To avoid exhaustive searching, data structures called indexes are builton the data base prior to serving queries.The curse of dimensionality is awell-known problem

for indexes: in spaces with sufficiently concentrated distance histograms,no index out performs anexhaustive scan of the data base.

Publisher

Information Systems 51

Elsevier

Publish date

2015

Publication type

Article

Format

application/pdf

Language

English

Audience

Researchers

Source repository

Repositorio Institucional de INFOTEC

Downloads

141

Comments



You need to sign in or sign up to comment.