Zum Inhalt springen

Nur-Lesen-Fassung: Das Forschungsinformationssystem (FIS) ist aus Sicherheitsgründen vorübergehend durch diese Nur-Lesen-Fassung ersetzt. Alle öffentlichen Inhalte und Volltexte sind weiterhin abrufbar; Anmeldung, Bearbeitung, Einreichung und Statistiken stehen nicht zur Verfügung. Bei Fragen: fis@uni-bamberg.de

Start › Publikationen › Sample-based Creation of Peer Summaries for Efficient Similarity Search in Scalable Peer-to-Peer Networks

Publikation

Sample-based Creation of Peer Summaries for Efficient Similarity Search in Scalable Peer-to-Peer Networks

Blank, Daniel; El Allali, Soufyane; Müller, Wolfgang; u. a. (2007): Sample-based Creation of Peer Summaries for Efficient Similarity Search in Scalable Peer-to-Peer Networks, in: James Z. Wang, Nozha Boujemaa, Alberto Del Bimbo, u. a. (Hrsg.), MIR ’07 : Proceedings of the international workshop on Workshop on multimedia information retrieval, New York: ACM, S. 143–151, doi: 10.1145/1290082.1290104.

Details

Fakultät/Lehrstuhl
Autorin(nen)/Autor(en)
Blank, Daniel
El Allali, Soufyane
Titel des Sammelwerks
MIR '07 : Proceedings of the international workshop on Workshop on multimedia information retrieval
Herausgeberin(nen)/Herausgeber des Sammelwerks
Wang, James Z.
Boujemaa, Nozha
Bimbo, Alberto Del
Li, Jia
Konferenz
MM07: The 15th ACM International Conference on Multimedia 2007, September 24 - 29, 2007, Augsburg, Bavaria, Germany
Verlagsangabe
ACM : New York
Erscheinungsjahr
2007
ISBN
978-1-59593-778-0
Sprache(n)
Englisch
DOI
Abstract

In this paper we introduce a simple yet experimentally convincing approach in the research field of source selection for content-based similarity search in P2P networks or, more concretely, in summary-based P2P systems. In these systems, summaries are used for data source selection when performing k-NN queries on distributed collections of documents represented by feature vectors.

We introduce a new type of cluster-based summaries for source selection that can efficiently and cheaply be calculated and distributed in P2P networks. For the summaries generation, a very large number of sample points is used. Each peer in the network assigns its indexing data to their corresponding closest sample points and publishes its constructed summary. We evaluate the quality of these summaries when changing the number of sample points used in experiments on real-world image feature data obtained from a large crawl of the flickr web photo community and show that for higher numbers of sample points we achieve a better retrieval performance. Our experiments show that the proposed summaries yield four times better performance with respect to previous methods. Intuitively, there are some disadvantages to this approach due to the large size of the generated summaries. We show experimentally, that these disadvantages can easily be overcome due to the sparse nature of the generated summaries by simple compression techniques.

Freie Schlagwort(e)
P2P
CBIR
Source selection
Dokumenttyp
Konferenzveröffentlichung
URI
Datum der Freischaltung
24.09.2014, 24.09.2014

Permalink: https://fis.uni-bamberg.de/handle/uniba/16361 · Daten als JSON · Zitieren: BibTeX · RIS

Datenstand: 16.11.2026

Eingeschränkter Lesezugriff: Anmeldung, Bearbeitung und Einreichung sind vorübergehend deaktiviert.