this is for holding javascript data
Lucas Fidon added We_used_the_clustering_algorithm__.tex
almost 8 years ago
Commit id: 73276fb8fb289dbddb27c167115e615e028e32fe
deletions | additions
diff --git a/We_used_the_clustering_algorithm__.tex b/We_used_the_clustering_algorithm__.tex
new file mode 100644
index 0000000..908539c
--- /dev/null
+++ b/We_used_the_clustering_algorithm__.tex
...
We used the clustering algorithm described in \cite{NIPS2008_3478}. It is based on the introduced notion of stabilities of the data points to cluster. The stability of a data point measure how much we need to penalize that point such that it can no longer be chosen as a center in an optimal solution of the problem. Thanks to a measure of this stability this algorithm managed to cluster data points based on an arbitrary matrix of distances, which is the single input required by the algorithm. This quality is essential for our case since it allows us to built a relevant metric for trajectories linked to the dependencies of the distribution of players' position throw the time.
\subsection{Metrics for trajectories}
\subsection{Longuest Common Subsequence (LCSS)}
\subsection{Mutual Information based metric}
\subsubsection{Mutual Information: definition and properties}
\subsubsection{MI-based metric for trajectories}
\subsubsection{Empirical MI-based metric for trajectories}
