[R] SOS Boosting

From: Olivier Celhay <olivier.celhay_at_gmail.com>
Date: Wed 13 Jul 2005 - 01:03:20 EST


Hi,

I am trying to implement the Adaboost.M1. algorithm as described in "The Elements of Statistical Learning" p.301 I don't use Dtettling 's library "boost" because :

By using option weights set to (1/n, 1/n, ..., 1/n) in rpart or tree function, the tree obtained is trivial (just root, no split) whereas without weight or for each weight >1,trees are just fine.

So here is my question : how are weights taken into account in optimal tree's discovery ?
Did someone implement boosting algorithm ?

Regards,

Olivier Celhay - Student - Paris, France



R-help@stat.math.ethz.ch mailing list
https://stat.ethz.ch/mailman/listinfo/r-help PLEASE do read the posting guide! http://www.R-project.org/posting-guide.html Received on Wed Jul 13 01:15:19 2005

This archive was generated by hypermail 2.1.8 : Fri 03 Mar 2006 - 03:33:34 EST