1651 search results - page 173 / 331 » Measuring the Complexity of Classification Problems |
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
PRL
2010
13 years 2 months ago
2010
For fast classification under real-time constraints, as required in many imagebased pattern recognition applications, linear discriminant functions are a good choice. Linear discr...
ICML
2004
IEEE
14 years 9 months ago
2004
IEEE
Text categorization algorithms usually represent documents as bags of words and consequently have to deal with huge numbers of features. Most previous studies found that the major...
SIAMMAX
2010
13 years 2 months ago
2010
We propose practical stopping criteria for the iterative solution of sparse linear least squares (LS) problems. Although we focus our discussion on the algorithm LSQR of Paige and ...
BMCBI
2006
13 years 8 months ago
2006
Background: A great deal of effort and expense are being expended internationally in attempts to detect genetic polymorphisms contributing to susceptibility to complex human disea...