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
Program: A good illustration of code conversion: Write a program to convert a; 4-digit BCD number into its binary equivalent. BCD number is stored as a; word in memory location kno

A doubly linked list is like a linked list except that each node has a pointer both to the next node in the list and to the previous node in the list. There are also pointers to th

TARGET = "_self" "_self" puts the new document in the same window and frame as current document. "_self" works the same as if you hadn't used TARGET at all.

Explain the process of inter-register signalling. Registers are utilized in common control exchanges to store and analyze routing data. They are given on a common basis is a

Q. What is Memory Interleaving? In this scheme main memory is splitted in 'n' equal-size modules and CPU has separate Memory Base register and Memory Address Register for every

How to implement zbuffer algorithm

What are the Advantagesof fact finding - Analyst obtains reliable data - It's possible to see exactly what is being done -  This is an inexpensive method in comparison o

Q. (192.8)10 - (AE.E)16 = (X)8, Find value of x. Use 8's complement method. Q. Write first 10 numbers in the base 4. Q. Explain Error-Detection code & Error-correction code w

Define memory address map? Addressing of memory can be established by means of a table that specifies the memory address assigned to each chip. The tables, known as memory addr

The term 'page traffic' describes? Ans. Page Traffic describes the movement of pages in and out of memory.