Hello,
I would like more information about the implementation of Minimal Description Length Pruning (MDLP) in KNIME’s Decision Tree Learner. I have searched for details on how this is implemented and could not find any. There are conceptual articles on MDLP with quite complex mathematics, but no example of how the algorithm works.
I understand that if the implementation of MDLP in KNIME is proprietary, then no details can be provided. I would at least like to know if it is proprietary or to have some detail. I am planning to teach predictive analytics using KNIME and I am certain that one or more of my students will ask for an explanation.