nction plotDecisionBoundary (theta, X, y) LOTDECISIONBOUNDARY Plots the data points X and y into a new figure wi he decision boundary defined by theta PLOTDECISIONBOUNDARY (theta, X,y) plots the data points with + for the positive examples and o for the negative examples. X is assumed to be a either 1) Mx3 matrix, where the first column is an all-ones column for the intercept. 2) MxN, N>3 matrix, where the first column is all-ones Plot Data ptData (X (:,2:3), y); ld on size (X, 2) <= 3 % Only need 2 points to define a line, so choose two endpoints plot_x = [min (X (:, 2))-2, * Calculate the decision boundary line plot_y = (-1./theta (3)).* (theta (2).*plot_x + theta (1)); * Plot, and adjust axes for better viewing plot (plot_x, plot_y) * Legend, specific for the exercise legend ('Admitted', 'Not admitted', 'Decision Boundary') se axis ([30, 100, 30, 100]) * Here is the grid range u = linspace (-1, 1.5, 50); max (X (:, 2))+2]; olo olo olo olo olo olo olo olo olo olo olo olo
nction plotDecisionBoundary (theta, X, y) LOTDECISIONBOUNDARY Plots the data points X and y into a new figure wi he decision boundary defined by theta PLOTDECISIONBOUNDARY (theta, X,y) plots the data points with + for the positive examples and o for the negative examples. X is assumed to be a either 1) Mx3 matrix, where the first column is an all-ones column for the intercept. 2) MxN, N>3 matrix, where the first column is all-ones Plot Data ptData (X (:,2:3), y); ld on size (X, 2) <= 3 % Only need 2 points to define a line, so choose two endpoints plot_x = [min (X (:, 2))-2, * Calculate the decision boundary line plot_y = (-1./theta (3)).* (theta (2).*plot_x + theta (1)); * Plot, and adjust axes for better viewing plot (plot_x, plot_y) * Legend, specific for the exercise legend ('Admitted', 'Not admitted', 'Decision Boundary') se axis ([30, 100, 30, 100]) * Here is the grid range u = linspace (-1, 1.5, 50); max (X (:, 2))+2]; olo olo olo olo olo olo olo olo olo olo olo olo
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
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education