Fast Factorization of Probability Trees and Its Application to Recursive Trees Learning

摘要

We present a fast potential decomposition algorithm that seeks for proportionality in a probability tree. We give a measure that determines the accuracy of a decomposition in case that exact factorization is not possible. This measure can be used to decide the variable with respect to which a tree should be factorized in order to obtain the most accurate decomposed model.