Publikation: Recursive Pattern : A Technique for Visualizing Very Large Amounts of Data
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
An important goal of visualization technology is to support the exploration and analysis of very large amounts of data. In this paper, we propose a new visualization technique called recursive pattern which has been developed for visualizing large amounts of multidimensional data. The technique is based on a generic recursive scheme which generalizes a wide range of pixel-oriented arrangements for displaying large data sets. By instantiating the technique with adequate data- and application-dependent parameters, the user may largely influence the structure of the resulting visualizations. Since the technique uses one pixel for presenting each data value, the amount of data which can be displayed is only limited by the resolution of current display technology and by the limitations of human perceptibility. Beside describing the basic idea of the recursive pattern technique, we provide several examples of useful parameter settings for the various recursion levels. We further show that our recursive pattern technique is particularly advantageous for the large class of data sets which have a natural order according to one dimension (e.g. time series data). We demonstrate the usefulness of our technique by using a stock market application.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
KEIM, Daniel A., Hans-Peter KRIEGEL, Mihael ANKERST, 1995. Recursive Pattern : A Technique for Visualizing Very Large Amounts of Data. Visualization '95. Atlanta, GA, USA. In: Proceedings Visualization '95. IEEE Comput. Soc. Press, 1995, pp. 279-286,. ISBN 0-8186-7187-4. Available under: doi: 10.1109/VISUAL.1995.485140BibTex
@inproceedings{Keim1995Recur-5839, year={1995}, doi={10.1109/VISUAL.1995.485140}, title={Recursive Pattern : A Technique for Visualizing Very Large Amounts of Data}, isbn={0-8186-7187-4}, publisher={IEEE Comput. Soc. Press}, booktitle={Proceedings Visualization '95}, pages={279--286,}, author={Keim, Daniel A. and Kriegel, Hans-Peter and Ankerst, Mihael} }
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/5839"> <dc:language>eng</dc:language> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:title>Recursive Pattern : A Technique for Visualizing Very Large Amounts of Data</dcterms:title> <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights> <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dc:creator>Kriegel, Hans-Peter</dc:creator> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5839/1/Recursive_Pattern.pdf"/> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5839/1/Recursive_Pattern.pdf"/> <dc:format>application/pdf</dc:format> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:32Z</dcterms:available> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:contributor>Ankerst, Mihael</dc:contributor> <dcterms:issued>1995</dcterms:issued> <dc:creator>Ankerst, Mihael</dc:creator> <dc:creator>Keim, Daniel A.</dc:creator> <dc:contributor>Kriegel, Hans-Peter</dc:contributor> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5839"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:32Z</dc:date> <dcterms:abstract xml:lang="eng">An important goal of visualization technology is to support the exploration and analysis of very large amounts of data. In this paper, we propose a new visualization technique called recursive pattern which has been developed for visualizing large amounts of multidimensional data. The technique is based on a generic recursive scheme which generalizes a wide range of pixel-oriented arrangements for displaying large data sets. By instantiating the technique with adequate data- and application-dependent parameters, the user may largely influence the structure of the resulting visualizations. Since the technique uses one pixel for presenting each data value, the amount of data which can be displayed is only limited by the resolution of current display technology and by the limitations of human perceptibility. Beside describing the basic idea of the recursive pattern technique, we provide several examples of useful parameter settings for the various recursion levels. We further show that our recursive pattern technique is particularly advantageous for the large class of data sets which have a natural order according to one dimension (e.g. time series data). We demonstrate the usefulness of our technique by using a stock market application.</dcterms:abstract> <dcterms:bibliographicCitation>First publ. in: Visualization '95: proceedings, October 29 - November 3, 1995, Atlanta, Ga. / Ed. by Greg Nielson ... Los Alamitos : IEEE Computer Soc. Pr., 1995, pp. 279-286</dcterms:bibliographicCitation> <dc:contributor>Keim, Daniel A.</dc:contributor> </rdf:Description> </rdf:RDF>