Generalizing the majority voting scheme to conditional voting

نویسندگان

  • Laszlo Kovacs
  • Henrietta Toman
  • Agnes Jonas
  • Lajos Hajdu
  • Andras Hajdu
چکیده

In this paper we propose a new voting scheme for generalizing the classical majority voting system. In contrast to the classical voting method we can make good decision if the number of classifiers assigning the correct class label is less than the half of the overall number of classifiers. This new method can be applied to such problems when the decision is not only logical but is also required to satisfy a pre-defined (e. g. geometrical) condition. In addition, we will show the results corresponding to the concept of pattern of success and failure using the existence theorem for the combinatorial (0,1)-matrices.

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

ثبت نام

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

منابع مشابه

Double voter perceptible blind signature based electronic voting protocol

Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...

متن کامل

Voting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems

some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...

متن کامل

Voting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems

some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...

متن کامل

Minority voting and long-term decisions

In this paper we propose minority voting as a scheme that can partially protect individuals from the risk of repeated exploitation. We consider a committee that meets twice to decide about projects where the first-period project may have a long-lasting impact. In the first period a simple open majority voting scheme takes place. Voting splits the committee into three groups: voting winners, vot...

متن کامل

Voting power and Qualified Majority Voting with a “no vote” option

In recent years, enlargement of the European Union has led to increased interest in the allocation of voting weights to member states with hugely differing population numbers. While the eventually agreed voting scheme lacks any strict mathematical basis, the Polish government suggested a voting scheme based on the Penrose definition of voting power, leading to an allocation of voting weights pr...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2011