Blog

Learn About Our Meetup

4500+ Members

[D] Did I find anything useful?

Hello everyone!

I found an algorithm that allows me to solve the problem of the optimal partition quite(very) quickly. For any type of score (gini index of the target for example) I can find the partition of the input that minimizes it (even on really big datasets). I remind you that in the case of decision trees this optimal partition is not always reached because the algorithm is greedy.

Since I’m not a data-scientist, but rather a combinatorial optimization specialist, I’d like to know if it’s really a discovery or it’s already been done, for example in decision trees implementations.

submitted by /u/partitionist
[link] [comments]

Next Meetup

 

Days
:
Hours
:
Minutes
:
Seconds

 

Plug yourself into AI and don't miss a beat

 


Toronto AI is a social and collaborative hub to unite AI innovators of Toronto and surrounding areas. We explore AI technologies in digital art and music, healthcare, marketing, fintech, vr, robotics and more. Toronto AI was founded by Dave MacDonald and Patrick O'Mara.