1651 search results - page 114 / 331 » Measuring the Complexity of Classification Problems |
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
PRL
2002
13 years 7 months ago
2002
As a new pattern classification method, nearest feature line (NFL) provides an effective way to tackle the sort of pattern recognition problems where only limited data are availab...
JCSS
2008
13 years 7 months ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
MP
2008
13 years 7 months ago
2008
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...
ICANN
2003
Springer
14 years 1 months ago
2003
Springer
Pattern recognition problems span a broad range of applications, where each application has its own tolerance on classification error. The varying levels of risk associated with ma...