Andrew Rosenberg - Lecture 1.1: Introduction CSC 84020 - Machine Learning
Andrew Rosenberg - Lecture 1.1: Introduction CSC 84020 - Machine Learning
Today
Background about me
Me: Graduated from Columbia in 2009 Research Speech and Natural Language Processing (Computational Linguistics) Specically analyzing the intonation of speech. Written papers on Evaluation Measures All of my research has relied heavily on Machine Learning
You: Why are you taking this class? What is your background in and comfort with:
Calculus Linear Algebra Probability and Statistics
Classication
Identify which of N classes a data point belongs to. x is a feature vector based on some entity x. f0 (x) f (x) x= 1 ... fn1 (x) Also, sometimes, x0 x x= 1 ... xn1
Target Values
In supervised approaches, in addition to the data point x, we will also have some target value t. In classication, t represents the class of the data point. Goal of classication. Identify a function y , such that y (x) = t.
Regression
Regression is another supervised machine learning task. In classication t was a discrete variable, representing the class of the data point, in regression t is a continuous variable. Goal of regression. Identify a function y , such that y (x) = t.
Regression
Regression is another supervised machine learning task. In classication t was a discrete variable, representing the class of the data point, in regression t is a continuous variable. Goal of regression. Identify a function y , such that y (x) = t. If the goals of regression and classication are the same, what is the dierence?
Regression
Regression is another supervised machine learning task. In classication t was a discrete variable, representing the class of the data point, in regression t is a continuous variable. Goal of regression. Identify a function y , such that y (x) = t. If the goals of regression and classication are the same, what is the dierence? Evaluation.
Clustering
Clustering is an unsupervised task. Therefore we have no target information to learn. Rather, the goal is to identify groups of similar data points, that are dissimilar than others. Technically, identify a partition of the data satisfying these two constraints.
1 2
Points in the same cluster should be similar Points in dierent clusters should be dissimilar
Clustering
Clustering is an unsupervised task. Therefore we have no target information to learn. Rather, the goal is to identify groups of similar data points, that are dissimilar than others. Technically, identify a partition of the data satisfying these two constraints.
1 2
Points in the same cluster should be similar Points in dierent clusters should be dissimilar Now the tricky part: Dene Similar.
How do we do this?
Mathematical Underpinnings
What Math will we use? Probability and Statistics Calculus Linear Algebra
How much math? A lot. One common function we will use is the Gaussian Distribution.
N(x|, 2 ) =
1 2 2
exp
1 (x )2 2 2
N(x|, ) =
1 (2)D/2 ||1/2
1 exp (x )T 1 (x ) 2
All of the work we will do in this class relies on the availability of data to process. UCI: http://archive.ics.uci.edu/ml/ Netix Prize: http://archive.ics.uci.edu/ml/datasets/Netix+Prize LDC (Linguistic Data Consortium): http://www.ldc.upenn.edu/
Bye
Next
Probability Review!
Frequentists v. Bayesians Bayes Rule