DocumentCode
2757562
Title
Passage Retrieval Using Graph Vertices Comparison
Author
Dkaki, Taoufiq ; Mothe, Josiane ; Truong, Quoc Dinh
Author_Institution
Univ. de Toulouse, Toulouse
fYear
2007
fDate
16-18 Dec. 2007
Firstpage
71
Lastpage
76
Abstract
In this paper, we describe an Information retrieval Model based on graph comparison. It is inspired from previous work such as KleinbergpsilaHits and Blondel et al.psilas model. Unlike previous methods, our model considers different types of nodes: text nodes (elements to retrieve and query) and term nodes, so that the resulting graph is a bipartite graph. The results on passage retrieval task show that high precision is improved using this model.
Keywords
information retrieval; bipartite graph; graph vertices; information retrieval model; passage retrieval; term nodes; text nodes; Bipartite graph; Context modeling; Feedback; Humans; Information retrieval; Internet; Lead; Libraries; SGML; XML; IR model; Information retrieval; graph based model; passage retrieval;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal-Image Technologies and Internet-Based System, 2007. SITIS '07. Third International IEEE Conference on
Conference_Location
Shanghai
Print_ISBN
978-0-7695-3122-9
Type
conf
DOI
10.1109/SITIS.2007.82
Filename
4618760
Link To Document