how is the small tree used for classification what is the rule for classifying 31386

Name: how is the small tree used for classification what is the rule for classifying 31386
Uploaded: 2023-10-29T18:20:40-08:00
Duration: 2 min 6 s
Channel: Akash M
Description: how is the small tree used for classification what is the rule for classifying 31386

Step 1: Identify the features of the data that the small tree uses for classification. These fea

How is the small tree used for classification what is the...

Akash M and 98 other subject AP CS educators are ready to help you.

Ask a new question

Labs

Want to see this concept in action?

NEW

Explore this concept interactively to see how it behaves as you change inputs.

View Labs

Key Concepts

Key Concept

Premium Feature

Explore the core concept behind this problem.

Key Concept

Premium Feature

Explore the core concept behind this problem.

Recommended Videos

machine-learning-using-id3-algorithmplease-show-all-your-work-1for-the-following-data-set-apply-id3-separately-and-show-all-steps-of-derivation-computationreasoning-developing-final-decision-99301

For the following data set, apply ID3 separately and show all steps of derivation (computation, reasoning, developing/final decision trees, and rules). color shape size class 1 red square big + 2 blue square big + 3 red round small - 4 green square small - 5 red round big + 6 green round big - Entropy(t) = - Σ p(j|t) log2 p(j|t) Here, class is the target attribute and has two values (+ and -). So it is a binary classification problem. For a binary classification problem: - If all examples are positive or all are negative, then entropy will be zero, i.e., low. - If half of the examples are of the positive class and half are of the negative class, then entropy is one, i.e., high. 1. Calculating Initial Entropy: Out of 6 instances, 3 are + and 3 are -. P(+) = - (3/6) * log2 (3/6) = 0.5 P(-) = - (3/6) * log2 (3/6) = 0.5 Entropy(t) = E(t) = 0.5 + 0.5 = 1 Note: 1 indicates that the classes are highly impure. It is true in our case as there are an equal number of observations with the target class + and -.

Akash M.

problem-3nasa-wants-to-be-able-to-discriminate-between-martians-m-and-humans-h-based-on-the-following-4-characteristies-green-ny-legs-23-height-cst-smelly-cny-note-that-species-is-the-output-29878

Problem 3. NASA wants to be able to discriminate between Martians (M) and Humans (H) based on the following 4 characteristics: Green ∈ {N,Y}, Legs ∈ {2,3}, Height ∈ {S,T}, Smelly ∈ {N,Y}. Note that Species is the output (response) variable. Our available training data is as follows: [5 points] Classify the new record, Green = Y, Legs = 2, Height = S (short), Smelly = Y, as Human or Martian based on the following classification tree. [10 points] Construct a classification tree learned from the training data (assume no pruning) by splitting the predictors in the following order: Height → Legs → Green → Smelly. [10 bonus points] Determine which of the four predictors (Green, Legs, Height, Smelly) should be splitted first in building a classification tree based on reduction in impurity, i.e., find the predictor, when splitted on, leads to the largest reduction in impurity. Gini index is used in measuring the impurity.

Kenny M.

part-3using-a-dlchotomous-key-to-identify-trees-in-this-sectiona-dichotomous-key-will-be-used-to-identify-tree-species-based-on-samples-provided-by-your-instructor-refer-to-the-guide-that-fo-38455

Part 3: Using a Dichotomous Key to Identify Trees In this section, a dichotomous key will be used to identify tree species based on samples provided by your instructor. Refer to the guide that follows if any terms about the characteristics used to distinguish among trees are unfamiliar. Materials: - Tree samples - Dichotomous key - Tree Characteristics-Terminology Guide (via Clemson Extension Office Bulletin 117) Terminology Guide: - Petiole: stalk of a leaf - Leaflet: individual blade of a compound leaf - Apex: the tip or distal end of a leaf - Sinus: the space or indentation between the lobes of a leaf blade - Compound leaf: a type of leaf that has three or more leaflets attached to a common stalk - Palmately compound: veins or lobes of a leaf radiating from a central point - Pinnately compound: arrangement of leaflets attached laterally along the middle of a compound leaf Leaf Arrangement: - Opposite: leaves occurring in pairs at the nodes - Alternate: leaves arranged singly at intervals along the stems Leaf Margins (outer edge of a leaf blade): - Entire - Undulate - Finely serrate - Coarsely serrate - Doubly serrate - Crenate - Lobed Leaf Bases: - Cuneate - Obtuse - Cordate - Truncate - Oblique

Supreeta N.

Transcript

00:01 Hello, here we are with answers to the given question.

00:03 Let's start the discussion.

00:05 In this case, we are asked to apply the id3.

00:12 Application of id3 can be taken into consideration the entropy, information gain, then shape, color, size, attribute.

00:35 So, let's consider the way in which we can go for this.

00:40 This would be involving certain logical sequence to be followed.

00:44 Let's consider the sequence and method that is being required in this given scenario.

00:50 First, you have to calculate the initial entropy.

01:02 So, this is equal to 1...

Question

How is the small tree used for classification? (What is the rule for classifying?)

Question

﻿How is the small tree used for classification? (What is the rule for classifying?)

Please give Ace some feedback

How is the small tree used for classification? (What is the rule for classifying?)