VLMC-C

VLMC-C algorithm is a new context tree inference algorithm for Variable Length Markov Chains (VLMC) model. When embedding the full MC of high order in a sparse structured context tree, the context algorithm proposed by Peter Buhlmann estimates the context tree structure of VLMC model. But it is prone to algorithm involves systematic biases during the branch-pruning process. VLMC-C corrects the systematic biases, and also controls the family-wise errors. It shows superior performance in reconstructing the context tree structure of the VLMC model and improving its compression capacity.