Greedy algorithm of decision tree construction for real data tables
From MaRDI portal
Recommendations
- Approximate algorithm for minimization of decision tree depth
- Rough Sets and Current Trends in Computing
- Greedy algorithm with weights for decision tree construction
- A greedy algorithm for construction of decision trees for tables with many-valued decisions -- a comparative study
- scientific article; zbMATH DE number 1455626
Cited in
(11)- Greedy algorithm for the construction of approximate decision rules for decision tables with many-valued decisions
- Approximating optimal binary decision trees
- Exact learning from an honest teacher that answers membership queries
- Greedy algorithm with weights for decision tree construction
- Approximate algorithm for minimization of decision tree depth
- scientific article; zbMATH DE number 1455626 (Why is no real title available?)
- Greedy algorithms for construction of approximate tests for decision tables with many-valued decisions
- On Polynomial Time Constructions of Minimum Height Decision Tree
- Rough Sets and Current Trends in Computing
- A greedy algorithm for construction of decision trees for tables with many-valued decisions -- a comparative study
- Decision trees and reducts for distributed decision tables
This page was built for publication: Greedy algorithm of decision tree construction for real data tables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315317)