Sciweavers

572 search results - page 24 / 115
» Isotonic Classification Trees
Sort
View
ECML
2006
Springer
14 years 13 days ago
Efficient Convolution Kernels for Dependency and Constituent Syntactic Trees
In this paper, we provide a study on the use of tree kernels to encode syntactic parsing information in natural language learning. In particular, we propose a new convolution kerne...
Alessandro Moschitti
CATA
2004
13 years 10 months ago
Decision Tree Induction for Dynamic, High-Dimensional Data Using P-Trees
1 Decision Tree Induction is a powerful classification tool that is much used in practice and works well for static data with dozens of attributes. We adapt the decision tree conce...
Anne Denton, William Perrizo
NJC
2000
99views more  NJC 2000»
13 years 8 months ago
An Incremental Unique Representation for Regular Trees
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
IDEAL
2000
Springer
14 years 10 days ago
Quantization of Continuous Input Variables for Binary Classification
Quantization of continuous variables is important in data analysis, especially for some model classes such as Bayesian networks and decision trees, which use discrete variables. Of...
Michal Skubacz, Jaakko Hollmén
SIGCOMM
2010
ACM
13 years 9 months ago
EffiCuts: optimizing packet classification for memory and throughput
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...
Balajee Vamanan, Gwendolyn Voskuilen, T. N. Vijayk...