Decision Trees
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
project report helper
Active In SP
**

Posts: 2,270
Joined: Sep 2010
#1
26-10-2010, 11:47 AM



.ppt   ATM Case Study.ppt (Size: 873 KB / Downloads: 58)
Decision Trees

DECISION TREE

An internal node is a test on an attribute.
A branch represents an outcome of the test, e.g., Color=red.
A leaf node represents a class label or class label distribution.
At each node, one attribute is chosen to split training examples into distinct classes as much as possible
A new case is classified by following a matching path to a leaf node.

Reply
project report helper
Active In SP
**

Posts: 2,270
Joined: Sep 2010
#2
26-10-2010, 01:24 PM


.ppt   cpt72.ppt (Size: 186 KB / Downloads: 124)
Decision Trees

Basics of Decision Trees


A flow-chart-like hierarchical tree structure
Often restricted to a binary structure
Root: represents the entire dataset
A node without children is called a leaf node. Otherwise is called an internal node.
Internal nodes: denote a test on an attribute
Branch (split): represents an outcome of the test
Univariate split (based on a single attribute)
Multivariate split
Leaf nodes: represent class labels or class distribution

Most decision tree generation consists of two phases
Tree construction
Tree pruning
Reply

Important Note..!

If you are not satisfied with above reply ,..Please

ASK HERE

So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page

Quick Reply
Message
Type your reply to this message here.


Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)