Unimprovable Upper Bounds on Time Complexity of Decision Trees

Authors:
Mikhail Moshkov
Affiliations:
Research Institute for Applied Mathematics and Cybernetics of Nizhni Novgorod State University, 10, Uljanova St., Nizhni Novgorod, 603005, Russia. moshkov@nnucnit.unn.ac.ru
Venue:
Fundamenta Informaticae
Year:
1997

Citing 8
Cited 1

Fast algorithms for N-dimensional restrictions of hard problems

Journal of the ACM (JACM)
Learnability and the Vapnik-Chervonenkis dimension

Journal of the ACM (JACM)
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem

Journal of the ACM (JACM)
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Induction of Decision Trees

Machine Learning
Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Generating production rules from decision trees

IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
Optimization Problems For Decision Trees

Fundamenta Informaticae

Time complexity of decision trees

Transactions on Rough Sets III

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper is devoted to investigation of behavior of global Shannon functions which produce unimprovable upper bounds on time complexity of decision trees over arbitrary information systems.