Pivot Selection Techniques for Proximity Searching in Metric Spaces


Dateien zu dieser Ressource

Prüfsumme: MD5:79d897a215b84480731fb8f3531edc3d

BUSTOS CÁRDENAS, Benjamin Eugenio, Gonzalo NAVARRO, Edgar CHÁVEZ, 2003. Pivot Selection Techniques for Proximity Searching in Metric Spaces. In: Pattern recognition letters. 24(14), pp. 2357-2366

@article{Bustos Cardenas2003Pivot-5525, title={Pivot Selection Techniques for Proximity Searching in Metric Spaces}, year={2003}, doi={10.1016/S0167-8655(03)00065-5}, number={14}, volume={24}, journal={Pattern recognition letters}, pages={2357--2366}, author={Bustos Cárdenas, Benjamin Eugenio and Navarro, Gonzalo and Chávez, Edgar} }

<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/5525"> <dc:creator>Chávez, Edgar</dc:creator> <dc:contributor>Bustos Cárdenas, Benjamin Eugenio</dc:contributor> <dcterms:abstract xml:lang="eng">With few exceptions, proximity search algorithms in metric spaces based on the use of pivots select them at random among the objects of the metric space. However, it is well known that the way in which the pivots are selected can drastically affect the performance of the algorithm. Between two sets of pivots of the same size, better chosen pivots can largely reduce the search time. Alternatively, a better chosen small set of pivots (requiring much less space) can yield the same efficiency as a larger, randomly chosen, set. We propose an efficiency measure to compare two pivot sets, combined with an optimization technique that allows us to select good sets of pivots. We obtain abundant empirical evidence showing that our technique is effective, and it is the first that we are aware of in producing consistently good results in a wide variety of cases and in being based on a formal theory. We also show that good pivots are outliers, but that selecting outliers does not ensure that good pivots are selected.</dcterms:abstract> <dc:language>eng</dc:language> <dcterms:issued>2003</dcterms:issued> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dc:format>application/pdf</dc:format> <dc:creator>Navarro, Gonzalo</dc:creator> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:56:13Z</dc:date> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5525"/> <dcterms:bibliographicCitation>First publ. in: Pattern recognition letters 24 (2003), 14, pp. 2357-2366</dcterms:bibliographicCitation> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:56:13Z</dcterms:available> <dc:rights>deposit-license</dc:rights> <dc:contributor>Navarro, Gonzalo</dc:contributor> <dc:creator>Bustos Cárdenas, Benjamin Eugenio</dc:creator> <dc:contributor>Chávez, Edgar</dc:contributor> <dcterms:title>Pivot Selection Techniques for Proximity Searching in Metric Spaces</dcterms:title> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

prl03.pdf 103

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Mein Benutzerkonto