Iterative query selection for opaque search engines with pseudo relevance feedback

Maor Reuben, Aviad Elyashar, Rami Puzis

Research output: Contribution to journalArticlepeer-review

Abstract

Retrieving information from an online search engine is the first and most important step in many data mining tasks, such as fake news detection. Most of the search engines currently available on the web, including all social media platforms, are black-boxes (i.e., opaque) supporting short keyword queries. In these settings, it is challenging to retrieve all posts and comments discussing a particular news item automatically and on a large scale. In this paper, we propose a method for generating short keyword queries given a prototype document. The proposed iterative query selection (IQS) algorithm interacts with the opaque search engine to iteratively improve the query, by maximizing the number of relevant results retrieved. Our evaluation of IQS was performed on the Twitter TREC Microblog 2012 and TREC-COVID 2019 datasets and demonstrated the algorithm's superior performance compared to state-of-the-art. In addition, we implemented IQS algorithm to automatically collect a large-scale dataset for fake news detection task of about 70K true and fake news items. The dataset, which we have made publicly available to the research community, includes over 22M accounts and 61M tweets. We demonstrate the usefulness of the dataset for fake news detection task achieving state-of-the-art performance.

Original languageEnglish
Article number117027
JournalExpert Systems with Applications
Volume201
DOIs
StatePublished - 1 Sep 2022

Keywords

  • Fake news
  • Opaque search engine
  • Pseudo relevance feedback
  • Query selection

All Science Journal Classification (ASJC) codes

  • Engineering(all)
  • Computer Science Applications
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Iterative query selection for opaque search engines with pseudo relevance feedback'. Together they form a unique fingerprint.

Cite this