10.1162/153244304773936072
From MaRDI portal
Publication:4827861
DOI10.1162/153244304773936072zbMath1102.68592OpenAlexW1548189207MaRDI QIDQ4827861
Publication date: 23 November 2004
Published in: CrossRef Listing of Deleted DOIs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/153244304773936072
Related Items (12)
An eager splitting strategy for online decision trees in ensembles ⋮ Multi-class learning by smoothed boosting ⋮ Noise peeling methods to improve boosting algorithms ⋮ A new boosting-based software reliability growth model ⋮ Computability of validity and satisfiability in probability logics over finite and countable models ⋮ Random classification noise defeats all convex potential boosters ⋮ On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms ⋮ Robust Estimators in High-Dimensions Without the Computational Intractability ⋮ Learning unions of \(\omega(1)\)-dimensional rectangles ⋮ Robust Loss Functions for Boosting ⋮ Deformation of log-likelihood loss function for multiclass boosting ⋮ An Improved Branch-and-Bound Method for Maximum Monomial Agreement
This page was built for publication: 10.1162/153244304773936072
