605 search results - page 2 / 121 » Geometrical Structure of Boosting Algorithm |
EMNLP
2004
13 years 6 months ago
2004
The focus of research in text classification has expanded from simple topic identification to more challenging tasks such as opinion/modality identification. Unfortunately, the la...
HAIS
2010
Springer
13 years 5 months ago
2010
Springer
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
COMPGEOM
2011
ACM
12 years 9 months ago
2011
ACM
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
ML
2002
ACM
13 years 5 months ago
2002
ACM
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...