28 search results - page 6 / 6 » Optimal False-Name-Proof Voting Rules with Costly Voting |
ICANN
2009
Springer
13 years 10 months ago
2009
Springer
Recent research has shown that the provisional count of votes of an ensemble of classifiers can be used to estimate the probability that the final ensemble prediction coincides w...
ICML
2003
IEEE
14 years 6 months ago
2003
IEEE
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
ESWS
2009
Springer
13 years 12 months ago
2009
Springer
Despite serious research efforts, automatic ontology matching still suffers from severe problems with respect to the quality of matching results. Existing matching systems trade-of...