卡内基梅隆大学的Tom Mitchell定义的机器学习是这么说的, 一个程序被认为能从经验E中学习,解决任务 T,达到性能度量值P,当且仅当,有了经验E后,经过P评判, 程序在处理 T 时的性能有所提升。
举例来说,一个区分邮件是否是垃圾邮件的程序,T就是区分邮件是否是垃圾邮件(Task),E就是对人已经分好标签的邮件进行学习(Experience),P就是对一个没有标签的邮件进行区分的正确率(Performance measure)
原文如下:
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.