Overview and A Machine Learning Algorithm
Overview and A Machine Learning Algorithm
Machine Learning 10-701 Tom M. Mitchell Center for Automated Learning and Discovery Carnegie Mellon University September 13, 2005
Machine Learning:
Study of algorithms that improve their performance at some task with experience
Object Detection
(Prof. H. Schneiderman)
Text Classification
Each internal node: test one attribute Xi Each branch from a node: selects one value for Xi Each leaf node: predict Y (or P(Y|X leaf))
Entropy
Entropy H(X) of a random variable X
H(X) is the expected number of bits needed to encode a randomly drawn value of X (under most efficient code) Why? Information theory: Most efficient code assigns -log2P(X=i) bits to encode the message X=i So, expected number of bits is:
Sample Entropy
Decision tree learning Greedy top-down learning of decision trees (ID3, C4.5, ...) Overfitting and tree/rule post-pruning Extensions