📚 The CoCalc Library - books, templates and other resources
cocalc-examples / martinthoma-latex-examples / presentations / Proseminar-Netzwerkanalyse / Hauptpresentation / LaTeX / Ueberblick.tex
132940 viewsLicense: OTHER
\subsection{Überblick}1\begin{frame}{Überblick}2\begin{itemize}3\item Graph ist gegeben4\item Knoten sind teilweise beschriftet5\item Fehlende Beschriftungen sollen berechnet werden6\end{itemize}78\uncover<2>{9\textbf{Idee}: Homophilie nutzen\\10Nahe Knoten sind ähnlich\\11$\Rightarrow$ Random Walks zur Klassifizierung nutzen12}13\end{frame}1415\pgfdeclarelayer{background}16\pgfsetlayers{background,main}1718\tikzstyle{vertex}=[circle,fill=black!25,minimum size=20pt,inner sep=0pt]19\tikzstyle{selected vertex} = [vertex, fill=red!24]20\tikzstyle{blue vertex} = [vertex, fill=blue!24]21\tikzstyle{edge} = [draw,thick,-]22\tikzstyle{weight} = [font=\small]23\tikzstyle{selected edge} = [draw,line width=5pt,-,red!50]24\tikzstyle{ignored edge} = [draw,line width=5pt,-,black!20]2526\begin{frame}{Knotenklassifizierung mit Random Walks}27\begin{figure}28\begin{tikzpicture}[->,scale=1.8, auto,swap]29% Draw the vertices. First you define a list.30\foreach \pos/\name/\ltext in {{(0,0)/a/}, {(0,2)/b/b}, {(1,2)/c/},31{(1,0)/d/}, {(2,1)/e/e}, {(3,1)/f/b},32{(4,2)/g/a}, {(5,2)/h/a}, {(4,0)/i/a},33{(5,0)/j/}}34\node[draw,circle,fill=white] (\name) at \pos {$\ltext$};3536\node[draw,circle,red,fill=red] (e) at (2,1) {$e$};3738% Connect vertices with edges and draw weights39\foreach \source/ \dest /\pos in {a/b/, b/c/, c/d/, d/a/,40c/e/bend left, d/e/, e/c/,41e/f/, f/g/, f/i/,42g/f/bend right, i/f/bend left,43g/h/, h/j/, j/i/, i/g/}44\path (\source) edge [\pos] node {} (\dest);4546\foreach \fr / \number in {1/,472/b=1,483/b=1\, a=1,494/b=1\, a=2,505/b=2\, a=2,516/b=2\, a=3,527/b=2\, a=4,5313/b=3\, a=454}55\node<\fr->[fill=white] (Tlabel) at (2,0) {$\number$};5657% Start animating the edge selection.58% For convenience we use a background layer to59% highlight edges. This way we don't have to worry about60% the highlighting covering weight labels.61\begin{pgfonlayer}{background}62\foreach \source / \dest / \fr / \colorf /\pos in {e/f/2/red/,f/g/3/red/,g/h/4/red/, e/f/5/blue/, f/i/6/blue/, i/g/7/blue/,e/c/8/green/,c/d/9/green/, d/a/10/green/,e/c/11/yellow/,c/e/12/yellow/bend left,e/f/13/yellow/}63\path<\fr->[selected edge, \colorf!20] (\source.center) edge64[\pos] node {} (\dest.center);65\end{pgfonlayer}66\end{tikzpicture}67\end{figure}6869Klassifizieren des roten Knotens:70\begin{itemize}71\item Zählen von Knotenbeschriftungen in Random Walks72\item 4 Random Walks, beginnend bei Rot73\item 3 Sprünge pro Random Walk74\item<14> $4 \cdot a$, $3 \cdot b \Rightarrow$ Rot mit $a$ klassifizieren75\end{itemize}76\end{frame}7778\begin{frame}{Wortknoten}79\begin{itemize}80\item Bisher wurden keine Texte genutzt81\item Idee: Graph erweitern82\begin{itemize}83\item Texte als Wortmengen84\item Strukturknoten verweisen auf Wortknoten85\item vice versa86\end{itemize}87\end{itemize}88\end{frame}8990\framedgraphic{}{../images/wortknoten-visualisierung.pdf}91\framedgraphic{Erweiterter, semi-bipartiter Graph}{../images/graph-content-and-structure.pdf}929394