Algorithmic analysis of large networks by computing structural indices
| dc.contributor.author | Gulden, Christoph | deu |
| dc.date.accessioned | 2011-03-22T17:45:07Z | deu |
| dc.date.available | 2011-03-22T17:45:07Z | deu |
| dc.date.issued | 2004 | deu |
| dc.description.abstract | We present suitable design patterns and basic algorithms and use them to discuss the computation of popular network indices. With methods from discrete statistics, we are able to visualize and summarize these results for large networks. Furthermore, we talk about heuristic speed-up and approximation techniques to handle even networks that are too large to get the correct results in an acceptable time. | eng |
| dc.description.version | published | |
| dc.format.mimetype | application/pdf | deu |
| dc.identifier.ppn | 113803796 | deu |
| dc.identifier.uri | http://kops.uni-konstanz.de/handle/123456789/580 | |
| dc.language.iso | eng | deu |
| dc.legacy.dateIssued | 2004 | deu |
| dc.rights | terms-of-use | deu |
| dc.rights.uri | https://rightsstatements.org/page/InC/1.0/ | deu |
| dc.subject.ddc | 510 | deu |
| dc.subject.gnd | Netzwerkanalyse | deu |
| dc.subject.gnd | Multigraph | deu |
| dc.subject.gnd | Framework <Informatik> | deu |
| dc.subject.gnd | Indexberechnung | deu |
| dc.subject.gnd | Statistische Analyse | deu |
| dc.subject.gnd | Visualisierung | deu |
| dc.subject.gnd | Beschleunigung | deu |
| dc.subject.gnd | Approximation | deu |
| dc.title | Algorithmic analysis of large networks by computing structural indices | eng |
| dc.type | MSC_THESIS | deu |
| dspace.entity.type | Publication | |
| kops.citation.bibtex | @mastersthesis{Gulden2004Algor-580,
year={2004},
title={Algorithmic analysis of large networks by computing structural indices},
author={Gulden, Christoph}
} | |
| kops.citation.iso690 | GULDEN, Christoph, 2004. Algorithmic analysis of large networks by computing structural indices [Master thesis] | deu |
| kops.citation.iso690 | GULDEN, Christoph, 2004. Algorithmic analysis of large networks by computing structural indices [Master thesis] | eng |
| kops.citation.rdf | <rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/580">
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
<dcterms:title>Algorithmic analysis of large networks by computing structural indices</dcterms:title>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dcterms:issued>2004</dcterms:issued>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/580/1/diplomArbeit.pdf"/>
<dc:language>eng</dc:language>
<dc:contributor>Gulden, Christoph</dc:contributor>
<dcterms:abstract xml:lang="eng">We present suitable design patterns and basic algorithms and use them to discuss the computation of popular network indices. With methods from discrete statistics, we are able to visualize and summarize these results for large networks. Furthermore, we talk about heuristic speed-up and approximation techniques to handle even networks that are too large to get the correct results in an acceptable time.</dcterms:abstract>
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/580"/>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-22T17:45:07Z</dcterms:available>
<dc:rights>terms-of-use</dc:rights>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/580/1/diplomArbeit.pdf"/>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-22T17:45:07Z</dc:date>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dc:creator>Gulden, Christoph</dc:creator>
<dc:format>application/pdf</dc:format>
</rdf:Description>
</rdf:RDF> | |
| kops.description.abstract | Netzwerke werden verwendet, um Beziehungen zwischen Aktoren darzustellen. Netzwerke können analysiert werden, indem man Indizes, d.h. numerische Werte, für die einzelnen Aktoren und Verbindungen berechnet, welche lediglich von der Netzwerkstruktur abhängen. Es wird ein System von grundlegenden Algorithmen entworfen, um entsprechende Berechnungen kompakt darzustellen und gleichzeitig deren effiziente Umsetzung in einer objektorientierten Umgebung zu erleichtern. Diese Basisalgorithmen werden verfeinert, um Indizes zu berechnen die sowohl lokale als auch globale Eigenschaften von Aktoren widerspiegeln. Um die berechneten Indizes auszuwerten, werden Verfahren aus der diskreten Statistik vorgestellt. Da die Algorithmen für die Berechnung von Abstands-basierten Indizes für grosse Netzwerke zu aufwendig sind, stellen wir Möglichkeiten vor, diese Berechnung zu beschleunigen oder zu approximieren. | eng |
| kops.description.openAccess | openaccessgreen | |
| kops.identifier.nbn | urn:nbn:de:bsz:352-opus-13161 | deu |
| kops.opus.id | 1316 | deu |
Dateien
Originalbündel
1 - 1 von 1
Vorschaubild nicht verfügbar
- Name:
- diplomArbeit.pdf
- Größe:
- 799.43 KB
- Format:
- Adobe Portable Document Format
