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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n21http://localhost/temp/predkladatel/
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F13%3A00065750%21RIV14-MV0-14330___/
n17http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n14http://linked.opendata.cz/resource/domain/vavai/projekt/
n19http://linked.opendata.cz/resource/domain/vavai/subjekt/
n16http://linked.opendata.cz/ontology/domain/vavai/
rdfshttp://www.w3.org/2000/01/rdf-schema#
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/licencniPoplatek/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/vyuzitiJinymSubjektem/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n12http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F13%3A00065750%21RIV14-MV0-14330___
rdf:type
n16:Vysledek skos:Concept
rdfs:seeAlso
http://disa.fi.muni.cz/results/software/ppp-codes/
dcterms:description
Many current applications need to organize data with respect to mutual similarity between data objects (for instance biometric systems). A typical general strategy to retrieve the most similar objects to a given example is to access and then refine a candidate set of objects; the overall search costs (and search time) then typically correlate with the candidate set size. The PPP-Codes index provides a generic approach that combines several independent indexes by aggregating their candidate sets in such a way that the resulting candidate set can be one or two orders of magnitude smaller (while keeping the answer quality). This achievement comes at the expense of higher computational costs of the ranking algorithm but our experiments on various datasets indicate that the overall gain can be significant, especially for data types with large objects or expensive similarity function such as biometric systems. Many current applications need to organize data with respect to mutual similarity between data objects (for instance biometric systems). A typical general strategy to retrieve the most similar objects to a given example is to access and then refine a candidate set of objects; the overall search costs (and search time) then typically correlate with the candidate set size. The PPP-Codes index provides a generic approach that combines several independent indexes by aggregating their candidate sets in such a way that the resulting candidate set can be one or two orders of magnitude smaller (while keeping the answer quality). This achievement comes at the expense of higher computational costs of the ranking algorithm but our experiments on various datasets indicate that the overall gain can be significant, especially for data types with large objects or expensive similarity function such as biometric systems.
dcterms:title
PPP-Codes: Similarity Search Index PPP-Codes: Similarity Search Index
skos:prefLabel
PPP-Codes: Similarity Search Index PPP-Codes: Similarity Search Index
skos:notation
RIV/00216224:14330/13:00065750!RIV14-MV0-14330___
n16:predkladatel
n19:orjk%3A14330
n3:aktivita
n9:P
n3:aktivity
P(VG20122015073)
n3:dodaniDat
n12:2014
n3:domaciTvurceVysledku
n17:3445771
n3:druhVysledku
n10:R
n3:duvernostUdaju
n15:S
n3:ekonomickeParametry
Software je využíván zejména vědeckou komunitou. Umožňuje vlastníkovi a jiným uživatelům vybudovat index pro podobnostní vyhledávání v různorodých datech na základě podobnosti. Index je navržen tak, aby silně redukoval kandidátní množinu vracených objektů a proto je velmi efektivní zejména pro datové typy s většími objekty nebo dražší podobnostní funkcí.
n3:entitaPredkladatele
n11:predkladatel
n3:idSjednocenehoVysledku
98151
n3:idVysledku
RIV/00216224:14330/13:00065750
n3:interniIdentifikace
PPP-Codes
n3:jazykVysledku
n20:eng
n3:klicovaSlova
PPP-Codes; similarity search; metric space; index
n3:klicoveSlovo
n7:index n7:similarity%20search n7:metric%20space n7:PPP-Codes
n3:kontrolniKodProRIV
[D71F1ACD2384]
n3:licencniPoplatek
n4:N
n3:obor
n6:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n14:VG20122015073
n3:rokUplatneniVysledku
n12:2013
n3:technickeParametry
Pro využití softwaru je nutné postupovat podle licence GNU GPL. Odpovědná osoba pro jednání: David Novák, Fakulta informatiky, Masarykova univerzita, Botanická 68a, Brno, 602 00, david.novak@fi.muni.cz, tel. 549495062
n3:tvurceVysledku
Novák, David
n3:vlastnik
n11:vlastnikVysledku
n3:vyuzitiJinymSubjektem
n5:A
n21:organizacniJednotka
14330