决策树前沿发展.pptx

Let’s talk about decision trees;Two Approaches to Build the Decision Tree——Incremental;Typical Attribute Select Method;Typical Tree Pruning Method;Two Approaches to Build the Decision Tree——Full;EFTI Algorithm;A typical decision tree;What is important for DT in Embedded System;The good property of EFTI algorithm ;How it works – General idea;How it works – General idea ;How it works – How to evaluate the new DT;How it works – How to mutate the DT;HereBoy – A Fast Evolving Method;Evolutionary Time = (Time/Iteration)* Iterations;One of the key features of a Genetic Algorithm is its data structure: the chromosome that can be mapped to virtually any problem domain by translating the genetic information into properties of a problem specific data structure. The HereBoy algorithm uses the chromosome as its basic data structure and thus preserves the property of being mapped to a large variety of problems.;HereBoy – Graph Presentation;HereBoy – Two problems;HereBoy – Mutation Rate;HereBoy – Probability of Accept;Conclusion;Thank You!!