Avoiding over fitting in decision trees, Computer Engineering

Avoiding Over fitting - Artificial intelligence

As  we  discussed  in  the last  lecture,  over fitting  is  a  normal  problem  in machine learning. Decision trees suffer from that, because they are skilled to stop when  they  have  completely  classify  all  the  training  data,  i.e.,  every  branch  is complete  just  far sufficient to  suitably  categories  the  examples important to  the branch. Various ways to overcoming over fitting in decision trees have been used. As summarized by Tom Mitchell, these attempts fit into two types:

·       Stop growing the tree before it reaches excellence.

  • Allow the tree to complete grow, and then post-prune some of the branches from it.

The second approach has been found to be more useable in practice. Both methods boil down to the question of shaping the right tree size. See Chapter 3 of Tom Mitchell's book for more detailed explanation of over fitting  prevention in decision tree knowledge.

 

Posted Date: 10/3/2012 1:16:08 AM | Location : United States







Related Discussions:- Avoiding over fitting in decision trees, Assignment Help, Ask Question on Avoiding over fitting in decision trees, Get Answer, Expert's Help, Avoiding over fitting in decision trees Discussions

Write discussion on Avoiding over fitting in decision trees
Your posts are moderated
Related Questions
How many Flip-Flops are required for mod-16 counter? Ans. 4 flip-flops is required for Mod-16 Counter. For Mod-m Counter, we require N flip-flops where N is selected to be the

How can we pass selection and parameter data to a report? There are three options for passing selection and parameter data to the report. Using SUBMIT...WITH Using a rep

Explain High Level Data Link Control. HDLC - it is High Level Data Link Control: Protocol Overall explanation: Layer 2 of the OSI model is the data link layer. One of the

What is the difference between a structure and a table? Structures are constructed the almost the similar way as tables, the only dissimilarity using that no database table is

Define seek time and latency time.  The time taken by the head to move to the appropriate cylinder or track is known as seek time. Once the head is at right track, it must wai

What is the difference among super class and subclass in programming? Ans) A super class is a class that is inherited in programming while the sub class is a class that does th

what is Ambiguity in single inheritance

COM add-ins are software program's which are included into an application and they add already built in features to an existing application. They have general architecture across m

Message passing is possible the most widely used parallel programming paradigm these days. It is the most portable, natural and efficient scheme for distributed memory systems. It

Learning algorithm for multi-layered networks: Furthermore details we see that  if S is too high, the contribution from w i * x i is reduced. It means that t(E) - o(E) is mu