2
0
Fork 0
mirror of https://github.com/MartinThoma/LaTeX-examples.git synced 2025-04-29 15:57:57 +02:00
LaTeX-examples/presentations/Datamining-Proseminar/Kurzpraesentation/LaTeX/DYCOS.tex

42 lines
1.1 KiB
TeX
Raw Normal View History

2013-11-13 19:44:46 +01:00
\subsection{DYCOS}
2013-11-15 10:47:10 +01:00
\begin{frame}{}
2013-11-13 19:44:46 +01:00
\begin{center}
\Huge
\textbf{DY}namic \textbf{C}lassification algorithm with
c\textbf{O}ntent and \textbf{S}tructure
\end{center}
\end{frame}
2013-11-27 13:40:31 +01:00
\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}
2013-11-13 19:44:46 +01:00
\end{frame}
2013-11-27 13:40:31 +01:00
%\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}