Timeline for Are decision trees almost always binary trees?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Jul 18, 2023 at 21:52 | history | suggested | Mehdi Charife | CC BY-SA 4.0 |
reduced noise
|
| Jul 18, 2023 at 20:34 | review | Suggested edits | |||
| S Jul 18, 2023 at 21:52 | |||||
| Jun 22, 2011 at 15:46 | comment | added | Michael McGowan | Yes I understand that A, B, and C can be achieved by first splitting into A&B vs. C and then splitting A from B. My point was indeed that a given algorithm might not choose that particular sequence. | |
| Jun 22, 2011 at 15:42 | history | answered | David J. Harris | CC BY-SA 3.0 |