Sciweavers

328 search results - page 13 / 66
» Supervised rank aggregation
Sort
View
AAAI
2006
13 years 10 months ago
Improved Bounds for Computing Kemeny Rankings
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
SBRN
2008
IEEE
14 years 3 months ago
Selecting Neural Network Forecasting Models Using the Zoomed-Ranking Approach
In this work, we propose to use the Zoomed-Ranking approach to ranking and selecting Artificial Neural Network (ANN) models for time series forecasting. Given a time series to fo...
Patrícia M. Santos, Teresa Bernarda Ludermi...
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
14 years 1 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
ICPR
2008
IEEE
14 years 10 months ago
Weakly supervised learning using proportion-based information: An application to fisheries acoustics
This paper addresses the inference of probabilistic classification models using weakly supervised learning. In contrast to previous work, the use of proportion-based training data...
Carla Scalarin, Jacques Masse, Jean-Marc Boucher, ...
IWOCA
2010
Springer
229views Algorithms» more  IWOCA 2010»
13 years 3 months ago
Ranking and Drawing in Subexponential Time
In this paper we obtain parameterized subexponential-time algorithms for p-Kemeny Aggregation (p-KAGG) -- a problem in social choice theory -- and for p-One-Sided Crossing Minimiza...
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov,...