The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
In this paper, we propose a new similarity measure to compute the pairwise similarity of text-based documents based on suffix tree document model. By applying the new suffix tree ...
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...
Harald Ganzinger, Robert Nieuwenhuis, Pilar Nivela
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...
Tancred Lindholm, Jaakko Kangasharju, Sasu Tarkoma