dekker.one
Group work for a Monash Research Methods course
Merge branch 'master' of https://github.com/Dekker1/ResearchMethods
+7
-1
+7
-1
mini_proj/report/waldo.tex
+7
-1
mini_proj/report/waldo.tex
···
110
110
111
111
\paragraph{$k$-Nearest Neighbors}
112
112
113
-
($k$-NN) \cite{knn}
113
+
($k$-NN) \cite{knn} is one of the simplest machine learning algorithms. It
114
+
classifies a new instance based on its ``distance'' to the known instances.
115
+
It will find the $k$ closest instances to the new instance and assign the
116
+
new instance the class that the majority of the $k$ closest instances has.
117
+
The method has to be configured in several ways: the number of $k$, the
118
+
distance measure, and (depending on $k$) a tie breaking measure all have to
119
+
be chosen.
114
120
115
121
\paragraph{Support Vector Machine}
116
122