Avoiding overfitting - decision tree learning , Computer Engineering

Assignment Help:

Avoiding Overfitting :

However remember there that in the previous lecture, there is over fitting that common problem in machine learning. Furthermore details to decision trees suffer from this is because they are trained to stop where they have perfectly classified all the training data that i.e., each branch is extended that is far enough to correctly categorise the examples relevant to that branch. In fact many other approaches to overcoming overfitting in decision trees have been attempted but as a summarised by Tom Mitchell there these attempts fit into two types as:

• Just stop growing the tree before it reaches perfection, and
• Now allow the tree to fully grow so then post-prune some of the branches from it.

Hence the second approach has been found to be more victorious in practice. Means that both approaches boil down to the question of determining the correct tree size. Here you can see Chapter 3 of Tom Mitchell's book for a more detailed description of overfitting avoidance in decision tree learning.


Related Discussions:- Avoiding overfitting - decision tree learning

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

Determine the framed data including a parity bit, Determine the Framed data...

Determine the Framed data including a parity bit   For illustration when even parity is chosen, parity bit is transmitted with a value of 0 if the number of preceding

Explain the stack storage allocation model, Explain the stack storage alloc...

Explain the stack storage allocation model. In a stack-based allocation, all objects are allocated in last-in, first-out data structure and a stack. For example: Recursive subr

What is linear bounded automation, What is linear bounded automation?  ...

What is linear bounded automation?   A linear bounded automation is restricted type of Turing machine where in the tape head isn't permitted to move off the portion of the tape

Explain the compiler - computer programming, Explain the Compiler - Compute...

Explain the Compiler - Computer Programming? The Compiler is a program that translates source code into object code. The compiler derives its name from the means it works looki

Data structure, explain different type of sparse matrix

explain different type of sparse matrix

Dram, DRAM consists of MOSFET's but the technique is to use the drain sourc...

DRAM consists of MOSFET's but the technique is to use the drain source capacitance to hold charge. If charge is present logic '1' is held, no charge logic '0'. As you know capacito

Predicates - first-order logic, Predicates - first-order logic: First ...

Predicates - first-order logic: First and foremost in first-order logic sentences, because predicates. Hence the indications of that some things are related in some way. So af

Illustrate processor arrangements, Q. Illustrate processor arrangements? ...

Q. Illustrate processor arrangements? HPF$ PROCESSORS P2 (4, 3) !HPF$ TEMPLATE T2 (17, 20) !HPF$ DISTRIBUTE T2 (BLOCK, *) ONTO P1 Means that first dimension of T2 woul

Explain one dimensional array, Explain one dimensional arrays In one di...

Explain one dimensional arrays In one dimensional arrays array name is really a pointer to the first element in the array. Second element of the array can be accessed by using

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