KOPS - Das Institutionelle Repositorium der Universität Konstanz

Using a Knowledge Graph Data Structure to Analyze Text Documents (VAST Challenge 2014 MC1)

Using a Knowledge Graph Data Structure to Analyze Text Documents (VAST Challenge 2014 MC1)

Publikationstyp: Beitrag zu einer Konferenz
Autor/innen: Stoffel, Florian; Fischer, Fabian
Erscheinungsjahr: 2014
Konferenz: IEEE Conference on Visual Analytics Science and Technology (VAST), 2014, 9. Okt 2014 - 14. Okt 2014, Paris
Erschienen in: 2014 IEEE Conference on Visual Analytics Science and Technology (VAST), Paris, France, 9-14 October 2014, Proceedings / Min Chen ... (Hrsg.). - Piscataway, NJ : IEEE, 2014. - S. 331-332. - ISBN 978-1-4799-6227-3
DOI (zitierfähiger Link): https://dx.doi.org/10.1109/VAST.2014.7042551
Zusammenfassung:
In this paper, we describe the tools and the analysis pipeline we used in order to create a data structure out of the given data. Afterwards, we introduce a workflow used to find answers to the questions of VAST Challenge 2014 MC1. Most of the processes presented in the following have been used solely to create, refine a graph (node-link diagram), which is the foundation for everything we did in this mini challenge.
Fachgebiet (DDC): 004 Informatik
Universitätsbibliographie: Ja

Zitieren

Dateien zu dieser Ressource

Dateien Größe Format Anzeige

Zu diesem Dokument gibt es keine Dateien.

STOFFEL, Florian, Fabian FISCHER, 2014. Using a Knowledge Graph Data Structure to Analyze Text Documents (VAST Challenge 2014 MC1). IEEE Conference on Visual Analytics Science and Technology (VAST), 2014. Paris, 9. Okt 2014 - 14. Okt 2014. In: MIN CHEN ..., , ed.. 2014 IEEE Conference on Visual Analytics Science and Technology (VAST), Paris, France, 9-14 October 2014, Proceedings. IEEE Conference on Visual Analytics Science and Technology (VAST), 2014. Paris, 9. Okt 2014 - 14. Okt 2014. Piscataway, NJ:IEEE, pp. 331-332. ISBN 978-1-4799-6227-3. Available under: doi: 10.1109/VAST.2014.7042551

@inproceedings{Stoffel2014Using-30004, title={Using a Knowledge Graph Data Structure to Analyze Text Documents (VAST Challenge 2014 MC1)}, year={2014}, doi={10.1109/VAST.2014.7042551}, isbn={978-1-4799-6227-3}, address={Piscataway, NJ}, publisher={IEEE}, booktitle={2014 IEEE Conference on Visual Analytics Science and Technology (VAST), Paris, France, 9-14 October 2014, Proceedings}, pages={331--332}, editor={Min Chen ...}, author={Stoffel, Florian and Fischer, Fabian} }

<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/rdf/resource/123456789/30004"> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Stoffel, Florian</dc:creator> <dc:contributor>Stoffel, Florian</dc:contributor> <dc:language>eng</dc:language> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:issued>2014</dcterms:issued> <dcterms:title>Using a Knowledge Graph Data Structure to Analyze Text Documents (VAST Challenge 2014 MC1)</dcterms:title> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-02-24T14:14:51Z</dc:date> <dc:creator>Fischer, Fabian</dc:creator> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2015-02-24T14:14:51Z</dcterms:available> <dcterms:abstract xml:lang="eng">In this paper, we describe the tools and the analysis pipeline we used in order to create a data structure out of the given data. Afterwards, we introduce a workflow used to find answers to the questions of VAST Challenge 2014 MC1. Most of the processes presented in the following have been used solely to create, refine a graph (node-link diagram), which is the foundation for everything we did in this mini challenge.</dcterms:abstract> <dc:contributor>Fischer, Fabian</dc:contributor> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/30004"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> </rdf:Description> </rdf:RDF>

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto