Jon wrote: > Aside: if I read Daniel's solution correct, he avoids the first issue by assuming that it's a binary classification task (that is, that there are only two classes).
Yep: I'm assuming binary classification. David wrote: > Out of curiosity, how much of that 0.5 seconds is overhead? Could you run a simple 'add 1 and 1' procedure and see how long it takes? I'm not exactly sure what you mean. Please feel free to profile however you like on the supplied code. My observation (primarily to Zelphir) on performance is that lists don't seem like a bad choice for this algorithm. If it hadn't been reasonably quick I might have tried replacing the dataset (a list of lists) with a list of vectors, but otherwise I'd be looking at modifying the exhaustive, greedy algorithm itself for possible speedups rather than data structures. Zelphir: > Maybe you could put it in a repository, so that other people are more likely to find your code. If I ever get back into ML I might, but don't have the time to do a proper write up. Please feel free to include it in your github repository, with or without attribution. Dan -- 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.
