Sciweavers

2517 search results - page 184 / 504
» Specifying Weak Sets
Sort
View
SSPR
2000
Springer
15 years 10 months 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
EUROCOLT
1995
Springer
15 years 10 months ago
A decision-theoretic generalization of on-line learning and an application to boosting
k. The model we study can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting. We show that the multi...
Yoav Freund, Robert E. Schapire
MPC
1995
Springer
125views Mathematics» more  MPC 1995»
15 years 10 months ago
Synthesizing Proofs from Programs in the Calculus of Inductive Constructions
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
Catherine Parent
LREC
2008
88views Education» more  LREC 2008»
15 years 8 months ago
An Infrastructure, Tools and Methodology for Evaluation of Multicultural Name Matching Systems
This paper describes a Name Matching Evaluation Laboratory that is a joint effort across multiple projects. The lab houses our evaluation infrastructure as well as multiple name m...
Keith J. Miller, Mark Arehart, Catherine Ball, Joh...
NIPS
2008
15 years 8 months ago
On the Efficient Minimization of Classification Calibrated Surrogates
Bartlett et al (2006) recently proved that a ground condition for convex surrogates, classification calibration, ties up the minimization of the surrogates and classification risk...
Richard Nock, Frank Nielsen