KOPS - The Institutional Repository of the University of Konstanz

Subspace Nearest Neighbor Search : Problem Statement, Approaches, and Discussion

Subspace Nearest Neighbor Search : Problem Statement, Approaches, and Discussion

Cite This

Files in this item

Checksum: MD5:561eb0f0f6a3f687408280efaf418888

HUND, Michael, Michael BEHRISCH, Ines FÄRBER, Michael SEDLMAIR, Tobias SCHRECK, Thomas SEIDL, Daniel KEIM, 2015. Subspace Nearest Neighbor Search : Problem Statement, Approaches, and Discussion. 8th International Conference, SISAP 2015. Glasgow, UK, Oct 12, 2015 - Oct 14, 2015. In: AMATO, Giuseppe, ed. and others. Similarity Search and Applications : 8th International Conference, SISAP 2015, Glasgow, UK, October 12-14, 2015 ; Proceedings. Cham [u.a.]:Springer, pp. 307-313. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-25086-1. Available under: doi: 10.1007/978-3-319-25087-8_29

@inproceedings{Hund2015Subsp-32289, title={Subspace Nearest Neighbor Search : Problem Statement, Approaches, and Discussion}, year={2015}, doi={10.1007/978-3-319-25087-8_29}, number={9371}, isbn={978-3-319-25086-1}, issn={0302-9743}, address={Cham [u.a.]}, publisher={Springer}, series={Lecture Notes in Computer Science}, booktitle={Similarity Search and Applications : 8th International Conference, SISAP 2015, Glasgow, UK, October 12-14, 2015 ; Proceedings}, pages={307--313}, editor={Amato, Giuseppe}, author={Hund, Michael and Behrisch, Michael and Färber, Ines and Sedlmair, Michael and Schreck, Tobias and Seidl, Thomas and Keim, Daniel} }

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/32289"> <dc:creator>Färber, Ines</dc:creator> <dc:contributor>Schreck, Tobias</dc:contributor> <dc:creator>Hund, Michael</dc:creator> <dc:creator>Schreck, Tobias</dc:creator> <dcterms:abstract xml:lang="eng">Computing the similarity between objects is a central task for many applications in the field of information retrieval and data mining. For finding k-nearest neighbors, typically a ranking is computed based on a predetermined set of data dimensions and a distance function, constant over all possible queries. However, many high-dimensional feature spaces contain a large number of dimensions, many of which may contain noise, irrelevant, redundant, or contradicting information. More specifically, the relevance of dimensions may depend on the query object itself, and in general, different dimension sets (subspaces) may be appropriate for a query. Approaches for feature selection or -weighting typically provide a global subspace selection, which may not be suitable for all possibly queries. In this position paper, we frame a new research problem, called subspace nearest neighbor search, aiming at multiple query-dependent subspaces for nearest neighbor search. We describe relevant problem characteristics, relate to existing approaches, and outline potential research directions.</dcterms:abstract> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/32289/1/Hund_0-310030.pdf"/> <dc:contributor>Färber, Ines</dc:contributor> <dc:creator>Keim, Daniel</dc:creator> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/32289"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-11-30T13:56:27Z</dc:date> <dcterms:issued>2015</dcterms:issued> <dc:creator>Sedlmair, Michael</dc:creator> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/32289/1/Hund_0-310030.pdf"/> <dc:contributor>Hund, Michael</dc:contributor> <dc:contributor>Sedlmair, Michael</dc:contributor> <dc:creator>Seidl, Thomas</dc:creator> <dc:contributor>Behrisch, Michael</dc:contributor> <dc:creator>Behrisch, Michael</dc:creator> <dcterms:title>Subspace Nearest Neighbor Search : Problem Statement, Approaches, and Discussion</dcterms:title> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:rights>terms-of-use</dc:rights> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:language>eng</dc:language> <dc:contributor>Seidl, Thomas</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-11-30T13:56:27Z</dcterms:available> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dc:contributor>Keim, Daniel</dc:contributor> </rdf:Description> </rdf:RDF>

Downloads since Nov 30, 2015 (Information about access statistics)

Hund_0-310030.pdf 193

This item appears in the following Collection(s)

Search KOPS


Browse

My Account