Cellular tree classifiers
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3646165 (Why is no real title available?)
- scientific article; zbMATH DE number 3887061 (Why is no real title available?)
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- A Partitioning Algorithm with Application in Pattern Classification and the Optimization of Decision Trees
- A distribution-free theory of nonparametric regression
- A method for the design of binary tree classifiers
- An Algorithm for Constructing Optimal Binary Decision Trees
- Analysis and Design of a Decision Tree Based on Entropy Reduction and Its Application to Large Character Set Recognition
- Analytic combinatorics
- Application of information theory to the construction of efficient decision trees
- Asymptotically efficient solutions to the classification problem
- Consistency of random forests and other averaging classifiers
- Data Mining with Decision Trees
- Dynamic multi-dimensional data structures based on quad- and k-d trees
- Efficient decision tree design for discrete variable pattern recognition problems
- Elements of Information Theory
- Ignoring ignorance and agreeing to disagree
- Introduction to algorithms.
- Model Selection for CART Regression Trees
- Multidimensional binary search trees used for associative searching
- Order Statistics
- Random Trees
- Random forests
- The Vapnik-Chervonenkis dimension of decision trees with bounded rank
- The optimal strategy of a tree classifier
- Tree-Structured Classification Via Generalized Discriminant Analysis
Cited in
(7)
This page was built for publication: Cellular tree classifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q358883)