Aggregating inconsistent information

Author:

Ailon Nir1,Charikar Moses2,Newman Alantha3

Affiliation:

1. Google Research, New York, NY

2. Princeton University, Princeton, NJ

3. DIMACS, Rutgers University, New Brunswick, NJ

Abstract

We address optimization problems in which we are given contradictory pieces of input information and the goal is to find a globally consistent solution that minimizes the extent of disagreement with the respective inputs. Specifically, the problems we address are rank aggregation, the feedback arc set problem on tournaments, and correlation and consensus clustering. We show that for all these problems (and various weighted versions of them), we can obtain improved approximation factors using essentially the same remarkably simple algorithm. Additionally, we almost settle a long-standing conjecture of Bang-Jensen and Thomassen and show that unless NP⊆BPP, there is no polynomial time algorithm for the problem of minimum feedback arc set in tournaments.

Funder

National Science Foundation

U.S. Department of Energy

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference38 articles.

1. Ailon N. 2008. Aggregation of partial rankings p-ratings and top-m lists. Algorithmica. DOI 10.1007/s00453-008-9211-1. 10.1007/s00453-008-9211-1 Ailon N. 2008. Aggregation of partial rankings p-ratings and top-m lists. Algorithmica. DOI 10.1007/s00453-008-9211-1. 10.1007/s00453-008-9211-1

2. Fitting tree metrics: Hierarchical clustering and Phylogeny

3. Aggregating inconsistent information

4. Ranking Tournaments

Cited by 307 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A better LP rounding for feedback arc set on tournaments;Theoretical Computer Science;2024-11

2. Consensus task interaction trace recommender to guide developers’ software navigation;Empirical Software Engineering;2024-09-02

3. A new temporal interpretation of cluster editing;Journal of Computer and System Sciences;2024-09

4. Noisy Sorting Capacity;IEEE Transactions on Information Theory;2024-09

5. Scalable Multitask Learning Using Gradient-based Estimation of Task Affinity;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3