60 search results - page 1 / 12 » Boosting versus Covering |
NIPS
2003
13 years 6 months ago
2003
We investigate improvements of AdaBoost that can exploit the fact that the weak hypotheses are one-sided, i.e. either all its positive (or negative) predictions are correct. In pa...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
FSTTCS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. In [12] we started a research on a distributed-timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the ...
ICIAP
2007
ACM
14 years 5 months ago
2007
ACM
The distinction between holistic and analytical (or feature-based) approaches to face recognition is widely held to be an important dimension of face recognition research. Holisti...
TNN
2010
2010
Sensitivity versus accuracy in multiclass problems using memetic Pareto evolutionary neural networks
12 years 11 months ago
This paper proposes a multiclassification algorithm using multilayer perceptron neural network models. It tries to boost two conflicting main objectives of multiclassifiers: a high...