Optimizing decision trees through heuristically guided search
From MaRDI portal
Publication:4178802
DOI10.1145/359657.359664zbMath0395.90079OpenAlexW1970515221MaRDI QIDQ4178802
Alberto Martelli, Ugo Montanari
Publication date: 1978
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359657.359664
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Decision theory (91B06) Applications of mathematical programming (90C90) Dynamic programming (90C39) Applications of graph theory to circuits and networks (94C15)
Related Items
SCLP for Trust Propagation in Small-World Networks ⋮ Totally optimal decision trees for Boolean functions ⋮ Admissibility of \(AO^ *\) when heuristics overestimate ⋮ Discrete decision theory: manipulations ⋮ A general heuristic bottom-up procedure for searching AND/OR graphs ⋮ Concurrent competitive wave approach to hyper-distributed hyper-parallel AI processing ⋮ Optimization and analysis of decision trees and rules: dynamic programming approach ⋮ Weighted Deductive Parsing and Knuth's Algorithm ⋮ A general framework for enumerating equivalence classes of solutions ⋮ Asynchronous heterogeneous mechanism for hyper-distributed hyper-parallel AI processing ⋮ Strong planning under partial observability ⋮ Generalized best first search using single and multiple heuristics ⋮ Integer programs for logic constraint satisfaction ⋮ Bi-criteria optimization of decision trees with applications to data analysis ⋮ Monitoring and control of anytime algorithms: A dynamic programming approach ⋮ LAO*: A heuristic search algorithm that finds solutions with loops ⋮ The \(PN^{*}\)-search algorithm: Application to tsume-shogi ⋮ An AO* Based Exact Algorithm for the Canadian Traveler Problem ⋮ Anytime pack search ⋮ A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures ⋮ General branch and bound, and its relation to \(A^*\) and \(AO^*\) ⋮ Admissible heuristic search in AND/OR graphs ⋮ An efficient algorithm for searching implicit AND/OR graphs with cycles ⋮ Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming ⋮ Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
