Week 1: Introduction to Pattern Recognition Flashcards

1
Q

Pattern Recognition

A

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.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Exemplar

A

A particular datapoint which is represented by a feature vector (also called item, sample, instance,…)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Dataset

A

The collection of feature vectors for all exemplars.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Generalisation

A

How well a model performs on new data.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Overfitting

A

Making the model so specific to the training data that it fails to generalise to new data.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Decision Theory

A

Methods for making decisions that reduce cost rather than misclassification rate.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Feature Space

A

The (multidimensional) space defined by the feature vectors in the dataset.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Linearly Separable

A

Exemplars from two classes can be separated by a hyperplane in the feature space.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Dichotomiser

A

A classifier that places exemplars in one of two classes (also called a binary classifier).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Hyper-Parameter

A

A value used by the learning algorithm in its search for the optimal parameters of the classifier.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Grid search

A

A method of trying to find suitable hyper-parameters that searches all possible combinations of values within defined ranges.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Training data

A

The collection of feature vectors used by the learning algorithm to tune the parameters of the classifier.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Test data

A

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).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Classification

A

A method that learns to predict a class label associated with each exemplar.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Regression

A

A method that learns to predict a continuous value for each exemplar.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Semi-supervised

A

A method that learns using both labelled and unlabelled training exemplars.

17
Q

Transfer

A

A method that pre-trains a classifier on another task before training it on the main task in the hope that the pre-training will help improve performance on the main task.

18
Q

Supervised Learning

A

When the dataset is labelled with the desired output being known for each instance, and the learning algorithm is able to evaluate the performance as the model is trained.

19
Q

Unsupervised Learning

A

When the dataset is unlabelled with the desired output being unknown for each instance, and the learning algorithm must find ways to find similar groupings of instances.

20
Q

Weakly-Supervised Learning

A

Supervised learning with inexact or inaccurate labels

21
Q

Machine Learning

A

It’s a broader discipline than Pattern Recognition that also includes reasoning about data in A.I.

22
Q

Artificial Neural Networks

A

It’s a narrower discipline than Pattern Recognition, focuses more in neuroscience, inspired neural network architectures.

23
Q

Deep Learning

A

A subset of Artificial Neural Networks, focusing on networks with many hidden layers with more complexity and less explainability.

24
Q

Error Rate

A

(False Positive + False Negative)/(False Positive + False Negative + True Positive + True Negative)

25
Q

Confusion Matrix

A

A table that measured the number of False Positives, False Negatives, True Positive, and True Negatives

26
Q

True Positive

A

When a positive instance is predicted as positive.

27
Q

True Negative

A

When a negative instances is predicted as negative.

28
Q

False Positive

A

When a negative instance is predicted as positive.

29
Q

False Negative

A

When a positive instance is predicted as negative.

30
Q

Accuracy

A

(True Positive + True Negative)/(False Positive + False Negative + True Positive + True Negative)

31
Q

Recall

A

(True Positive)/(True Positive + False Negative)

32
Q

Precision

A

(True Positive)/(True Positive + False Positive)

33
Q

F-1 Score

A

(2 * recall * precision)/(recall + precision) = (2 * True Positive) / (2 * True Positive + False Positive + False Negative)