This HTML5 document contains 48 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n9http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n16http://purl.org/net/nknouf/ns/bibtex#
n6http://localhost/temp/predkladatel/
n5http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n4http://linked.opendata.cz/resource/domain/vavai/projekt/
n18http://linked.opendata.cz/ontology/domain/vavai/
n17http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F10%3A00044857%21RIV11-GA0-14330___/
n20https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n11http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F10%3A00044857%21RIV11-GA0-14330___
rdf:type
n18:Vysledek skos:Concept
dcterms:description
The concept of Locality-sensitive Hashing (LSH) has been successfully used for searching in high-dimensional data and a number of locality-preserving hash functions have been introduced. In order to extend the applicability of the LSH approach to a general metric space, we focus on a recently presented Metric Index (M-Index), we redefine its hashing and searching process in the terms of LSH, and perform extensive measurements on two datasets to verify that the M-Index fulfills the conditions of the LSH concept. We widely discuss %22optimal%22 properties of LSH functions and the efficiency of a given LSH function with respect to kNN queries. The results also indicate that the M-Index hashing and searching is more efficient than the tested standard LSH approach for Euclidean distance. The concept of Locality-sensitive Hashing (LSH) has been successfully used for searching in high-dimensional data and a number of locality-preserving hash functions have been introduced. In order to extend the applicability of the LSH approach to a general metric space, we focus on a recently presented Metric Index (M-Index), we redefine its hashing and searching process in the terms of LSH, and perform extensive measurements on two datasets to verify that the M-Index fulfills the conditions of the LSH concept. We widely discuss %22optimal%22 properties of LSH functions and the efficiency of a given LSH function with respect to kNN queries. The results also indicate that the M-Index hashing and searching is more efficient than the tested standard LSH approach for Euclidean distance.
dcterms:title
On Locality-sensitive Indexing in Generic Metric Spaces On Locality-sensitive Indexing in Generic Metric Spaces
skos:prefLabel
On Locality-sensitive Indexing in Generic Metric Spaces On Locality-sensitive Indexing in Generic Metric Spaces
skos:notation
RIV/00216224:14330/10:00044857!RIV11-GA0-14330___
n3:aktivita
n15:S n15:P
n3:aktivity
P(1M0545), P(GA201/09/0683), P(GAP103/10/0886), P(GPP202/10/P220), S
n3:dodaniDat
n11:2011
n3:domaciTvurceVysledku
n5:3445771 n5:3165647
n3:druhVysledku
n12:D
n3:duvernostUdaju
n21:S
n3:entitaPredkladatele
n17:predkladatel
n3:idSjednocenehoVysledku
276741
n3:idVysledku
RIV/00216224:14330/10:00044857
n3:jazykVysledku
n13:eng
n3:klicovaSlova
locality-sensitive hashing; metric space; similarity search; approximation; scalability
n3:klicoveSlovo
n10:scalability n10:metric%20space n10:approximation n10:similarity%20search n10:locality-sensitive%20hashing
n3:kontrolniKodProRIV
[ACF33C77646B]
n3:mistoKonaniAkce
Istanbul, Turkey
n3:mistoVydani
New York
n3:nazevZdroje
3rd International Conference on Similarity Search and Applications
n3:obor
n14:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
3
n3:projekt
n4:1M0545 n4:GAP103%2F10%2F0886 n4:GPP202%2F10%2FP220 n4:GA201%2F09%2F0683
n3:rokUplatneniVysledku
n11:2010
n3:tvurceVysledku
Kyselák, Martin Novák, David Zezula, Pavel
n3:typAkce
n9:WRD
n3:zahajeniAkce
2010-09-18+02:00
s:numberOfPages
8
n16:hasPublisher
ACM Press
n20:isbn
978-1-4503-0420-7
n6:organizacniJednotka
14330