tex-projects/LaTeX-examples
2
0
Fork 0
mirror of https://github.com/MartinThoma/LaTeX-examples.git synced 2025-04-29 07:47:57 +02:00
Code Activity

Verbesserungsvorschlaege von C. Oessner (Email vom 15.01.2014) eingearbeitet

Browse source
This commit is contained in:
Martin Thoma 2014-01-18 14:13:57 +01:00
parent d6b12cecf2
commit ea12f2170d
20 changed files with 2615 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

41
presentations/Datamining-Proseminar/Hauptpresentation/LaTeX/DYCOS.tex Normal file
View file

@ -0,0 +1,41 @@
\subsection{DYCOS}
\begin{frame}{}
\begin{center}
\Huge
\textbf{DY}namic \textbf{C}lassification algorithm with
c\textbf{O}ntent and \textbf{S}tructure
\end{center}
\end{frame}
\begin{frame}{DYCOS}
DYCOS zeichnet sich aus durch:
\begin{itemize}
\item \textbf{Geschwindigkeit}: < $10\si{\second}$ für
\begin{itemize}
\item $806\,635$ Knoten ($18\,999$ mit Labels)
\item $4\,414\,135$ Kanten
\end{itemize}
\item \textbf{Genauigkeit}: > $65\%$
\end{itemize}
\end{frame}
%\begin{frame}{Der Algorithmus}
%\begin{algorithm}[H]
% \begin{algorithmic}
% \Function{DYCOS}{Network $G_t = (N_t, A_t, T_t), l, h, p_s$}
% \ForAll{node $v$ in $T_t$} \Comment{Für jeden gelabelten Knoten}
% \For{$i \in 1, \dots, l$}
% \State Perform an $h$-hop random walk from $v$
% \EndFor
% \State Classify $v$ with the class labels most frequent
% encountered
% \EndFor
% \EndFunction
% \end{algorithmic}
%\caption{DYCOS algorithm for classification with content and structure}
%\label{alg:seq1}
%\end{algorithm}
%\end{frame}