CET : A Tool for Creative Exploration of Graphs

Haun, Stefan; Nürnberger, Andreas; Kötter, Tobias; Thiel, Kilian; Berthold, Michael R.

CET : A Tool for Creative Exploration of Graphs

Dateien

Haun_236936.pdfGröße: 1.77 MBDownloads: 406

Datum

2010

Autor:innen

Haun, Stefan

Nürnberger, Andreas

Kötter, Tobias

Thiel, Kilian

Berthold, Michael R.

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

BALCÁZAR, José Luis, ed., Francesco BONCHI, ed., Aristides GIONIS, ed., Michèle SEBAG, ed.. Machine Learning and Knowledge Discovery in Databases. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 587-590. Lecture Notes in Computer Science. 6323. ISBN 978-3-642-15938-1. Available under: doi: 10.1007/978-3-642-15939-8_39

Zusammenfassung

We present a tool for interactive exploration of graphs that integrates advanced graph mining methods in an interactive visualization framework. The tool enables efficient exploration and analysis of complex graph structures. For flexible integration of state-of-the-art graph mining methods, the viewer makes use of the open source data mining platform KNIME. In contrast to existing graph visualization interfaces, all parts of the interface can be dynamically changed to specific visualization requirements, including the use of node type dependent icons, methods for a marking if nodes or edges and highlighting and a fluent graph that allows for iterative growing, shrinking and abstraction of (sub)graphs.

Fachgebiet (DDC)

004 Informatik

Zitieren

ISO 690

HAUN, Stefan, Andreas NÜRNBERGER, Tobias KÖTTER, Kilian THIEL, Michael R. BERTHOLD, 2010. CET : A Tool for Creative Exploration of Graphs. In: BALCÁZAR, José Luis, ed., Francesco BONCHI, ed., Aristides GIONIS, ed., Michèle SEBAG, ed.. Machine Learning and Knowledge Discovery in Databases. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 587-590. Lecture Notes in Computer Science. 6323. ISBN 978-3-642-15938-1. Available under: doi: 10.1007/978-3-642-15939-8_39

BibTex

@inproceedings{Haun2010Creat-23693,
  year={2010},
  doi={10.1007/978-3-642-15939-8_39},
  title={CET : A Tool for Creative Exploration of Graphs},
  number={6323},
  isbn={978-3-642-15938-1},
  publisher={Springer Berlin Heidelberg},
  address={Berlin, Heidelberg},
  series={Lecture Notes in Computer Science},
  booktitle={Machine Learning and Knowledge Discovery in Databases},
  pages={587--590},
  editor={Balcázar, José Luis and Bonchi, Francesco and Gionis, Aristides and Sebag, Michèle},
  author={Haun, Stefan and Nürnberger, Andreas and Kötter, Tobias and Thiel, Kilian and Berthold, Michael R.}
}

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/23693">
    <dc:creator>Nürnberger, Andreas</dc:creator>
    <dc:contributor>Haun, Stefan</dc:contributor>
    <dc:contributor>Thiel, Kilian</dc:contributor>
    <dc:language>eng</dc:language>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-06-20T09:35:09Z</dc:date>
    <dc:contributor>Berthold, Michael R.</dc:contributor>
    <dc:creator>Kötter, Tobias</dc:creator>
    <dc:contributor>Kötter, Tobias</dc:contributor>
    <dcterms:bibliographicCitation>Machine learning and knowledge discovery in databases : European Conference, ECML PKDD 2010, Barcelona, Spain, September 20-24, 2010, Proceedings, Part III / ed. by José Luis Balcázar ... - Berlin [u.a.] : Springer, 2010. - S. 587-590. - (Lecture Notes in Computer Science ; 6323). - ISBN 978-3-642-15938-1</dcterms:bibliographicCitation>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23693/1/Haun_236936.pdf"/>
    <dc:creator>Thiel, Kilian</dc:creator>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:issued>2010</dcterms:issued>
    <dcterms:title>CET : A Tool for Creative Exploration of Graphs</dcterms:title>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23693/1/Haun_236936.pdf"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Berthold, Michael R.</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Haun, Stefan</dc:creator>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/23693"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:abstract xml:lang="eng">We present a tool for interactive exploration of graphs that integrates advanced graph mining methods in an interactive visualization framework. The tool enables efficient exploration and analysis of complex graph structures. For flexible integration of state-of-the-art graph mining methods, the viewer makes use of the open source data mining platform KNIME. In contrast to existing graph visualization interfaces, all parts of the interface can be dynamically changed to specific visualization requirements, including the use of node type dependent icons, methods for a marking if nodes or edges and highlighting and a fluent graph that allows for iterative growing, shrinking and abstraction of (sub)graphs.</dcterms:abstract>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-06-20T09:35:09Z</dcterms:available>
    <dc:contributor>Nürnberger, Andreas</dc:contributor>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja