By Topic

Passage Retrieval Using Graph Vertices Comparison

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Dkaki, T. ; Univ. de Toulouse, Toulouse ; Mothe, J. ; Quoc Dinh Truong

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.

Published in:

Signal-Image Technologies and Internet-Based System, 2007. SITIS '07. Third International IEEE Conference on

Date of Conference:

16-18 Dec. 2007