Decision tree with different split criterion than information gain

Question

I&#8217;d like to create a decision tree in python with a different split criterion than information gain, something like &#8220;1-information gain&#8221; (something like the opposite of impurity measure, like as similarity measure). Does already exist something like this? paper included. Thanks Answer Yes, it exists. There are many research papers: https://pdfs.semanticscholar.org/5e44/d49b2268421d7ddf09d68be9aa689359b772.pdf https://www.springerprofessional.de/en/splitting-method-for-decision-tree-based-on-similarity-with-mixe/16031946

Accepted Answer

Yes, it exists. There are many research papers: https://pdfs.semanticscholar.org/5e44/d49b2268421d7ddf09d68be9aa689359b772.pdfhttps://www.springerprofessional.de/en/splitting-method-for-decision-tree-based-on-similarity-with-mixe/16031946