Decision tree design by simulated annealing
From MaRDI portal
Recommendations
Cites work
- A unifying framework for trie design heuristics
- Application of information theory to the construction of efficient decision trees
- Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time
- Decision tree design by simulated annealing
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 3316587 (Why is no real title available?)
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Optimization by simulated annealing
- Performance bounds on the splitting algorithm for binary testing
Cited in
(6)- Simulated annealing: Practice versus theory
- Sequential Gaussian simulation vs. simulated annealing for locating pockets of high-value commercial trees in Pennsylvania
- Metaheuristics: A bibliography
- Application of decision tree algorithms in stamping processes
- Decision tree design by simulated annealing
- Stochastic Algorithms: Foundations and Applications
This page was built for publication: Decision tree design by simulated annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4278040)