Week 1: Introduction to Pattern Recognition Flashcards
Pattern Recognition
It’s concerned with creating algorithms that can assign names to observations, or make decisions based on data. Pattern recognitions is suitable for tasks that aren’t purely analytical, such as classifying numbers as prime or composite, or using Newtonian equations to calculate the trajectory of a projectile.
Exemplar
A particular datapoint which is represented by a feature vector (also called item, sample, instance,…)
Dataset
The collection of feature vectors for all exemplars.
Generalisation
How well a model performs on new data.
Overfitting
Making the model so specific to the training data that it fails to generalise to new data.
Decision Theory
Methods for making decisions that reduce cost rather than misclassification rate.
Feature Space
The (multidimensional) space defined by the feature vectors in the dataset.
Linearly Separable
Exemplars from two classes can be separated by a hyperplane in the feature space.
Dichotomiser
A classifier that places exemplars in one of two classes (also called a binary classifier).
Hyper-Parameter
A value used by the learning algorithm in its search for the optimal parameters of the classifier.
Grid search
A method of trying to find suitable hyper-parameters that searches all possible combinations of values within defined ranges.
Training data
The collection of feature vectors used by the learning algorithm to tune the parameters of the classifier.
Test data
The collection of feature vectors used by the model to evaluate the performance of the trained classifier (this dataset should be distinct from the training data to ensure generalisation).
Classification
A method that learns to predict a class label associated with each exemplar.
Regression
A method that learns to predict a continuous value for each exemplar.