Skip to content

Commit

Permalink
exercise-clustering: Fixed three small typos in the DBSCAN task
Browse files Browse the repository at this point in the history
  • Loading branch information
dominik-probst committed Jul 9, 2024
1 parent 1c15184 commit 313ae28
Showing 1 changed file with 3 additions and 3 deletions.
6 changes: 3 additions & 3 deletions exercise/5-Clustering.tex
Original file line number Diff line number Diff line change
Expand Up @@ -1075,7 +1075,7 @@ \subsubsection*{Task 1.3: Density Reachability}

\item \textbf{Point $(2,1)$:}

The point $(2,1)$ is directly density reachable from the core point $(1,2)$. However, it seems like there is a chain of points leading from the core point $(1,2)$ to the point $(1,1)$ and then to the point $(2,1)$.
The point $(2,1)$ is not directly density reachable from the core point $(1,2)$. However, it seems like there is a chain of points leading from the core point $(1,2)$ to the point $(1,1)$ and then to the point $(2,1)$.

To prove that this chain is possible, we have to prove the following:

Expand Down Expand Up @@ -1131,7 +1131,7 @@ \subsubsection*{Task 1.3: Density Reachability}

\dotfill

\item \textbf{Point $(1,4)$:}
\item \textbf{Point $(4,4)$:}

While the point $(4,4)$ seems to be density reachable from the points $(3,4)$ and $(4,3)$, neither of these points are in the $\varepsilon$-neighborhood of any other point. Thus, the point $(4,4)$ is not density reachable from the core point $(1,2)$.

Expand Down Expand Up @@ -1211,7 +1211,7 @@ \subsubsection*{Task 1.3: Density Reachability}

\subsubsection*{Task 1.4: Density Connectivity}

Determine whether $(1,1)$, $(3,2)$, $(4,3)$, and $(4,4)$ are \textbf{density connected} to the core point $(3,4)$ if a density based clustering algorithm like \textbf{DBSCAN} is initialized with $\varepsilon = 1$ and $MinPts = 3$. The distance is calculated using the Euclidean distance.
Determine whether $(1,1)$, $(3,2)$, $(4,3)$, and $(4,4)$ are \textbf{density connected} to the point $(3,4)$ if a density based clustering algorithm like \textbf{DBSCAN} is initialized with $\varepsilon = 1$ and $MinPts = 3$. The distance is calculated using the Euclidean distance.

\begin{solution}
Points are density connected if there is a core point from which both points are density reachable. Thus, we have to check whether there is a core point from which both points are density reachable.
Expand Down

0 comments on commit 313ae28

Please sign in to comment.