aboutsummaryrefslogtreecommitdiff
path: root/report2/paper.md
diff options
context:
space:
mode:
authornunzip <np.scarh@gmail.com>2018-12-11 13:06:07 +0000
committernunzip <np.scarh@gmail.com>2018-12-11 13:06:07 +0000
commit395612fa3780e8addebe63544c9a050a851ee575 (patch)
treea8c1e9ed3ef154001a336ab9681ad54abfbc3b07 /report2/paper.md
parent7e95ffdec0b743ea2466f85323440a448bd7e2fe (diff)
downloadvz215_np1915-395612fa3780e8addebe63544c9a050a851ee575.tar.gz
vz215_np1915-395612fa3780e8addebe63544c9a050a851ee575.tar.bz2
vz215_np1915-395612fa3780e8addebe63544c9a050a851ee575.zip
Minor changes
Diffstat (limited to 'report2/paper.md')
-rwxr-xr-xreport2/paper.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/report2/paper.md b/report2/paper.md
index 98915e8..68b803a 100755
--- a/report2/paper.md
+++ b/report2/paper.md
@@ -81,7 +81,7 @@ This is due to the fact that the feature vectors appear scaled, releative to the
significance, for optimal distance classification, and as such normalising loses this
scaling by importance which has previously been introduced to the features.
-## kMean Clustering
+## kMeans Clustering
An addition considered for the baseline is *kMeans clustering*. In theory this method
allows to reduce computational complexity of the baseline NN by forming clusters and