Passage Retrieval Using Graph Vertices Comparison

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.