Machine Learning Flashcards

1
Q

Machine Learning

A

Programs that can improve their performance with training data via a learning algorithm.

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

Learning benefit instead of deterministic outputs

A
  • Designer cannot anticipate all possible situations.
  • Designer cannot anticipate changes.
  • Designer does not know the answer/ how to program the answer.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Applications

A
  • Facial detection
  • Speech recognition
  • Stock prediction
  • Digit recognition
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Representing Instances (Feature vectors)

A

For example, mushrooms:
x^(1) = <bell, fibrous, …> y^(1) = edible
x^(2) = <convex, scaly, …> y^(2) = non-edible

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

Feature Types:

A

Nominal/Boolean -> no ordering
Ordinal -> possible values are totally ordered
Numeric -> weight, height etc
Hierarchical -> ordered via hierarchy

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

Feature Space

A

Way of representing features and the distributions on where the vectors fit. Can be via 3D models or databases etc

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

Data Preprocessing

A

Techniques that make it easier for data to be used for analysis by machine learning models.

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

Mean Normalisation

A

Remove mean from every data sample.

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

Standardisation / Normalisation

A

Requires all features to be on the same scale.

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

I.I.D

A

Independent and identically distributed.
We assume data collected is sampled independently from the same unknown distribution.

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

Supervised Learning

A
  • Set of instances X
  • Unknown target function f : X -> Y
  • Set of models H = {h |h : X -> Y}
  • Set of training instances (x(1), y(1)),(x(2),y(2)),…,(x(z),y(z))
  • Chosen model should most accurately represent the target function X -> Y
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Regression

A

A supervised learning technique which estimates parameters (used when Y is continuous)

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

Classification

A

A supervised learning technique which estimates classes (used when Y is discrete)

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

Unsupervised Learning

A
  • Set of instances without y’s -> x(1), x(2),…,x(z).
  • Goal is to discover patterns and regularities.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Clustering

A

An unsupervised learning technique which maps data into different clusters.

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

Dimensionality Reduction

A

An unsupervised learning technique which lowers dimension features whilst preserving key features.

17
Q

Semi-supervised Learning

A

Using labelled as well as unlabeled data to perform certain learning tasks.

18
Q

Learned Decision Tree

A

A tree-like model which shows how models come to conclusions.

19
Q

Batch Learning

A

When a earner is given training data as a batch.

20
Q

Online Learning

A

Instances are sent sequentially, updating the model after every instance.

21
Q

Active Learning

A

Learner can select instances for training.

22
Q

Concept Drift

A

The target function (f : X -> Y) changes over time.