Voting Rules As Error-Correcting Codes

نویسندگان

  • Ariel D. Procaccia
  • Nisarg Shah
  • Yair Zick
چکیده

We present the first model of optimal voting under adversarial noise. From this viewpoint, voting rules are seen as error-correcting codes: their goal is to correct errors in the input rankings and recover a ranking that is close to the ground truth. We derive worst-case bounds on the relation between the average accuracy of the input votes, and the accuracy of the output ranking. Empirical results from real data show that our approach produces significantly more accurate rankings than alternative approaches.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Error-Correcting Codes: An Axiomatic Approach

Iterative optimization of quantum error correcting codes. Phys. Rev. Lett. 94(2005) Excerpts in: G. Ludwig: An Axiomatic basis for quantum mechanics, vol. 2: quantum A quantum dynamical approach to matrix khrushchev's formulas. We present an error-correcting interpolation algorithm for a univariate Sparse polynomial interpolation codes and their decoding beyond half the minimum distance. We pre...

متن کامل

Combining Neural Network Voting Classiiers and Error Correcting Output Codes

We show that error correcting output codes (ECOC) can further improve the eeects of error dependent adaptive resampling methods such as arc-lh. In traditional one-inn coding, the distance between two binary class labels is rather small, whereas ECOC are chosen to maximize this distance. We compare one-inn and ECOC on a multiclass data set using standard MLPs and bagging and arcing voting commit...

متن کامل

Interactive Consistency Algorithms based on Voting and Error-correcting Codes

This paper presents a new class of synchronous deterministic non-authenticated algorithms for reaching interactive consistency (Byzantine agreement). The algorithms are based on voting and error-correcting codes and require considerably less data communication than the original algorithm, whereas the number of rounds and the number of modules meet the minimum bounds. These algorithm based on vo...

متن کامل

Combining Neural Network Voting Classifiers and Error Correcting Output Codes

Papers published in this report series are preliminary versions of journal articles and not for quotations. Abstract We show that error correcting output codes (ECOC) can further improve the eeects of error dependent adaptive resampling methods such as arc-lh. In traditional one-inn coding, the distance between two binary class labels is rather small, whereas ECOC are chosen to maximize this di...

متن کامل

Deterministic Voting in Distributed Systems Using Error-Correcting Codes

Distributed voting is an important problem in reliable computing. In an N Modular Redundant (NMR) system, the N computational modules execute identical tasks and they need to periodically vote on their current states. In this paper, we propose a deterministic majority voting algorithm for NMR systems. Our voting algorithm uses error-correcting codes to drastically reduce the average case commun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015