Rudolf Fleischer
- Be.M. Ben-Or :"Lower bounds for algebraic computation trees", Proc. 15th ACM STOC 1983, 80-86 Google Scholar
Digital Library
- BLY.A. BjSrner, L. Lov~sz, A.C. Yao" "Linear decision trees ~ volume estimates and topological bounds", Proc. 24th ACM STOC 1992, 170-177 Google ScholarDigital Library
- DL.D.P. Dobkin, R.:I Lipton : "On the complexity of computations under varying sets of primitives, Journal of Computer System Sciences 18 (19 9), 86-91Google ScholarCross Ref
- Ed.H. Edelsbrunner : "Algorithms in Combinatorial Geometry", Springer Verlag, Heidelberg, 1987 Google ScholarDigital Library
- Fl.R. Fleischer :"A new lower bound technique for decinion trees", Tit MPI- 1-92-125, MPI ftir Informatik, W-6600 Saarbriicken, Germany, June 1992Google Scholar
- Ga.W.I. Gasarch :"On selecting the k largest with restricted quadratic queries", Information Processing Letters 38 (1991), 193-195 Google ScholarDigital Library
- Ja.J.W. Jaromczyk :"Lower bounds for problems defined by polynomial inequalities", Symposium on Foundations of Computing Theory, LNCS, Vol. 117, Springer 1981, 165-172 Google ScholarDigital Library
- MMS.U. Manber, S. Moran, M. Snir : "Applications of Ramsey's theorem to decision tree complexity", JournM of the ACM 32/4 (1985), 938-949 Google ScholarDigital Library
- MT.U. Manber, M. Tompa : "Probabilistic, nondeterministic and alternating decision trees", JournM of the A CM s 2 (198 ), 720-732 Google ScholarDigital Library
- OD.C. O'Ddrdaing : "A tight lower bound for he complexity of path-planaing for a disc", Information Processing Letters 2s/4 (1988), 165-17o Google ScholarDigital Library
- Rab.M. Rabin :"Proving simultaneous positivity of linear forms", JournM on Computer System Sciences 6 (1972), 639-650Google ScholarDigital Library
- Ram.P. Ramanan ~ "Obtaining lower bounds using artificial components", Information Processing Letters 24/4 (1987), 243-246 Google ScholarDigital Library
- RY.R. PAvest, A.C. Yao :"On the polyhedral decision problem", SIAM Journal on Computing 9 (1980), 343-347Google ScholarDigital Library
- Sn.M. Snir :"Comparisons between linear functions can help", Journal on Theoretical Computer Science 19 (1982), 321-330Google ScholarCross Ref
- Y89.A.C. Yao :"On selecting the k large~t with median tests", AIgorithmica 4/2 (1989), 293-300Google Scholar
- Y92.A.C. Yao :"Algebraic decision trees and Euler characteristics", Proc. 33th IEEE FOCS 1992, 268-277Google Scholar
Index Terms
- Decision trees: old and new results
Recommendations
Vector decision trees
The article presents the extension of a common decision tree concept to a multidimensional -- vector -- decision tree constructed with the help of evolutionary techniques. In contrary to the common decision tree the vector decision tree can make more ...
Multivariate alternating decision trees
Decision trees are comprehensible, but at the cost of a relatively lower prediction accuracy compared to other powerful black-box classifiers such as SVMs. Boosting has been a popular strategy to create an ensemble of decision trees to improve their ...
Consensus Decision Trees: Using Consensus Hierarchical Clustering for Data Relabelling and Reduction
EMCL '01: Proceedings of the 12th European Conference on Machine LearningIn data analysis, induction of decision trees serves two main goals: first, induced decision trees can be used for classification /prediction of new instances, and second, they represent an easy-to-interpret model of the problem domain that can be used ...
Comments