-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathreport.tex
49 lines (37 loc) · 1.43 KB
/
report.tex
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
\documentclass{article}
\usepackage[utf8]{inputenc}
\usepackage{graphicx}
\graphicspath{ {./images/} }
\title{TDT4173 - Task 1}
\author{Håvard Hjelmeseth}
\date{September 2021}
\begin{document}
\maketitle
\section{K-means algorithm}
For my first algorithm i have decided to implement the K-means algorithm
, which is an unsupervised learning algorithm for data classification. The
algorithm could be improved by running it multiple times with randomized
inital centroids for the clusters, and choosing the ones which give the
best results.
\subsection{First dataset}
The first dataset contains points in a 2D space, where the points seem to have
a natural separation into two clusters. The implementation of the algorithm
seems to have no issues with this dataset.
\begin{figure}[!h]
\centering
\includegraphics[width=0.5\textwidth]{kmeans_data1.png}
\caption{First dataset classification with k-means}
\label{fig:dataset1}
\end{figure}
\subsection{Second dataset}
The second dataset is a bit harder, where the points are still in a 2D space,
but does not longer have a natural separation into two clusters. Running the kmeans
algorithm with k=10 clusters seems to give a good result as seen in the plots.
\begin{figure}[h]
\centering
\includegraphics[width=0.5\textwidth]{kmeans_data2.png}
\caption{Second dataset classification with k-means}
\label{fig:dataset2}
\end{figure}
\section{Second algorithm}
\end{document}