Income < 60 no yes (non-owner 12 12 Lot_Size < 21 Lot_Size < 20 non-owner owner 7 1 5 11 non-owner owner Income < 85 owner 7 0 0 1 0 7 non-owner 5 4 non-owner owner 5 1 0 3 This classification tree sorts customers who have either purchased and become owners of a riding mower or not based on their annual income (in Kilobucks) and the size of their home lot (in 1000s of square feet). Each node of the tree ists the number of non-owners and owners in that partition and the classification decision based on a majority vote. Suppose we impose a stopping criterion that prevents a splitting that yields a eaf with fewer than 3 cases. Which splitting question would be pruned in this case?

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
yes
Income < 60
no
(non-owner
12 12
Lot_Size < 21
Lot_Size < 20
owner
5 11
non-owner
7 1
non-owner
owner
Income < 85
owner
7 0
01
0 7
non-owner
5 4
non-owner
owner
5 1
0 3
This classification tree sorts customers who have either purchased and become
owners of a riding mower or not based on their annual income (in Kilobucks)
and the size of their home lot (in 1000s of square feet). Each node of the tree
lists the number of non-owners and owners in that partition and the
classification decision based on a majority vote.
Suppose we impose a stopping criterion that prevents a splitting that yields a
leaf with fewer than 3 cases.
Which splitting question would be pruned in this case?
Transcribed Image Text:yes Income < 60 no (non-owner 12 12 Lot_Size < 21 Lot_Size < 20 owner 5 11 non-owner 7 1 non-owner owner Income < 85 owner 7 0 01 0 7 non-owner 5 4 non-owner owner 5 1 0 3 This classification tree sorts customers who have either purchased and become owners of a riding mower or not based on their annual income (in Kilobucks) and the size of their home lot (in 1000s of square feet). Each node of the tree lists the number of non-owners and owners in that partition and the classification decision based on a majority vote. Suppose we impose a stopping criterion that prevents a splitting that yields a leaf with fewer than 3 cases. Which splitting question would be pruned in this case?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Eight puzzle problem
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education