I've come to the conclusion, that not assuming binary classification makes no sense, since every n-class classification problem can be split into n binary classification problems.
When assuming classes 0 and 1, the performance increases and I get to: cpu time: 608 real time: 605 gc time: 68 For finding the best split. Daniel's solution makes use of multiple return values, which were new to me. I am using a struct for this, which might be unnecessary and later removed in favor of returning multiple values like in Daniel's solution. -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
