Sciweavers

1248 search results - page 82 / 250
» Decision Tree Grafting
Sort
View
ICML
2005
IEEE
16 years 5 months ago
Why skewing works: learning difficult Boolean functions with greedy tree learners
We analyze skewing, an approach that has been empirically observed to enable greedy decision tree learners to learn "difficult" Boolean functions, such as parity, in the...
Bernard Rosell, Lisa Hellerstein, Soumya Ray, Davi...
ACL
2006
15 years 5 months ago
From Prosodic Trees to Syntactic Trees
This paper describes an ongoing effort to parse the Hebrew Bible. The parser consults the bracketing information extracted from the cantillation marks of the Masoetic text. We fir...
Andi Wu, Kirk Lowery
DSN
2009
IEEE
15 years 2 months ago
RRE: A game-theoretic intrusion Response and Recovery Engine
Preserving the availability and integrity of networked computing systems in the face of fast-spreading intrusions requires advances not only in detection algorithms, but also in a...
Saman A. Zonouz, Himanshu Khurana, William H. Sand...
ALT
2010
Springer
15 years 6 months ago
Lower Bounds on Learning Random Structures with Statistical Queries
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...
Dana Angluin, David Eisenstat, Leonid Kontorovich,...
ADC
2003
Springer
153views Database» more  ADC 2003»
15 years 9 months ago
Automated Discovery of Search Interfaces on the Web
Web search engines work well for finding crawlable pages, but not for finding datasets hidden behind Web search forms. We describe a novel technique for detecting search forms, ...
Jared Cope, Nick Craswell, David Hawking