Avoiding over fitting in decision trees, Computer Engineering

Assignment Help:

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.

 


Related Discussions:- Avoiding over fitting in decision trees

C++, minimum self program

minimum self program

Backward chaining, Backward Chaining: In generally given that we are o...

Backward Chaining: In generally given that we are only interested in constructing the path whether we can set our initial state to be the theorem statement and search backward

Difference between the fork -join and begin-end, Difference between the for...

Difference between the fork -join and begin-end. The fork - join keywords: Groups several statements together.Cause statements to be evaluated in parallel (all at the same

Linear model., what is linear model and its type

what is linear model and its type

Does xml replace html, No XML does not replace HTML. Instead, it gives an a...

No XML does not replace HTML. Instead, it gives an alternative which permits you to explain your own set of markup elements. HTML is expected to stay in common use for some time to

State and prove demorgan's second theorem, State and prove Demorgan's secon...

State and prove Demorgan's second theorem   Proof: Demorgan's second theorem   = A‾ + B‾ The two sides of the equation here   = A‾ + B‾ is represented through the logic d

What is blocking probability, What is blocking probability? Blocking ...

What is blocking probability? Blocking Probability: The blocking probability P is described as the probability like all the servers in system are busy. If all the servers ar

How can you have an accession number, Accession number (bioinformatics), a ...

Accession number (bioinformatics), a unique identifier given to a biological polymer sequence (DNA, protein) when it is given to a sequence database.

INTERRUPT METHOD, interrupt method in keypad operation coding using PIC16

interrupt method in keypad operation coding using PIC16

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd