Skip to content

Commit 3750a15

Browse files
committed
small cleanup
1 parent 92a1a30 commit 3750a15

File tree

14 files changed

+13
-17
lines changed

14 files changed

+13
-17
lines changed

content/Unit 4/Artificial Intelligence/Artificial Intelligence.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@ AIs 'create'/train their own algorithm given input and (most of the time) expect
1212

1313
## Machine learning
1414
A sub-type of AI that "learns" from data to make predictions and classifications, given new information.
15-
See [[Types of Machine Learning|types of machine learning.]]
15+
See [[Training with Data (Types of machine learning)|types of machine learning.]]
1616
## Research
1717
It is a field of research in computer science that develops and studies methods and software that enable machines to perceive their environment, and use learning and intelligence to take actions that maximise their chances of achieving defined goal.
1818
## Examples

content/Unit 4/Artificial Intelligence/Machine Learning/Classification/Classification types/Linear classification/Linear Classification.md

Lines changed: 0 additions & 2 deletions
This file was deleted.

content/Unit 4/Artificial Intelligence/Machine Learning/Classification/Classification types/Linear classification/Margin boundaries (Linear).md

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -22,5 +22,4 @@ More specifically
2222
- $h(x)=1$
2323
- **Class -1 boundary**
2424
- $h(x)=-1$
25-
The margin for this pair of margin boundaries is $m=\frac{2}{||w||}$
26-
($||w||$ is magnitude of vector $w$, it is the more formal (?) version of VCE spesh's $|w|$)
25+
The margin for this pair of margin boundaries is $m=\frac{2}{||w||}$, where $||w||$ is the magnitude of the weights (distance from the origin)

content/Unit 4/Artificial Intelligence/Machine Learning/Featues/Feature modification.md renamed to content/Unit 4/Artificial Intelligence/Machine Learning/Features/Feature modification.md

File renamed without changes.

content/Unit 4/Artificial Intelligence/Machine Learning/Featues/Feature.md renamed to content/Unit 4/Artificial Intelligence/Machine Learning/Features/Feature.md

File renamed without changes.

content/Unit 4/Artificial Intelligence/Machine Learning/Featues/Kernel Trick.md renamed to content/Unit 4/Artificial Intelligence/Machine Learning/Features/Kernel Trick.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
1-
 A kernel trick involve using linear classifiers to solve non linear problems.
1+
A kernel trick involves using linear classifiers to solve non linear problems.
22
Named from the use of kernel functions.
33
Involves introducing a new feature derived from preexisting features (see [[Feature modification]]).

content/Unit 4/Artificial Intelligence/Machine Learning/ML algorithms/Linear classifier.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
A [[Types of Machine Learning|supervised]] machine learning model that assigns data points to categories by finding a linear decision boundary (a line in 2D, a plane in 3D, and a hyperplane in above 3 dimensions) to seperate them.
1+
A [[Model training|]] machine learning model that assigns data points to categories by finding a linear decision boundary (a line in 2D, a plane in 3D, and a hyperplane in above 3 dimensions) to seperate them.
22
## Rigorous definition
33
A classification algorithm that makes a decision for each object based on a linear combination of its [[Feature|features]].
44
## Types

content/Unit 4/Artificial Intelligence/Machine Learning/ML algorithms/Support Vector Machine.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
(also known as SVM) a [[Types of Machine Learning|supervised]] machine learning algorithm used for classification and regression tasks.
1+
(also known as SVM) a [[Training with Data (Types of machine learning)#Supervised Machine Learning|supervised]] machine learning algorithm used for classification and regression tasks.
22
It is a margin-maximising [[Linear classifier|linear classifier]]. It tries to find the best boundary that separates different classes in the data.
33

44
## Principle

content/Unit 4/Artificial Intelligence/Machine Learning/Training with Data (Types of machine learning).md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -3,9 +3,9 @@ Satisfies study design dot-point "explain, at a high level, how data-driven algo
33
Data-driven algorithms, such as machine learning models, learn from data by finding and recognising patterns.
44

55
Instead of being explicitly programmed with rules, algorithms 'train' on a large dataset contained with input data and, depending on their type of learning, their corresponding correct output:
6-
- [[Types of Machine Learning|supervised]] learning
6+
- [[Training with Data (Types of machine learning)#Supervised Machine Learning|supervised]] learning
77
- the algorithm is given labelled data, with each input having a correct answer. (e.g. email contents, and whether the email is spam)
8-
- [[Types of Machine Learning|unsupervised]] learning
8+
- [[Training with Data (Types of machine learning)#Unsupervised Machine Learning|unsupervised]] learning
99
- the algorithm is given unlabelled data with no correct answers. The algorithm then attempts to find hidden groupings on its own.
1010
- reinforcement learning
1111
- the algorithm learns through trial and error

content/Unit 4/Artificial Intelligence/Machine Learning/Vector notation for weight and data.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -36,7 +36,7 @@ Note: if treating $x$ and $w$ as matrices, need to transpose the first term, eg
3636
$$
3737
\text{vector dot product of w and x}=-b\text{ (constant number)}
3838
$$
39-
You may recognise this from spec as the cartesian equation for a plane/hyperplane
39+
You may recognise this from Specialist Maths as the cartesian equation for a plane/hyperplane
4040
($r\cdot n=r_{0}\cdot n$).
4141

4242
Here $r$, or the position vector, is represented by $x$.

0 commit comments

Comments
 (0)