Timeline for Implementing an Adaboost Classifier
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 10, 2018 at 10:10 | answer | added | Xavier Bourret Sicotte | timeline score: 1 | |
| Apr 15, 2016 at 22:17 | comment | added | djc6535 | -aginensky: That's exactly what happened, but I'm not asking a question about how to implement adaboost, but rather how to implement the classifier that adaboost produced. The classifier is presented as a series of trees, each with an assigned weight. Here is an example: youtu.be/ix6IvwbVpw0?t=343 Here we see a number of weighted classifiers. Combine the weights * classifier and check the sum. | |
| S Apr 15, 2016 at 22:17 | history | suggested | djc6535 |
added tags
|
|
| Apr 15, 2016 at 22:01 | comment | added | Silverfish | It looks like you have accidentally created a second account and that is stopping you from being able to immediately edit your own question. Have a look at our help centre to see how to merge them. | |
| Apr 15, 2016 at 21:54 | comment | added | meh | I don't know what Weka does, but usually Adaboost builds a tree, reweighs the data based on the outcomes and uses the reweighed data to build the next tree. This process is repeated. In addition, at every state only a (typically small) multiple of the new tree is added to the answer. Such a process would not produce the formula you describe. | |
| Apr 15, 2016 at 21:43 | review | Suggested edits | |||
| S Apr 15, 2016 at 22:17 | |||||
| Apr 15, 2016 at 21:36 | review | First posts | |||
| Apr 15, 2016 at 22:17 | |||||
| Apr 15, 2016 at 21:36 | history | asked | user112368 | CC BY-SA 3.0 |