deletions | additions       diff --git a/subsection_Visualization_of_result_Once__.tex b/subsection_Visualization_of_result_Once__.tex  index e7a8086..266e76c 100644  --- a/subsection_Visualization_of_result_Once__.tex  +++ b/subsection_Visualization_of_result_Once__.tex 
...
\vdots & \ddots & \vdots \\  d_{MI}(T_{1},T_{n}) & \cdots & d_{MI}(T_{n},T_{n}) \end{array} \right).\]  And then Then  the clustering of the whole set of trajectories can be calculated using the clustering algorithm of \cite{NIPS2008_3478}. Then At last  come the thorny issue of interpretation of the given clustering. To this purpose, as a first approach we animate the trajectories belonging to the same cluster.