Scribd
Upload
49 views2 pages

Machine Learning Stanford University (Coursera) Andrew NG

Machine learning is defined as either giving computers the ability to learn without explicit programming or as a computer program improving its performance on some task based on experience, as measured by some performance metric. There are two broad classifications of machine learning problems: supervised learning, where the computer is presented with labeled examples and learns to predict the correct label for new examples, and unsupervised learning, where the computer finds hidden patterns or grouping in unlabeled data.

Uploaded by

alchon6354
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
49 views2 pages

Machine Learning Stanford University (Coursera) Andrew NG

Machine learning is defined as either giving computers the ability to learn without explicit programming or as a computer program improving its performance on some task based on experience, as measured by some performance metric. There are two broad classifications of machine learning problems: supervised learning, where the computer is presented with labeled examples and learns to predict the correct label for new examples, and unsupervised learning, where the computer finds hidden patterns or grouping in unlabeled data.

Uploaded by

alchon6354
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Machine Learning

Stanford University (Coursera)


Andrew Ng
What is Machine Learning?
Two definitions of Machine Learning are offered. Arthur Samuel described it as: "the field of study that gives
computers the ability to learn without being explicitly programmed." This is an older, informal definition.

Tom Mitchell provides a more modern definition: "A computer program is said to learn from experience E
with respect to some class of tasks T and performance measure P, if its performance at tasks in T, as
measured by P, improves with experience E."

Example: playing checkers.

E = the experience of playing many games of checkers

T = the task of playing checkers.

P = the probability that the program will win the next game.

In general, any machine learning problem can be assigned to one of two broad classifications:

Supervised learning and Unsupervised learning.

You might also like