Querying with Conflicts of Interest
Nischal Aryal, Arash Termehchy, Marianne Winslett

TL;DR
This paper introduces a formal framework and algorithms to detect and mitigate bias in query results caused by conflicts of interest between data sources and users, enhancing information retrieval accuracy.
Contribution
It presents a novel formal model for querying with biased data sources and develops efficient algorithms for detecting bias and reformulating queries to improve relevance.
Findings
Algorithms effectively detect biased information in query results.
Reformulated queries increase relevant information retrieval.
Experiments demonstrate efficiency on large real-world datasets.
Abstract
Conflicts of interest often arise between data sources and their users regarding how the users' information needs should be interpreted by the data source. For example, an online product search might be biased towards presenting certain products higher than in its list of results to improve its revenue, which may not follow the user's desired ranking expressed in their query. The research community has proposed schemes for data systems to implement to ensure unbiased results. However, data systems and services usually have little or no incentive to implement these measures, e.g., these biases often increase their profits. In this paper, we propose a novel formal framework for querying in settings where the data source has incentives to return biased answers intentionally due to the conflict of interest between the user and the data source. We propose efficient algorithms to detect…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Quality and Management · Information Retrieval and Search Behavior · Mobile Crowdsensing and Crowdsourcing
