Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Why Spectral Retrieval Works

Bast, H., & Majumdar, D. (2005). Why Spectral Retrieval Works. In Proceedings of SIGIR 2005 (SIGIR-05): the Twenty-Eighth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (pp. 11-18). New York, USA: ACM.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2843-3 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2844-1
Genre: Konferenzbeitrag

Dateien

einblenden: Dateien
ausblenden: Dateien
:
lsiexplained.pdf (beliebiger Volltext), 176KB
 
Datei-Permalink:
-
Name:
lsiexplained.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:
Bast, Holger1, Autor           
Majumdar, Debapriyo1, Autor           
Marchionini, Gary2, Herausgeber
Moffat, Alistair, Herausgeber
Tait, John, Herausgeber
Baeza-Yates, Ricardo, Herausgeber
Ziviani, Nivio, Herausgeber
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2Max Planck Society, ou_persistent13              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: We introduce the \emph{synonymy graph} as a new angle of looking at spectral retrieval techniques, including latent semantic indexing (LSI) and its many successors. The synonymy graph is defined for each pair of terms in the collection, and our findings suggest that it is at the heart of what makes spectral retrieval work in practice. % We show that LSI and many of its variants can be equivalently viewed as a particular document expansion (not query expansion) process, where each term effects the insertion of some other term if and only if the synonymy graph for that term pair has a certain characteristic shape. We provide a simple, parameterless algorithm for detecting that shape. % We point out inherent problems of every algorithm that bases its expansion decisions merely on individual values of the synonymy graph, as done by almost all existing methods. Our new algorithm overcomes these limitations, and it consistently outperforms previous methods on a number of test collections. % Our synonymy graphs also shed light on the effectiveness of three fundamental types of variations of the basic LSI scheme.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2006-03-202005
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: New York, USA : ACM
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 279199
Anderer: Local-ID: C1256428004B93B8-ADC0E49B750350FBC1256FE3003F05CA-bastmajumdar05sigir
 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: Proceedings of SIGIR 2005 (SIGIR-05) : the Twenty-Eighth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
Genre der Quelle: Konferenzband
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: New York, USA : ACM
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 11 - 18 Identifikator: ISBN: 1-58113-881-4