terça-feira, 8 de janeiro de 2013

2008b - Approximations by smooth transitions in binary space partitions


result without global optimization. It combines the flexibility of Binary Space Partitions Trees with the statistical
robustness of Smooth Transition Regression Trees. The construction of the tree is straightforward and easily
controllable, using error-driven metrics or external constraints. Moreover, it leads to a concise representation.
Applications on synthetic and real data, both scalar and vector-valued demonstrated the effectiveness of this
approach.
Keywords: Binary Space Partitions. Smooth Transition Regression Trees. Classification and Regression Tree.
Vector Fields Approximation. Curve Reconstruction. Geometric Modeling.



Nenhum comentário:

Postar um comentário