Using visualization to support data mining of large existing databases

Lade...
Vorschaubild
Dateien
Zu diesem Dokument gibt es keine Dateien.
Datum
2005
Autor:innen
Kriegel, Hans-Peter
Herausgeber:innen
Kontakt
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
ArXiv-ID
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Sammlungen
Core Facility der Universität Konstanz
Gesperrt bis
Titel in einer weiteren Sprache
Forschungsvorhaben
Organisationseinheiten
Zeitschriftenheft
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
LEE, John P., ed., Georges G. GRINSTEIN, ed.. Database Issues for Data Visualization. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 210-229. Lecture Notes in Computer Science. 871. ISBN 978-3-540-58519-0. Available under: doi: 10.1007/BFb0021156
Zusammenfassung

In this paper. we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provide visual support not only for the query specification process. but also for evaluating query results and. thereafter, refining the query accordingly. The main idea of our system is to represent as many data items as possible by the pixels of the display device. By arranging and coloring the pixels according to the relevance for the query, the user gets a visual impression of the resulting data set and of its relevance for the query. Using an interactive query interface, the user may change the query dynamically and receives immediate feedback by the visual representation of the resulting data set. By using multiple windows for different parts of the query, the user gets visual feedback for each part of the query and, therefore, may easier understand the overall result. To support complex queries, we introduce the notion of lsquoapproximate joinsrsquo which allow the user to find data items that only approximately fulfill join conditions. We also present ideas how our technique may be extended to support the interoperation of heterogeneous databases. Finally, we discuss the performance problems that are caused by interfacing to existing database systems and present ideas to solve these problems by using data structures supporting a multidimensional search of the database.

Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
570 Biowissenschaften, Biologie
Schlagwörter
Visualizing Large Data Sets, Visualizing Multidimensional Multivariate Data, Data Mining, Visual Query Systems, Visual Relevance Feedback, Interfaces to Database Systems
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690KEIM, Daniel A., Hans-Peter KRIEGEL, 2005. Using visualization to support data mining of large existing databases. In: LEE, John P., ed., Georges G. GRINSTEIN, ed.. Database Issues for Data Visualization. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 210-229. Lecture Notes in Computer Science. 871. ISBN 978-3-540-58519-0. Available under: doi: 10.1007/BFb0021156
BibTex
@inproceedings{Keim2005-06-08Using-17323,
  year={2005},
  doi={10.1007/BFb0021156},
  title={Using visualization to support data mining of large existing databases},
  number={871},
  isbn={978-3-540-58519-0},
  publisher={Springer Berlin Heidelberg},
  address={Berlin, Heidelberg},
  series={Lecture Notes in Computer Science},
  booktitle={Database Issues for Data Visualization},
  pages={210--229},
  editor={Lee, John P. and Grinstein, Georges G.},
  author={Keim, Daniel A. and Kriegel, Hans-Peter}
}
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/17323">
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-01-31T12:25:18Z</dcterms:available>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/17323/2/Keim.pdf"/>
    <dc:rights>terms-of-use</dc:rights>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/28"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-01-31T12:25:18Z</dc:date>
    <dcterms:title>Using visualization to support data mining of large existing databases</dcterms:title>
    <dc:creator>Keim, Daniel A.</dc:creator>
    <dc:creator>Kriegel, Hans-Peter</dc:creator>
    <dcterms:issued>2005-06-08</dcterms:issued>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/28"/>
    <dcterms:abstract xml:lang="eng">In this paper. we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provide visual support not only for the query specification process. but also for evaluating query results and. thereafter, refining the query accordingly. The main idea of our system is to represent as many data items as possible by the pixels of the display device. By arranging and coloring the pixels according to the relevance for the query, the user gets a visual impression of the resulting data set and of its relevance for the query. Using an interactive query interface, the user may change the query dynamically and receives immediate feedback by the visual representation of the resulting data set. By using multiple windows for different parts of the query, the user gets visual feedback for each part of the query and, therefore, may easier understand the overall result. To support complex queries, we introduce the notion of lsquoapproximate joinsrsquo which allow the user to find data items that only approximately fulfill join conditions. We also present ideas how our technique may be extended to support the interoperation of heterogeneous databases. Finally, we discuss the performance problems that are caused by interfacing to existing database systems and present ideas to solve these problems by using data structures supporting a multidimensional search of the database.</dcterms:abstract>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/17323"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Kriegel, Hans-Peter</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/17323/2/Keim.pdf"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:contributor>Keim, Daniel A.</dc:contributor>
    <dcterms:bibliographicCitation>First publ. in: Database issues for data visualization : proceedings / IEEE Visualization '93 Workshop, San Jose, California, USA, October 26, 1993. - Berlin [u.a.] : Springer, 1994. - pp. 210-229. - ( Lecture Notes in Computer Science ; 871). - ISBN 3-540-58519-2</dcterms:bibliographicCitation>
    <dc:language>eng</dc:language>
  </rdf:Description>
</rdf:RDF>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Kontakt
URL der Originalveröffentl.
Prüfdatum der URL
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen