Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Efficient and Self-Tuning Incremental Query Expansion for Top-k Query Processing

Theobald, M., Schenkel, R., & Weikum, G. (2005). Efficient and Self-Tuning Incremental Query Expansion for Top-k Query Processing. In 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2005) (pp. 242-249). New York, USA: ACM.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2659-5 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-265A-3
Genre: Konferenzbeitrag

Dateien

einblenden: Dateien
ausblenden: Dateien
:
TheobaldSTW.pdf (beliebiger Volltext), 521KB
 
Datei-Permalink:
-
Name:
TheobaldSTW.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:
Theobald, Martin1, Autor           
Schenkel, Ralf1, Autor           
Weikum, Gerhard1, Autor           
Baeza-Yates, Ricardo A., Herausgeber
Ziviani, Nivio, Herausgeber
Marchionini, Gary, Herausgeber
Moffat, Alistair, Herausgeber
Tait, John, Herausgeber
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: We present a novel approach for efficient and self-tuning query expansion that is embedded into a top-k query processor with candidate pruning. Traditional query expansion methods select expansion terms whose thematic similarity to the original query terms is above some specified threshold, thus generating a disjunctive query with much higher dimensionality. This poses three major problems: 1) the need for hand-tuning the expansion threshold, 2) the potential topic dilution with overly aggressive expansion, and 3) the drastically increased execution cost of a high-dimensional query. The method developed in this paper addresses all three problems by dynamically and incrementally merging the inverted lists for the potential expansion terms with the lists for the original query terms. A priority queue is used for maintaining result candidates, the pruning of candidates is based on Fagin's family of top-k algorithms, and optionally probabilistic estimators of candidate scores can be used for additional pruning. Experiments on the TREC collections for the 2004 Robust and Terabyte tracks demonstrate the increased efficiency, effectiveness, and scalability of our approach.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2006-04-142005
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: New York, USA : ACM
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 278885
Anderer: Local-ID: C1256DBF005F876D-5AD4A59C97D8DFFAC1256FE0002DD302-TheobaldSW05
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: Untitled Event
Veranstaltungsort: Salvador, Brazil
Start-/Enddatum: 2005-08-15

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2005)
Genre der Quelle: Konferenzband
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: New York, USA : ACM
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 242 - 249 Identifikator: ISBN: 1-59593-034-5