Graph-based Hierarchical Relevance Matching Signals for Ad-hoc Retrieval
arXiv:2102.11127 · doi:10.1145/3442381.3450115
Abstract
The ad-hoc retrieval task is to rank related documents given a query and a document collection. A series of deep learning based approaches have been proposed to solve such problem and gained lots of attention. However, we argue that they are inherently based on local word sequences, ignoring the subtle long-distance document-level word relationships. To solve the problem, we explicitly model the document-level word relationship through the graph structure, capturing the subtle information via graph neural networks. In addition, due to the complexity and scale of the document collections, it is considerable to explore the different grain-sized hierarchical matching signals at a more general level. Therefore, we propose a Graph-based Hierarchical Relevance Matching model (GHRM) for ad-hoc retrieval, by which we can capture the subtle and general hierarchical matching signals simultaneously. We validate the effects of GHRM over two representative ad-hoc retrieval benchmarks, the comprehensive experiments and results demonstrate its superiority over state-of-the-art methods.
To appear at WWW 2021
References in corpus (9)
- Session-based Recommendation with Graph Neural Networks
- A Deep Relevance Matching Model for Ad-hoc Retrieval
- End-to-End Neural Ad-hoc Ranking with Kernel Pooling
- Deeper Text Understanding for IR with Contextual Neural Language Modeling
- CEDR: Contextualized Embeddings for Document Ranking
- Fi-GNN: Modeling Feature Interactions via Graph Neural Networks for CTR Prediction
- DeepRank: A New Deep Architecture for Relevance Ranking in Information Retrieval
- Personalized Graph Neural Networks with Attention Mechanism for Session-Aware Recommendation
- Multiresolution Graph Attention Networks for Relevance Matching