Resampling vs reweighting in boosting a relational weak learner

DOI10.1007/3-540-45411-X_9MaRDI QIDQ4799248zbMATH OpenFDO

Authors Marco Botta

Publication date 18 March 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2175/21750070.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• Relational learning using constrained confidence-rated boosting
• Multiclass boosting for weak classifiers
• On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms
• On weak base hypotheses and their implications for boosting regression and classification
• Boosting a weak learning algorithm by majority
• Convergence and Consistency of Regularized Boosting With Weakly Dependent Observations
• scientific article; zbMATH DE number 5568407
• A taxonomy of weight learning methods for statistical relational learning

Cited in

(4)

• Scaling boosting by margin-based inclusionof features and relations
• iBoost: Boosting using an instance-based exponential weighting scheme
• Relational learning using constrained confidence-rated boosting
• Boosting Descriptive ILP for Predictive Learning in Bioinformatics

This page was built for publication: Resampling vs reweighting in boosting a relational weak learner

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4799248)