Computational geometry: an introduction
Computational geometry: an introduction
The complexity of Boolean functions
The complexity of Boolean functions
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)
C4.5: programs for machine learning
C4.5: programs for machine learning
Learning decision trees from decision rules: a method and initial results from a comparative study
Journal of Intelligent Information Systems - Special issue on methodologies for intelligent systems
Decision tree complexity and Betti numbers
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Machine Learning
Generalized teaching dimensions and the query complexity of learning
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
How many queries are needed to learn?
Journal of the ACM (JACM)
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
About a polyhedron of cubic graphs
Fundamenta Informaticae
Some bounds on minimal decision tree depth
Fundamenta Informaticae - Special issue: rough sets
Bounds on average weighted depth of decision trees
Fundamenta Informaticae
Unimprovable upper bounds on time complexity of decision trees
Fundamenta Informaticae
Fundamenta Informaticae
From optimal hyperplanes to optimal decision trees
Fundamenta Informaticae
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Learning in graphical models
Test Routines Based on Symbolic Logical Statements
Journal of the ACM (JACM)
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem
Journal of the ACM (JACM)
On average time complexity of decision trees and branching programs
Fundamenta Informaticae
Decision trees for regular language word recognition
Fundamenta Informaticae
On algorithm for constructing of decision trees with minimal depth
Fundamenta Informaticae
Deterministic and nondeterministic decision trees for rough computing
Fundamenta Informaticae
Rough set methods and applications: new developments in knowledge discovery in information systems
Rough set methods and applications: new developments in knowledge discovery in information systems
Rough set algorithms in classification problem
Rough set methods and applications
Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory
Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Feature Extraction, Construction and Selection: A Data Mining Perspective
Feature Extraction, Construction and Selection: A Data Mining Perspective
Feature Selection for Knowledge Discovery and Data Mining
Feature Selection for Knowledge Discovery and Data Mining
Readings in Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Rough-Neuro-Computing: Techniques for Computing with Words
Rough-Neuro-Computing: Techniques for Computing with Words
On decision trees for (1,2)-Bayesian networks
Fundamenta Informaticae
Rough Sets: Mathematical Foundations
Rough Sets: Mathematical Foundations
Towards an ontology of approximate reason
Fundamenta Informaticae
Machine Learning
Rough set methods in feature selection and recognition
Pattern Recognition Letters - Special issue: Rough sets, pattern recognition and data mining
Machine Learning
Machine Learning
Algorithms for Constructing of Decision Trees
PKDD '97 Proceedings of the First European Symposium on Principles of Data Mining and Knowledge Discovery
On Diagnosis of Retaining Faults in Circuits
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Some Relationships between Decision Trees and Decision Rule Systems
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
On Recognition of Words from Languages Generated by Linear Grammars with One Nonterminal Symbol
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
On Decision Trees with Minimal Average Depth
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Classification of Infinite Information Systems
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
On Algorithm for Constructing of Decision Trees with Minimal Number of Nodes
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
On Compressible Information Systems
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Approximate Reducts and Association Rules - Correspondence and Complexity Results
RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
On the Depth of Decision Trees for Diagnosing of Nonelementary Faults in Circuits
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Rough sets perspective on data and knowledge
Handbook of data mining and knowledge discovery
Improved lower bound on testing membership to a polyhedron by algebraic decision trees
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Compressible infinite information systems
Fundamenta Informaticae
Rough Set Theory and Granular Computing
Rough Set Theory and Granular Computing
On Efficient Handling of Continuous Attributes in Large Data Bases
Fundamenta Informaticae
Algebraic decision trees and Euler characteristics
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
A system for induction of oblique decision trees
Journal of Artificial Intelligence Research
Discovering classification rules using variable-valued logic system VL
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Generating production rules from decision trees
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
Diagnosis of automata failures: a calculus and a method
IBM Journal of Research and Development
Fuzzy Sets and Systems
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Rough sets and information granulation
IFSA'03 Proceedings of the 10th international fuzzy systems association World Congress conference on Fuzzy sets and systems
Approximate algorithm for minimization of decision tree depth
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Unimprovable Upper Bounds on Time Complexity of Decision Trees
Fundamenta Informaticae
About The Depth Of Decision Trees Computing Boolean Functions
Fundamenta Informaticae
Greedy Algorithm with Weights for Decision Tree Construction
Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
A VPRSM based approach for inducing decision trees
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Clock power minimization using structured latch templates and decision tree induction
Proceedings of the International Conference on Computer-Aided Design
Communication: Diagnosis of constant faults in iteration-free circuits over monotone basis
Discrete Applied Mathematics
Relationships between Average Depth and Number of Misclassifications for Decision Trees
Fundamenta Informaticae - Dedicated to the Memory of Professor Manfred Kudlek
| Hi-index | 0.00 |
The research monograph is devoted to the study of bounds on time complexity in the worst case of decision trees and algorithms for decision tree construction. The monograph is organized in four parts. In the first part (Sects. 1 and 2) results of the monograph are discussed in context of rough set theory and decision tree theory. In the second part (Sect. 3) some tools for decision tree investigation based on the notion of decision table are described. In the third part (Sects. 4–6) general results about time complexity of decision trees over arbitrary (finite and infinite) information systems are considered. The fourth part (Sects. 7–11) contains a collection of mathematical results on decision trees in areas of rough set theory and decision tree theory applications such as discrete optimization, analysis of acyclic programs, pattern recognition, fault diagnosis and probabilistic reasoning.