Sciweavers

1275 search results - page 88 / 255
» Chunking with Decision Trees
Sort
View
IEAAIE
1995
Springer
14 years 1 months ago
Polygonal Inductive Generalisation System
Classification learning has been dominated by the induction of axisorthogonal decision surfaces. While induction of alternate forms of decision surface has received some attentio...
Douglas A. Newlands, Geoffrey I. Webb
PLANX
2007
13 years 11 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
13 years 10 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
13 years 10 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
13 years 11 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann