Andrea N. Bán

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Boosting algorithms have been found successful in many areas of machine learning and, in particular, in ranking. For typical classes of weak learners used in boosting (such as decision stumps or trees), a large feature space can slow down the training, while a long sequence of weak hypotheses combined by boosting can result in a computationally expensive(More)
  • 1