Sciweavers

440 search results - page 38 / 88
» Comparison of Galled Trees
Sort
View
ACL
2009
13 years 6 months ago
Comparing the Accuracy of CCG and Penn Treebank Parsers
We compare the CCG parser of Clark and Curran (2007) with a state-of-the-art Penn Treebank (PTB) parser. An accuracy comparison is performed by converting the CCG derivations into...
Stephen Clark, James R. Curran
ML
2000
ACM
154views Machine Learning» more  ML 2000»
13 years 8 months ago
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
Zijian Zheng, Geoffrey I. Webb
CI
2005
99views more  CI 2005»
13 years 8 months ago
Automatically Generating Tree Adjoining Grammars from Abstract Specifications
TRACT SPECIFICATIONS FEI XIA AND MARTHA PALMER Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104 K. VIJAY-SHANKER Department of Com...
Fei Xia, Martha Palmer, K. Vijay-Shanker
SAC
2005
ACM
14 years 2 months ago
Learning decision trees from dynamic data streams
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
João Gama, Pedro Medas, Pedro Pereira Rodri...
JAIR
2008
93views more  JAIR 2008»
13 years 8 months ago
Spectrum of Variable-Random Trees
In this paper, we show that a continuous spectrum of randomisation exists, in which most existing tree randomisations are only operating around the two ends of the spectrum. That ...
Fei Tony Liu, Kai Ming Ting, Yang Yu, Zhi-Hua Zhou