Search results diversification in competitive search

• URL: http://arxiv.org/abs/2501.14922v1
• Date: Fri, 24 Jan 2025 21:13:45 GMT
• Title: Search results diversification in competitive search
• Authors: Tommy Mordo, Itamar Reinman, Moshe Tennenholtz, Oren Kurland,
• Abstract summary: We study ranking functions that integrate a results-diversification aspect. We show that the competitive search setting with diversity-based ranking has an equilibrium.
• Score: 11.398498369228571
• License:
• Abstract: In Web retrieval, there are many cases of competition between authors of Web documents: their incentive is to have their documents highly ranked for queries of interest. As such, the Web is a prominent example of a competitive search setting. Past work on competitive search focused on ranking functions based solely on relevance estimation. We study ranking functions that integrate a results-diversification aspect. We show that the competitive search setting with diversity-based ranking has an equilibrium. Furthermore, we theoretically and empirically show that the phenomenon of authors mimicking content in documents highly ranked in the past, which was demonstrated in previous work, is mitigated when search results diversification is applied.

Related papers

• PseudoSeer: a Search Engine for Pseudocode [18.726136894285403]
  A novel pseudocode search engine is designed to facilitate efficient retrieval and search of academic papers containing pseudocode. By leveraging snippets, the system enables users to search across various facets of a paper, such as the title, abstract, author information, and code snippets. A weighted BM25-based ranking algorithm is used by the search engine, and factors considered when prioritizing search results are described.
  arXiv  Detail & Related papers  (2024-11-19T16:58:03Z)
• Taxonomy-guided Semantic Indexing for Academic Paper Search [51.07749719327668]
  TaxoIndex is a semantic index framework for academic paper search. It organizes key concepts from papers as a semantic index guided by an academic taxonomy. It can be flexibly employed to enhance existing dense retrievers.
  arXiv  Detail & Related papers  (2024-10-25T00:00:17Z)
• Query-oriented Data Augmentation for Session Search [71.84678750612754]
  We propose query-oriented data augmentation to enrich search logs and empower the modeling. We generate supplemental training pairs by altering the most important part of a search context. We develop several strategies to alter the current query, resulting in new training data with varying degrees of difficulty.
  arXiv  Detail & Related papers  (2024-07-04T08:08:33Z)
• Examining bias perpetuation in academic search engines: an algorithm audit of Google and Semantic Scholar [0.0]
  This study examines whether confirmation biased queries prompted into Google Scholar will yield results aligned with a query's bias. Technology-related queries displaying more significant disparities. Academic search results that perpetuate confirmation bias have strong implications for both researchers and citizens searching for evidence.
  arXiv  Detail & Related papers  (2023-11-16T15:43:31Z)
• Que2Engage: Embedding-based Retrieval for Relevant and Engaging Products at Facebook Marketplace [15.054431410052851]
  We present Que2Engage, a search EBR system built towards bridging the gap between retrieval and ranking for end-to-end optimizations. We show the effectiveness of our approach via a multitask evaluation framework and thorough baseline comparisons and ablation studies.
  arXiv  Detail & Related papers  (2023-02-21T23:10:16Z)
• Incentives for Item Duplication under Fair Ranking Policies [69.14168955766847]
  We study the behaviour of different fair ranking policies in the presence of duplicates. We find that fairness-aware ranking policies may conflict with diversity, due to their potential to incentivize duplication more than policies solely focused on relevance.
  arXiv  Detail & Related papers  (2021-10-29T11:11:15Z)
• Exposing Query Identification for Search Transparency [69.06545074617685]
  We explore the feasibility of approximate exposing query identification (EQI) as a retrieval task by reversing the role of queries and documents in two classes of search systems. We derive an evaluation metric to measure the quality of a ranking of exposing queries, as well as conducting an empirical analysis focusing on various practical aspects of approximate EQI.
  arXiv  Detail & Related papers  (2021-10-14T20:19:27Z)
• Surprise: Result List Truncation via Extreme Value Theory [92.5817701697342]
  We propose a statistical method that produces interpretable and calibrated relevance scores at query time using nothing more than the ranked scores. We demonstrate its effectiveness on the result list truncation task across image, text, and IR datasets.
  arXiv  Detail & Related papers  (2020-10-19T19:15:50Z)
• Effective Distributed Representations for Academic Expert Search [1.9815631757151737]
  We study how different distributed representations of academic papers (i.e. embeddings) impact academic expert retrieval. In particular, we explore the impact of the use of contextualized embeddings on search performance. We observe that using contextual embeddings produced by a transformer model trained for sentence similarity tasks produces the most effective paper representations.
  arXiv  Detail & Related papers  (2020-10-16T09:43:18Z)
• Overview of the TREC 2019 Fair Ranking Track [65.15263872493799]
  The goal of the TREC Fair Ranking track was to develop a benchmark for evaluating retrieval systems in terms of fairness to different content providers. This paper presents an overview of the track, including the task definition, descriptions of the data and the annotation process.
  arXiv  Detail & Related papers  (2020-03-25T21:34:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.