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

Public key infrastructure solutions, Public Key Infrastructure solutions ...

Public Key Infrastructure solutions The use of public-key based security systems requires great attention and due care in design and management of security features. The secur

What is mask operation, What is MASK OPERATION The mask operation is si...

What is MASK OPERATION The mask operation is similar to selective-clear operation except which the bits of Aare cleared only where there are corresponding 0's in register B. th

What are the user interfaces of interactive lists, What are the user interf...

What are the user interfaces of interactive lists? If you require the user to communicate with the system during list display, the list must be interactive.  You can describe

Floating point format, consider the 8 bit floating point format including s...

consider the 8 bit floating point format including support for normalised nimbers and nonnumeric values.it included 3 bits for mantissa and 4 bitys for excess 7 exponent

Explain HLL program & execution of machine language program, Give the Schem...

Give the Schematic of Interpretation of HLL program and execution of a machine language program by the CPU. The CPU utilizes a program counter (PC) to notice the address of nex

Basic performance equation, Explain the basic performance equation Ans...

Explain the basic performance equation Ans: The basic performance equation is following T = N * S/ R T =>  It is processor time required to execute a program N => act

Hubs are present in the network, Hubs are present in the network To inte...

Hubs are present in the network To interconnect the LAN with WANs.

Define cache line, Define cache line. Cache block is used to refer to a...

Define cache line. Cache block is used to refer to a set of contiguous address location of some size. Cache block is also referred to as cache line.

Bit pair recoding and 2’s complement, Explain bit pair recoding with an exa...

Explain bit pair recoding with an example? Ans: Bit pair recoding halves the maximum number of summands. Group the Booth-recoded multiplier bits in pairs and see the following

What is constrained-random verification, What is Constrained-Random Verific...

What is Constrained-Random Verification ? As ASIC and system-on-chip (SoC) designs continue to increase in size and complexity, there is an equal or greater increase in the si

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