Inicio Explorar Axuda
Iniciar sesión
radu
/
LaTeX-examples
Seguir 1
Destacar 0
Fork 0
Ficheiros Incidencias 0 Pull Requests 0 Wiki
Árbore: daae9bbe0b
Ramas Etiquetas
LaTeX-examples
/
documents
/
Proseminar-Netzwerkanalyse
Martin Thoma daae9bbe0b Fix typo in documents/Proseminar-Netzwerkanalyse %!s(int64=10) %!d(string=hai) anos
..
figures 177d17e7a3 renaming %!s(int64=12) %!d(string=hai) anos
.gitignore 177d17e7a3 renaming %!s(int64=12) %!d(string=hai) anos
Analyse.tex 7e05f83a95 Fix typos, formatting %!s(int64=10) %!d(string=hai) anos
Ausarbeitung-Thoma.pdf daae9bbe0b Fix typo in documents/Proseminar-Netzwerkanalyse %!s(int64=10) %!d(string=hai) anos
Ausarbeitung-Thoma.tex 7e05f83a95 Fix typos, formatting %!s(int64=10) %!d(string=hai) anos
Ausblick.tex 7e05f83a95 Fix typos, formatting %!s(int64=10) %!d(string=hai) anos
DYCOS-Algorithmus.tex 7e05f83a95 Fix typos, formatting %!s(int64=10) %!d(string=hai) anos
Einleitung.tex 7e05f83a95 Fix typos, formatting %!s(int64=10) %!d(string=hai) anos
Makefile f02d9ab873 Add line breaks %!s(int64=10) %!d(string=hai) anos
README.md d7a871483f Add abstract to documents/Proseminar-Netzwerkanalyse %!s(int64=10) %!d(string=hai) anos
Related-Work.tex daae9bbe0b Fix typo in documents/Proseminar-Netzwerkanalyse %!s(int64=10) %!d(string=hai) anos
SchwaechenVerbesserungen.tex 7e05f83a95 Fix typos, formatting %!s(int64=10) %!d(string=hai) anos
Sprungtypen.tex 7e05f83a95 Fix typos, formatting %!s(int64=10) %!d(string=hai) anos
Vokabularbestimmung.tex 7e05f83a95 Fix typos, formatting %!s(int64=10) %!d(string=hai) anos
abstract.tex 7e05f83a95 Fix typos, formatting %!s(int64=10) %!d(string=hai) anos
literatur.bib f02d9ab873 Add line breaks %!s(int64=10) %!d(string=hai) anos
mystyle.sty f02d9ab873 Add line breaks %!s(int64=10) %!d(string=hai) anos

README.md

About

The document in this folder is part of a proseminar at KIT. It is written in German.

Ausarbeitung zum Proseminar "Netzwerkanalyse" am KIT.

Die Ausarbeitung soll 10-12 Seiten haben und die Präsentation 25-30 Minuten dauern und 10-15 Minuten Diskussion.

Zu der Ausarbeitung gehört eine Präsentation.

Abstract - English

This paper explains the DYCOS-Algorithm as it was introduced in by Aggarwal and Li in 2011. It operates on graphs whichs nodes are partially labeled and automatically adds missing labels to nodes. To do so, the DYCOS algorithm makes use of the structure of the graph as well as content which is assigned to the node. Aggarwal and Li measured in an experimental analysis that DYCOS adds the missing labels to a Graph with 19396 nodes of which 14814 are labeled and another Graph with 806635 nodes of which 18999 are labeld on one core of an Intel Xeon 2.5 GHz CPU with 32 G RAM within less than a minute. Additionally, extensions of the DYCOS algorithm are proposed.