Article

Free access

Decision trees: old and new results

Author:

Rudolf FleischerAuthors Info & Claims

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

Pages 468 - 477

https://doi.org/10.1145/167088.167216

Published: 01 June 1993 Publication History

PDF eReader

References

[1]

M. Ben-Or :"Lower bounds for algebraic computation trees", Proc. 15th ACM STOC 1983, 80-86

Digital Library

Google Scholar

[2]

A. BjSrner, L. Lov~sz, A.C. Yao" "Linear decision trees ~ volume estimates and topological bounds", Proc. 24th ACM STOC 1992, 170-177

Digital Library

Google Scholar

[3]

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-91

Crossref

Google Scholar

[4]

H. Edelsbrunner : "Algorithms in Combinatorial Geometry", Springer Verlag, Heidelberg, 1987

Digital Library

Google Scholar

[5]

R. Fleischer :"A new lower bound technique for decinion trees", Tit MPI- 1-92-125, MPI ftir Informatik, W-6600 Saarbriicken, Germany, June 1992

Google Scholar

[6]

W.I. Gasarch :"On selecting the k largest with restricted quadratic queries", Information Processing Letters 38 (1991), 193-195

Digital Library

Google Scholar

[7]

J.W. Jaromczyk :"Lower bounds for problems defined by polynomial inequalities", Symposium on Foundations of Computing Theory, LNCS, Vol. 117, Springer 1981, 165-172

Digital Library

Google Scholar

[8]

U. Manber, S. Moran, M. Snir : "Applications of Ramsey's theorem to decision tree complexity", JournM of the ACM 32/4 (1985), 938-949

Digital Library

Google Scholar

[9]

U. Manber, M. Tompa : "Probabilistic, nondeterministic and alternating decision trees", JournM of the A CM s 2 (198 ), 720-732

Digital Library

Google Scholar

[10]

C. O'Ddrdaing : "A tight lower bound for he complexity of path-planaing for a disc", Information Processing Letters 2s/4 (1988), 165-17o

Digital Library

Google Scholar

[11]

M. Rabin :"Proving simultaneous positivity of linear forms", JournM on Computer System Sciences 6 (1972), 639-650

Digital Library

Google Scholar

[12]

P. Ramanan ~ "Obtaining lower bounds using artificial components", Information Processing Letters 24/4 (1987), 243-246

Digital Library

Google Scholar

[13]

R. PAvest, A.C. Yao :"On the polyhedral decision problem", SIAM Journal on Computing 9 (1980), 343-347

Digital Library

Google Scholar

[14]

M. Snir :"Comparisons between linear functions can help", Journal on Theoretical Computer Science 19 (1982), 321-330

Crossref

Google Scholar

[15]

A.C. Yao :"On selecting the k large~t with median tests", AIgorithmica 4/2 (1989), 293-300

Google Scholar

[16]

A.C. Yao :"Algebraic decision trees and Euler characteristics", Proc. 33th IEEE FOCS 1992, 268-277

Google Scholar

Cited By

View all

Lam TTing H(2001)Selecting the k Largest Elements with Parity TestsAlgorithms and Computation10.1007/3-540-49381-6_21(190-197)Online publication date: 29-Mar-2001
https://doi.org/10.1007/3-540-49381-6_21
Lam TTing H(2000)Selecting the k largest elements with parity testsDiscrete Applied Mathematics10.1016/S0166-218X(99)00193-6101:1-3(187-196)Online publication date: 15-Apr-2000
https://dl.acm.org/doi/10.1016/S0166-218X%2899%2900193-6
Grigoriev DKarpinski MSmolensky R(1996)Randomization and the computational power of analytic and algebraic decision treesComputational Complexity10.1007/BF012703886:4(376-388)Online publication date: Dec-1996
https://doi.org/10.1007/BF01270388

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 Learning

In 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

Information & Contributors

Information

Published In

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

June 1993

812 pages

ISBN:0897915917

DOI:10.1145/167088

Chairmen:
Rao Kosaraju
John Hopkins Univ., Baltimore, MD
,
David Johnson
AT&T Bell Lab.
,
Alok Aggarwal
IBM T. J. Watson Research Center,Yorktown Heights, NY

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC93

Sponsor:

SIGACT

STOC93: 25th Annual ACM Symposium on the Theory of Computing

May 16 - 18, 1993

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
410
Total Downloads

Downloads (Last 12 months)16
Downloads (Last 6 weeks)2

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lam TTing H(2001)Selecting the k Largest Elements with Parity TestsAlgorithms and Computation10.1007/3-540-49381-6_21(190-197)Online publication date: 29-Mar-2001
https://doi.org/10.1007/3-540-49381-6_21
Lam TTing H(2000)Selecting the k largest elements with parity testsDiscrete Applied Mathematics10.1016/S0166-218X(99)00193-6101:1-3(187-196)Online publication date: 15-Apr-2000
https://dl.acm.org/doi/10.1016/S0166-218X%2899%2900193-6
Grigoriev DKarpinski MSmolensky R(1996)Randomization and the computational power of analytic and algebraic decision treesComputational Complexity10.1007/BF012703886:4(376-388)Online publication date: Dec-1996
https://doi.org/10.1007/BF01270388

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Vector decision trees

Multivariate alternating decision trees

Consensus Decision Trees: Using Consensus Hierarchical Clustering for Data Relabelling and Reduction