Abstract

In this chapter, we study bi-criteria optimization problem cost versus cost for decision and inhibitory trees. We design an algorithm which constructs the set of Pareto optimal points for bi-criteria optimization problem for decision trees, and show how the constructed set can be transformed into the graphs of functions that describe the relationships between the studied cost functions. We extend the obtained results to the case of inhibitory trees. We consider two applications: study of 12 greedy heuristics as algorithms for single- and bi-criteria optimization of decision and inhibitory trees, and study of two relationships for decision trees related to knowledge representation—number of nodes versus depth and number of nodes versus average depth.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.