Selectively Expanding Queries and Documents for News Background Linking
Abstract
Background articles are crucial for readers to grasp the context of news stories fully. However, existing approaches of background article search tend to apply a single ranking method to all types of search topics. In this paper, we focus on exploring search topics on news articles by classifying them into two types:time-sensitive andnon-time-sensitive. To verify whether or not these two types of search topics can benefit from different retrieving methods, we examined a suite of strategies such as document expansion, query rewriting, and semantic re-ranking. Moreover, the relationship between background articles and topics is verified by the two strategies of document expansion (specificity and diversity). The experimental results demonstrate that the optimal usage of the aforementioned strategies is indeed different between the two types of search topics. Furthermore, our in-depth analysis of topics and search results verified that: time-sensitive topics benefit from background articles that can provide more specific knowledge, while non-time-sensitive topics benefit from diversified retrieved documents.
Supplementary Material
Presentation video - short version
- Download
- 37.60 MB
References
[1]
Oluwaseun Ajao, Deepayan Bhowmik, and Shahrzad Zargari. 2018. Fake news identification on twitter with hybrid cnn and rnn models. In Proceedings of the 9th international conference on social media and society. 226--230.
[2]
Ali Eren Ak, Çaghan Köksal, Kenan Fayoumi, and Reyyan Yeniterzi. 2020. SUNLP at TREC NEWS 2020. In Proceedings of the Twenty-Ninth Text REtrieval Conference, TREC 2020, Virtual Event [Gaithersburg, Maryland, USA], November 16--20, 2020 (NIST Special Publication, Vol. 1266), Ellen M. Voorhees and Angela Ellis (Eds.). National Institute of Standards and Technology (NIST). https://trec. nist.gov/pubs/trec29/papers/SUNLP.N.pdf
[3]
Naif Alotaibi. 2017. Online news : a study of 'credibility' in the context of the Saudi news media.
[4]
Marina Azer, Mohamed Taha, Hala H Zayed, and Mahmoud Gadallah. 2021. Credibility Detection on Twitter News Using Machine Learning Approach. International Journal of Intelligent Systems and Applications 13, 3 (2021), 1--10.
[5]
Agra Bimantara, Michelle Blau, Kevin Engelhardt, Johannes Gerwert, Tobias Gottschalk, Philipp Lukosz, Shenna Piri, Nima Saken Shaft, and Klaus Berberich. 2018. htw saar @ TREC 2018 News Track. In Proceedings of the Twenty-Seventh Text REtrieval Conference, TREC 2018, Gaithersburg, Maryland, USA, November 14--16, 2018 (NIST Special Publication, Vol. 500--331), Ellen M. Voorhees and Angela Ellis (Eds.). National Institute of Standards and Technology (NIST). https://trec. nist.gov/pubs/trec27/papers/htwsaar-N.pdf
[6]
Florian Boudin. 2018. Unsupervised Keyphrase Extraction with Multipartite Graphs. https://doi.org/10.48550/ARXIV.1803.08721
[7]
Luis Adrián Cabrera-Diego, Emanuela Boros, and Antoine Doucet. 2022. Elastic Embedded Background Linking for News Articles with Keywords, Entities and Events. https://doi.org/10.5281/zenodo.6334523
[8]
Steve Cronen-Townsend, Yun Zhou, and W Bruce Croft. 2004. A framework for selective query expansion. In Proceedings of the thirteenth ACM international conference on Information and knowledge management. 236--237.
[9]
Nathan Day, DanWorley, and Tim Allison. 2020. OSC at TREC 2020 - News track's Background Linking Task. In Proceedings of the Twenty-Ninth Text REtrieval Conference, TREC 2020, Virtual Event [Gaithersburg, Maryland, USA], November 16--20, 2020 (NIST Special Publication, Vol. 1266), Ellen M. Voorhees and Angela Ellis (Eds.). National Institute of Standards and Technology (NIST). https://trec. nist.gov/pubs/trec29/papers/OSC.N.pdf
[10]
Anup Anand Deshmukh and Udhav Sethi. 2020. IR-BERT: Leveraging BERT for Semantic Search in Background Linking for News Articles. CoRR abs/2007.12603 (2020). arXiv:2007.12603 https://arxiv.org/abs/2007.12603
[11]
Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. arXiv:1810.04805 [cs.CL]
[12]
Björn Engelmann and Philipp Schaer. 2021. IRCologne at TREC 2021 News Track - Relation-based re-ranking for background linking. In TREC. National Institute of Standards and Technology (NIST).
[13]
Marwa Essam and Tamer Elsayed. 2019. bigIR at TREC 2019: Graph-based Analysis for News Background Linking. In TREC. https://trec.nist.gov/pubs/trec28/papers/QU.N.pdf
[14]
Marwa Essam and Tamer Elsayed. 2020. Why is That a Background Article: A Qualitative Analysis of Relevance for News Background Linking. Association for Computing Machinery, New York, NY, USA, 2009--2012. https://doi.org/10.1145/3340531.3412120
[15]
Andy Garron and April Kontostathis. 2011. Latent Semantic Indexing with Selective Query Expansion. In TREC. Citeseer. https://trec.nist.gov/pubs/trec20/papers/Ursinus.legal.update.pdf
[16]
Ornella Irrera and Gianmaria Silvello. 2021. Background Linking: Joining Entity Linking with Learning to Rank Models. In Proceedings of the 17th Italian Research Conference on Digital Libraries, Padua, Italy (virtual event due to the Covid-19 pandemic), February 18--19, 2021 (CEUR Workshop Proceedings, Vol. 2816), Dennis Dosso, Stefano Ferilli, Paolo Manghi, Antonella Poggi, Giuseppe Serra, and Gianmaria Silvello (Eds.). CEUR-WS.org, 64--77. http://ceur-ws.org/Vol-2816/paper6.pdf
[17]
Pavel Khloponin and Leila Kosseim. 2020. The CLaC System at the TREC 2020 News Track. In Proceedings of the Twenty-Ninth Text REtrieval Conference, TREC 2020, Virtual Event [Gaithersburg, Maryland, USA], November 16--20, 2020 (NIST Special Publication, Vol. 1266), Ellen M. Voorhees and Angela Ellis (Eds.). National Institute of Standards and Technology (NIST). https://trec.nist.gov/pubs/trec29/ papers/CLaC.N.pdf
[18]
Kuang Lu and Hui Fang. 2018. Paragraph as Lead - Finding Background Documents for News Articles. In Proceedings of the Twenty-Seventh Text REtrieval Conference, TREC 2018, Gaithersburg, Maryland, USA, November 14--16, 2018 (NIST Special Publication, Vol. 500--331), Ellen M. Voorhees and Angela Ellis (Eds.). National Institute of Standards and Technology (NIST). https://trec.nist.gov/pubs/trec27/papers/udel_fang-N.pdf
[19]
Kuang Lu and Hui Fang. 2019. Leveraging Entities in Background Document Retrieval for News Articles. In Proceedings of the Twenty-Eighth Text REtrieval Conference, TREC 2019, Gaithersburg, Maryland, USA, November 13--15, 2019 (NIST Special Publication, Vol. 1250), Ellen M. Voorhees and Angela Ellis (Eds.). National Institute of Standards and Technology (NIST). https://trec.nist.gov/pubs/trec28/papers/udel_fang.N.pdf
[20]
Sondess Missaoui, Andrew MacFarlane, Stephann Makri, and Marisela Gutierrez- Lopez. 2019. DMINR at TREC News Track. In Proceedings of the Twenty-Eighth Text REtrieval Conference, TREC 2019, Gaithersburg, Maryland, USA, November 13--15, 2019 (NIST Special Publication, Vol. 1250), Ellen M. Voorhees and Angela Ellis (Eds.). National Institute of Standards and Technology (NIST). https://trec.nist.gov/pubs/trec28/papers/cityuni.News.pdf
[21]
An Nguyen and Mark Western. 2006. The Complementary Relationship between the Internet and Traditional Mass Media: The Case of Online News and Information. Information Research: An International Electronic Journal 11, 3 (2006), n3.
[22]
Rodrigo Nogueira and Jimmy Lin. 2019. From doc2query to docTTTTTquery. https://cs.uwaterloo.ca/~jimmylin/publications/Nogueira_Lin_2019_docTTTTTquery-v2.pdf
[23]
Rodrigo Nogueira, Wei Yang, Jimmy Lin, and Kyunghyun Cho. 2019. Document Expansion by Query Prediction. arXiv:1904.08375 [cs.IR]
[24]
Reid Smith, Pamela Snow, Tanya Serry, and Lorraine Hammond. 2021. The Role of Background Knowledge in Reading Comprehension: A Critical Review. Reading Psychology 42, 3 (2021), 214--240. https://doi.org/10.1080/02702711.2021.1888348
[25]
Ian Soboroff, Shudong Huang, and Donna K. Harman. 2020. TREC 2020 News Track Overview. In TREC.
Index Terms
- Selectively Expanding Queries and Documents for News Background Linking
Recommendations
Queries as anchors: selection by association
HYPERTEXT '05: Proceedings of the sixteenth ACM conference on Hypertext and hypermediaThis paper introduces a new method for linking the world view of the search engine user community with that of the search engine itself. This new method is based on collecting and aggregating associative query trails in the form of query reformulation ...
Clicked phrase document expansion for sponsored search ad retrieval
SIGIR '10: Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrievalWe present a document expansion approach that uses Conditional Random Field (CRF) segmentation to automatically extract salient phrases from ad titles. We then supplement the ad document with query segments that are probable translations of the document ...
Neural Document Expansion with User Feedback
ICTIR '19: Proceedings of the 2019 ACM SIGIR International Conference on Theory of Information RetrievalThis paper presents a neural document expansion approach (NeuDEF) that enriches document representations for neural ranking models. NeuDEF harvests expansion terms from queries which lead to clicks on the document and weights these expansion terms with ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
October 2022
5274 pages
Copyright © 2022 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 17 October 2022
Check for updates
Author Tags
Qualifiers
- Short-paper
Conference
CIKM '22: The 31st ACM International Conference on Information and Knowledge Management
October 17 - 21, 2022
GA, Atlanta, USA
Acceptance Rates
CIKM '22 Paper Acceptance Rate 621 of 2,257 submissions, 28%;
Overall Acceptance Rate 1,861 of 8,427 submissions, 22%
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 77Total Downloads
- Downloads (Last 12 months)20
- Downloads (Last 6 weeks)1
Reflects downloads up to 14 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in