CET : A Tool for Creative Exploration of Graphs

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:83c5caafe5c00aa016ab4759d3d565d7

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, pp. 587-590. ISBN 978-3-642-15938-1. Available under: doi: 10.1007/978-3-642-15939-8_39

@inproceedings{Haun2010Creat-23693, title={CET : A Tool for Creative Exploration of Graphs}, year={2010}, doi={10.1007/978-3-642-15939-8_39}, number={6323}, isbn={978-3-642-15938-1}, address={Berlin, Heidelberg}, publisher={Springer 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 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/23693"> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-06-20T09:35:09Z</dcterms:available> <dc:creator>Berthold, Michael R.</dc:creator> <dc:contributor>Haun, Stefan</dc:contributor> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:rights>deposit-license</dc:rights> <dc:creator>Haun, Stefan</dc:creator> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23693/1/Haun_236936.pdf"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-06-20T09:35:09Z</dc:date> <dc:contributor>Thiel, Kilian</dc:contributor> <dc:contributor>Nürnberger, Andreas</dc:contributor> <dc:creator>Kötter, Tobias</dc:creator> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103605204-4002607-1"/> <dcterms:title>CET : A Tool for Creative Exploration of Graphs</dcterms:title> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:issued>2010</dcterms:issued> <dc:contributor>Berthold, Michael R.</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> <dc:creator>Nürnberger, Andreas</dc:creator> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/23693"/> <dc:creator>Thiel, Kilian</dc:creator> <dc:contributor>Kötter, Tobias</dc:contributor> <dc:language>eng</dc:language> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/23693/1/Haun_236936.pdf"/> <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> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Haun_236936.pdf 81

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto