Sciweavers

116 search results - page 12 / 24
» Anonymity-Proof Voting Rules
Sort
View
SSPR
2000
Springer
14 years 7 days ago
The Role of Combining Rules in Bagging and Boosting
To improve weak classifiers bagging and boosting could be used. These techniques are based on combining classifiers. Usually, a simple majority vote or a weighted majority vote are...
Marina Skurichina, Robert P. W. Duin
ICIP
2010
IEEE
13 years 6 months ago
Building Emerging Pattern (EP) Random forest for recognition
The Random forest classifier comes to be the working horse for visual recognition community. It predicts the class label of an input data by aggregating the votes of multiple tree...
Liang Wang, Yizhou Wang, Debin Zhao
AAAI
2008
13 years 11 months ago
Voting on Multiattribute Domains with Cyclic Preferential Dependencies
In group decision making, often the agents need to decide on multiple attributes at the same time, so that there are exponentially many alternatives. In this case, it is unrealist...
Lirong Xia, Vincent Conitzer, Jérôme ...
IJCAI
2007
13 years 10 months ago
Vote and Aggregation in Combinatorial Domains with Structured Preferences
In many real-world collective decision problems, the set of alternatives is a Cartesian product of finite value domains for each of a given set of variables. The prohibitive size...
Jérôme Lang
CLIMA
2010
13 years 8 months ago
Is Computational Complexity a Barrier to Manipulation?
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballo...
Toby Walsh