The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
A Deep Relevance Matching Model for Ad-hoc Retrieval
Open accessAbstract
In recent years, deep neural networks have led to exciting breakthroughs in speech recognition, computer vision, and natural language processing (NLP) tasks. However, there have been few positive results of deep models on ad-hoc retrieval tasks. This is partially due to the fact that many important characteristics of the ad-hoc retrieval task have not been well addressed in deep models yet. Typically, the ad-hoc retrieval task is formalized as a matching problem between two pieces of text in existing work using deep models, and treated equivalent to many NLP tasks such as paraphrase identification, question answering and automatic conversation. However, we argue that the ad-hoc retrieval task is mainly about relevance matching while most NLP matching tasks concern semantic matching, and there are some fundamental differences between these two matching tasks. Successful relevance matching requires proper handling of the exact matching signals, query term importance, and diverse matching requirements. In this paper, we propose a novel deep relevance matching model (DRMM) for ad-hoc retrieval. Specifically, our model employs a joint deep architecture at the query term level for relevance matching. By using matching histogram mapping, a feed forward matching network, and a term gating network, we can effectively deal with the three relevance matching factors mentioned above. Experimental results on two representative benchmark collections show that our model can significantly outperform some well-known retrieval models as well as state-of-the-art deep matching models.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Glove: Global Vectors for Word Representation
Pennington, J., Socher, R., & Manning, C. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1162 · Cited by 34,071
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892
Distributed Representations of Words and Phrases and their Compositionality
Mikolov, T., Sutskever, I., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1310.4546 · Cited by 24,533
Hinton, G., Deng, L., Yu, D., Dahl, G., Mohamed, A.-R., Jaitly, N., Senior, A., Vanhoucke, V., Nguyen, P., Sainath, T., et al. (2012) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2205597 · Cited by 10,260
(2010) · Cited by 8,261
Convolutional networks for images, speech, and time series
LeCun, Y., & Bengio, Y. (1998) · HAL (Le Centre pour la Communication Scientifique Directe) · doi:10.5555/303568.303704 · Cited by 4,231
A Convolutional Neural Network for Modelling Sentences
Kalchbrenner, N., Grefenstette, E., & Blunsom, P. (2014) · Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.3115/v1/p14-1062 · Cited by 3,601
Learning to rank using gradient descent
Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., & Hullender, G. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102363 · Cited by 2,836 · cited 2×
“LogCount-based Histogram (LCH): We apply logarithm over the count value in each bin, both to reduce the range, and to allow our model to more easily learn multiplicative relationships [1].”
BackgroundMethodLearning deep structured semantic models for web search using clickthrough data
Huang, P.-S., He, X., Gao, J., Deng, L., Acero, A., & Heck, L. (2013) · Proceedings of the 22nd ACM international conference on Information & Knowledge Management · doi:10.1145/2505515.2505665 · Cited by 2,009
A Study of Smoothing Methods for Language Models Applied to Ad Hoc Information Retrieval
Zhai, C., & Lafferty, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130377 · Cited by 1,537
Some Simple Effective Approximations to the 2-Poisson Model for Probabilistic Weighted Retrieval
Robertson, S. E., & Walker, S. (1994) · SIGIR ’94 · doi:10.1007/978-1-4471-2099-5_24 · Cited by 1,477
Overfitting in Neural Nets: Backpropagation, Conjugate Gradient, and Early Stopping
Caruana, R., Lawrence, S., & Giles, C. L. (2000) · neural information processing systems · Cited by 1,318
Convolutional Neural Network Architectures for Matching Natural Language Sentences
Hu, B., Lu, Z., Li, H., & Chen, Q. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1503.03244 · Cited by 1,098
A study of smoothing methods for language models applied to Ad Hoc information retrieval
Zhai, C., & Lafferty, J. (2001) · Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/383952.384019 · Cited by 889
Dynamic Pooling and Unfolding Recursive Autoencoders for Paraphrase Detection
Socher, R., Huang, E., Pennin, J., Manning, C. D., & Ng, A. Y. (2011) · neural information processing systems · Cited by 782
A comparison of statistical significance tests for information retrieval evaluation
Smucker, M. D., Allan, J., & Carterette, B. (2007) · Proceedings of the sixteenth ACM conference on Conference on information and knowledge management · doi:10.1145/1321440.1321528 · Cited by 718
Learning semantic representations using convolutional neural networks for web search
Shen, Y., He, X., Gao, J., Deng, L., & Mesnil, G. (2014) · Proceedings of the 23rd International Conference on World Wide Web · doi:10.1145/2567948.2577348 · Cited by 670
Viewing morphology as an inference process
Krovetz, R. (1993) · Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '93 · doi:10.1145/160688.160718 · Cited by 656
Text Matching as Image Recognition
Pang, L., Lan, Y., Guo, J., Xu, J., Wan, S., & Cheng, X. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10341 · Cited by 526
Self-citationShort Text Similarity with Word Embeddings
Kenter, T., & de Rijke, M. (2015) · Proceedings of the 24th ACM International on Conference on Information and Knowledge Management · doi:10.1145/2806416.2806475 · Cited by 440
A Convolutional Neural Network for Modelling Sentences
Kalchbrenner, N., Grefenstette, E., & Blunsom, P. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1404.2188 · Cited by 407
A formal study of information retrieval heuristics
Fang, H., Tao, T., & Zhai, C. (2004) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1008992.1009004 · Cited by 361
Adaptive Subgradient Methods for Online Learning and Stochastic Optimization
(2011) · Journal of Machine Learning Research · doi:10.5555/1953048.2021068 · Cited by 346
A Deep Architecture for Semantic Matching with Multiple Positional Sentence Representations
Wan, S., Lan, Y., Guo, J., Xu, J., Pang, L., & Cheng, X. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10342 · Cited by 322
Self-citationConvolutional neural tensor network architecture for community-based question answering
Qiu, X., & Huang, X. (2015) · International Conference on Artificial Intelligence · Cited by 284
Efficient and effective spam filtering and re-ranking for large web datasets
Cormack, G. V., Smucker, M. D., & Clarke, C. L. A. (2011) · Information Retrieval · doi:10.1007/s10791-011-9162-z · Cited by 282
A Deep Architecture for Matching Short Texts
Lu, Z., & Li, H. (2013) · neural information processing systems · Cited by 278
Modeling Interestingness with Deep Neural Networks
Gao, J., Pantel, P., Gamon, M., He, X., & Deng, L. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1002 · Cited by 165
Match-SRNN: Modeling the Recursive Matching Structure with Spatial RNNPreprint
Wan, S., Lan, Y., Xu, J., Guo, J., Pang, L., & Cheng, X. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1604.04378 · Cited by 162
Self-citationSemantic term matching in axiomatic approaches to information retrieval
Fang, H., & Zhai, C. (2006) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1148170.1148193 · Cited by 136
Learning to Reweight Terms with Distributed Representations
Zheng, G., & Callan, J. (2015) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2766462.2767700 · Cited by 120
Diagnostic Evaluation of Information Retrieval Models
Fang, H., Tao, T., & Zhai, C. (2011) · ACM Transactions on Information Systems · doi:10.1145/1961209.1961210 · Cited by 120
MultiGranCNN: An Architecture for General Matching of Text Chunks on Multiple Levels of Granularity
Yin, W., & Schütze, H. (2015) · doi:10.3115/v1/p15-1007 · Cited by 76
Syntax-based Deep Matching of Short TextsPreprint
Wang, M., Lu, Z., Li, H., & Liu, Q. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1503.02427 · Cited by 66
Cited by
XLNet: Generalized Autoregressive Pretraining for Language Understanding
Yang, Z., Dai, Z., Yang, Y., Carbonell, J., Salakhutdinov, R., & Le, Q. V. (2019) · arXiv · doi:10.48550/arxiv.1906.08237 · Cited by 6,687
A Survey of the Usages of Deep Learning for Natural Language Processing
Otter, D. W., Medina, J. R., & Kalita, J. K. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2979670 · Cited by 1,836
ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERT
Khattab, O., & Zaharia, M. (2020) · Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3397271.3401075 · Cited by 1,301
“Over the past few years, the Information Retrieval (IR) community has witnessed the introduction of a host of neural ranking models, including DRMM [8], KNRM [5, 36], and Duet [21, 23].”
BackgroundNogueira, R., & Cho, K. (2019) · arXiv · doi:10.48550/arxiv.1901.04085 · Cited by 615
“The information retrieval (IR) community has also experienced a flourishing development of neural ranking models, such as DRMM (Guo et al., 2016), KNRM (Xiong et al., 2017), Co-PACRR (Hui et al., 2018), and DUET (Mitra et al., 2017).”
MethodEnd-to-End Neural Ad-hoc Ranking with Kernel Pooling
Xiong, C., Dai, Z., Callan, J., Liu, Z., & Power, R. (2017) · Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3077136.3080809 · Cited by 546
Metadata
- Authors
- Guo, J., Fan, Y., Ai, Q., & Croft, W. B.
- Venue
- Proceedings of the 25th ACM International on Conference on Information and Knowledge Management
- Publisher
- ACM
- Published
- 2016-10-24
- Pages
- 55-64
- OpenAlex
- W2536015822
- Cited by
- 806
- References
- 34
- FWCI
- 73.51
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.