Timeline for Do Random Forest overfit?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 8, 2019 at 9:33 | answer | added | pplonski | timeline score: 15 | |
| Jul 22, 2016 at 8:15 | answer | added | Qbik | timeline score: 1 | |
| Nov 3, 2015 at 3:15 | comment | added | Hack-R | @AndyBlankertz ISTR = internetslang.com/ISTR-meaning-definition.asp ? | |
| Oct 20, 2014 at 12:24 | vote | accept | papafe | ||
| Oct 20, 2014 at 9:31 | answer | added | tashuhka | timeline score: 30 | |
| Aug 28, 2014 at 1:18 | comment | added | JenSCDC | ISTR that Breiman had a proof based on the Law of Large Numbers. Has someone discovered a flaw in that proof? | |
| Aug 24, 2014 at 8:22 | answer | added | Alexey Grigorev | timeline score: 12 | |
| Aug 23, 2014 at 18:16 | comment | added | indico | All algorithms will overfit to some degree. It's not about picking something that doesn't overfit, it's about carefully considering the amount of overfitting and the form of the problem you're solving to maximize more relevant metrics. | |
| Aug 23, 2014 at 16:54 | review | First posts | |||
| Aug 24, 2014 at 3:38 | |||||
| Aug 23, 2014 at 16:54 | history | asked | papafe | CC BY-SA 3.0 |