Abstract
Nowadays, it is very rare to find a single news article that solely contains all the information about a certain subject or event. Very recently, a number of methods were proposed to find background articles that can be linked to a query article to help readers understand its context, whenever they are reading it. These methods, however, are still far from reaching an optimal performance. In my thesis, I propose techniques that aim to improve the background linking process for online news articles. For example, I propose to exploit different techniques to construct representative search queries from the query article, that be can effectively employed to retrieve the required background links in an ad-hoc setting. Moreover, I aim to study how to train neural models that can learn the background relevance between pairs of articles. Through the proposed techniques, I aim to experiment with the possible criteria that may distinguish useful background articles from non-relevant ones, such as their semantic and lexical similarities, and the granularity of the topics discussed in each. Defining these criteria will enable understanding the notion of background relevance, and accordingly allow for effective background links retrieval.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Azad, H.K., Deepak, A.: A new approach for query expansion using wikipedia and wordnet. Inf. Sci. 492, 147–163 (2019)
Bimantara, A., et al.: htw saar @ TREC 2018 news track (2018)
Ding, Y., Lian, X., Zhou, H., Liu, Z., Ding, H., Hou, Z.: ICTNET at TREC 2019 news track (2019)
Duari, S., Bhatnagar, V.: Complex network based supervised keyword extractor. Expert Syst. Appl. 140, 112876 (2020)
Essam, M., Elsayed, T.: bigIR at TREC 2019: Graph-based analysis for news background linking (2019)
Essam, M., Elsayed, T.: Why is that a background article: a qualitative analysis of relevance for news background linking. In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, pp. 2009–2012 (2020)
Foley, J., Montoly, A., Pena, M.: Smith at TREC2019: Learning to rank background articles with poetry categories and keyphrase extraction (2019)
Hamborg, F., Breitinger, C., Gipp, B.: Giveme5w1h: a universal system for extracting main events from news articles. In: Proceedings of the 13th ACM Conference on Recommender Systems, 7th International Workshop on News Recommendation and Analytics (INRA 2019), September 2019
Lopez-Ubeda, P., Diaz-Galiano, M.C., Valdivia, M.T.M., Urena-Lopez, L.A.: Using clustering to filter results of an information retrieval system (2018)
Lu, K., Fang, H.: Leveraging entities in background document retrieval for news articles (2019)
Missaoui, S., MacFarlane, A., Makri, S., Gutierrez-Lopez, M.: DMINR at TREC news track (2019)
Nasir, J.A., Varlamis, I., Ishfaq, S.: A knowledge-based semantic framework for query expansion. Inf. Process. Manag. 56(5), 1605–1617 (2019)
Nogueira, R., Cho, K.: Passage re-ranking with BERT. arXiv preprint arXiv:1901.04085 (2019)
Qiu, X., Sun, T., Xu, Y., Shao, Y., Dai, N., Huang, X.: Pre-trained models for natural language processing: a survey. arXiv preprint arXiv:2003.08271 (2020)
Qu, J., Wang, Y.: UNC SILS at TREC 2019 news track (2019)
Soboroff, I., Huang, S., Harman, D.: TREC 2018 news track overview. In: TREC (2018)
Soboroff, I., Huang, S., Harman, D.: TREC 2019 news track overview. In: TREC (2019)
Xiao, W., Carenini, G.: Extractive summarization of long documents by combining global and local context. arXiv preprint arXiv:1909.08089 (2019)
Yang, P., Lin, J.: Anserini at TREC 2018: Centre, common core, and news tracks (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Essam, M. (2021). Background Linking of News Articles. In: Hiemstra, D., Moens, MF., Mothe, J., Perego, R., Potthast, M., Sebastiani, F. (eds) Advances in Information Retrieval. ECIR 2021. Lecture Notes in Computer Science(), vol 12657. Springer, Cham. https://doi.org/10.1007/978-3-030-72240-1_79
Download citation
DOI: https://doi.org/10.1007/978-3-030-72240-1_79
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-72239-5
Online ISBN: 978-3-030-72240-1
eBook Packages: Computer ScienceComputer Science (R0)