Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Efficient peer-to-peer semantic overlay networks based on statistical language models

Linari, A., & Weikum, G. (2006). Efficient peer-to-peer semantic overlay networks based on statistical language models. In P2PIR '06: Proceedings of the International Workshop on Information Retrieval in Peer-to-peer Networks (pp. 9-16). New York, USA: ACM.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-22AA-F Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-22AB-D
Genre: Konferenzbeitrag

Dateien

einblenden: Dateien
ausblenden: Dateien
:
linariW06.pdf (beliebiger Volltext), 581KB
 
Datei-Permalink:
-
Name:
linariW06.pdf
Beschreibung:
-
OA-Status:
Sichtbarkeit:
Privat
MIME-Typ / Prüfsumme:
application/pdf
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
-
Lizenz:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Linari, Alessandro1, Autor           
Weikum, Gerhard1, Autor           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: In this paper we address the query routing problem in peer-to-peer ({P2P}) information retrieval. Our system builds up on the idea of a {S}emantic {O}verlay {N}etwork ({SON}), in which each peer becomes neighbor of a small number of peers, chosen among those that are most similar to it. Peers in the network are represented by a statistical Language Model derived from their local data collections but, instead of using the non-metric Kullback-Leibler divergence to compute the similarity between them, we use a symmetrized and "metricized" related measure, the square root of the Jensen-Shannon divergence, which let us map the problem to a metric search problem. The search strategy exploits the triangular inequality to efficiently prune the search space and relies on a priority queue to visit the most promising peers first. To keep communications costs low and to perform an efficient comparison between Language Models, we devise a compression technique that builds on Bloom-filters and histograms and we provide error bounds for the approximation and a cost analysis for the algorithms used to build and maintain the {SON}.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2007-04-042006
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: New York, USA : ACM
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 314607
Anderer: Local-ID: C1256DBF005F876D-6216642A2948F841C125726700528F1C-LinariW06
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: Untitled Event
Veranstaltungsort: Arlington, Virginia, USA
Start-/Enddatum: 2006-11-11

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: P2PIR '06: Proceedings of the International Workshop on Information Retrieval in Peer-to-peer Networks
Genre der Quelle: Konferenzband
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: New York, USA : ACM
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 9 - 16 Identifikator: ISBN: 1-59593-527-4