Pub Date : 2001-10-22DOI: 10.1109/INFVIS.2001.963272
P. Hanrahan
The quintessential goal of information visualization is depicting abstractions and relations for non-spatial data. A hierarchy is a particularly expressive abstraction that can be applied to a broad range of domains: the genealogical lineages of human descent, the functional decomposition of complex mechanical objects, the classification of knowledge, the evolutionary relationships between species. All of these hierarchical relationships are representable through the abstraction of a recursively defined tree. For this reason, trees occupy a place along with arrays, lists and graphs as one of the most important data structures in computer science. Considering the simple problem of how to effectively draw a tree uncovers many issues fundamental to information visualization. Different drawing styles emphasize different properties of trees, often in subtle ways. I will discuss how people think about trees, and thus what kinds of relationships a tree drawing can usefully convey. My discussion will include a review of many methods for drawing trees, including both historical examples from the sciences and techniques recently developed by researchers in information visualization.
{"title":"To draw a tree","authors":"P. Hanrahan","doi":"10.1109/INFVIS.2001.963272","DOIUrl":"https://doi.org/10.1109/INFVIS.2001.963272","url":null,"abstract":"The quintessential goal of information visualization is depicting abstractions and relations for non-spatial data. A hierarchy is a particularly expressive abstraction that can be applied to a broad range of domains: the genealogical lineages of human descent, the functional decomposition of complex mechanical objects, the classification of knowledge, the evolutionary relationships between species. All of these hierarchical relationships are representable through the abstraction of a recursively defined tree. For this reason, trees occupy a place along with arrays, lists and graphs as one of the most important data structures in computer science. Considering the simple problem of how to effectively draw a tree uncovers many issues fundamental to information visualization. Different drawing styles emphasize different properties of trees, often in subtle ways. I will discuss how people think about trees, and thus what kinds of relationships a tree drawing can usefully convey. My discussion will include a review of many methods for drawing trees, including both historical examples from the sciences and techniques recently developed by researchers in information visualization.","PeriodicalId":131263,"journal":{"name":"IEEE Symposium on Information Visualization, 2001. INFOVIS 2001.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114386989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-10-22DOI: 10.1109/INFVIS.2001.963287
S. Havre, E. Hetzler, Ken Perrine, E. Jurrus, N. Miller
This paper introduces a graphical method for visually presenting and exploring the results of multiple queries simultaneously. This method allows a user to visually compare multiple query result sets, explore various combinations among the query result sets, and identify the "best" matches for combinations of multiple independent queries. This approach might also help users explore methods for progressively improving queries by visually comparing the improvement in result sets.
{"title":"Interactive visualization of multiple query results","authors":"S. Havre, E. Hetzler, Ken Perrine, E. Jurrus, N. Miller","doi":"10.1109/INFVIS.2001.963287","DOIUrl":"https://doi.org/10.1109/INFVIS.2001.963287","url":null,"abstract":"This paper introduces a graphical method for visually presenting and exploring the results of multiple queries simultaneously. This method allows a user to visually compare multiple query result sets, explore various combinations among the query result sets, and identify the \"best\" matches for combinations of multiple independent queries. This approach might also help users explore methods for progressively improving queries by visually comparing the improvement in result sets.","PeriodicalId":131263,"journal":{"name":"IEEE Symposium on Information Visualization, 2001. INFOVIS 2001.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128660842","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-10-22DOI: 10.1109/INFVIS.2001.963275
G. Davidson, B. Wylie, K. Boyack
A clustering and ordination algorithm suitable for mining extremely large databases, including those produced by microarray expression studies, is described and analyzed for stability. Data from a yeast cell cycle experiment with 6000 genes and 18 experimental measurements per gene are used to test this algorithm under practical conditions. The process of assigning database objects to an X,Y coordinate, ordination, is shown to be stable with respect to random starting conditions, and with respect to minor perturbations in the starting similarity estimates. Careful analysis of the way clusters typically co-locate, versus the occasional large displacements under different starting conditions are shown to be useful in interpreting the data. This extra stability information is lost when only a single cluster is reported, which is currently the accepted practice. However, it is believed that the approaches presented here should become a standard part of best practices in analyzing computer clustering of large data collections.
{"title":"Cluster stability and the use of noise in interpretation of clustering","authors":"G. Davidson, B. Wylie, K. Boyack","doi":"10.1109/INFVIS.2001.963275","DOIUrl":"https://doi.org/10.1109/INFVIS.2001.963275","url":null,"abstract":"A clustering and ordination algorithm suitable for mining extremely large databases, including those produced by microarray expression studies, is described and analyzed for stability. Data from a yeast cell cycle experiment with 6000 genes and 18 experimental measurements per gene are used to test this algorithm under practical conditions. The process of assigning database objects to an X,Y coordinate, ordination, is shown to be stable with respect to random starting conditions, and with respect to minor perturbations in the starting similarity estimates. Careful analysis of the way clusters typically co-locate, versus the occasional large displacements under different starting conditions are shown to be useful in interpreting the data. This extra stability information is lost when only a single cluster is reported, which is currently the accepted practice. However, it is believed that the approaches presented here should become a standard part of best practices in analyzing computer clustering of large data collections.","PeriodicalId":131263,"journal":{"name":"IEEE Symposium on Information Visualization, 2001. INFOVIS 2001.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123362136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-10-22DOI: 10.1109/INFVIS.2001.963296
Jeffrey L. Posdamer
Over the last several years, the size and significance of problems to which visualization has been applied has increased significantly. A few problems can be thought of as Grand Challenge domains; problems of such consequence, size and complexity that their solution represents a significant validation of our technology’s value. Battlespace Visualization, BV, ingests complex, real-time, multi-source, multi-type data; must create tailorable, multipurpose presentations; and, must present a robust, intuitive, easily learned, interactive interface to life-and-death decision makers. It represents a union of technical challenges that, regardless of problem domain, makes BV a Visualization Grand Challenge. Battlespace Visualization represents a challenge of many different dimensions:
{"title":"Battlespace visualization: a grand challenge","authors":"Jeffrey L. Posdamer","doi":"10.1109/INFVIS.2001.963296","DOIUrl":"https://doi.org/10.1109/INFVIS.2001.963296","url":null,"abstract":"Over the last several years, the size and significance of problems to which visualization has been applied has increased significantly. A few problems can be thought of as Grand Challenge domains; problems of such consequence, size and complexity that their solution represents a significant validation of our technology’s value. Battlespace Visualization, BV, ingests complex, real-time, multi-source, multi-type data; must create tailorable, multipurpose presentations; and, must present a robust, intuitive, easily learned, interactive interface to life-and-death decision makers. It represents a union of technical challenges that, regardless of problem domain, makes BV a Visualization Grand Challenge. Battlespace Visualization represents a challenge of many different dimensions:","PeriodicalId":131263,"journal":{"name":"IEEE Symposium on Information Visualization, 2001. INFOVIS 2001.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129420832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-10-22DOI: 10.1109/INFVIS.2001.963294
R. Edsall, A. MacEachren, L. Pickle
An implementation of an interactive parallel coordinate plot linked with the ArcView(r) geographic information system (GIS) is presented. The integrated geographic visualization system was created for the exploratory analysis of mortality data from specific cancers as they relate, specifically spatially, to other mortality causes and to demographic and socioeconomic risk factors. The linked and interactive parallel coordinate plot was tested with and compared to a similarly interactive and linked scatterplot in usability assessments designed to assess each representation's relative effectiveness for exploration of these data sets. Evidence from these studies suggests that multivariate, spatial, and/or time series exploration is enhanced through the use of the parallel coordinate plot linked to maps.
{"title":"Case study: design and assessment of an enhanced geographic information system for exploration of multivariate health statistics","authors":"R. Edsall, A. MacEachren, L. Pickle","doi":"10.1109/INFVIS.2001.963294","DOIUrl":"https://doi.org/10.1109/INFVIS.2001.963294","url":null,"abstract":"An implementation of an interactive parallel coordinate plot linked with the ArcView(r) geographic information system (GIS) is presented. The integrated geographic visualization system was created for the exploratory analysis of mortality data from specific cancers as they relate, specifically spatially, to other mortality causes and to demographic and socioeconomic risk factors. The linked and interactive parallel coordinate plot was tested with and compared to a similarly interactive and linked scatterplot in usability assessments designed to assess each representation's relative effectiveness for exploration of these data sets. Evidence from these studies suggests that multivariate, spatial, and/or time series exploration is enhanced through the use of the parallel coordinate plot linked to maps.","PeriodicalId":131263,"journal":{"name":"IEEE Symposium on Information Visualization, 2001. INFOVIS 2001.","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121131798","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-10-22DOI: 10.1109/INFVIS.2001.963295
J. Agutter, Noah Syroid, F. Drews, D. Westenskow, Julio C. Bermudez, D. Strayer
Our multi-disciplinary group has developed a visual representation for cardiovascular physiological variables. This enhances a clinician’s ability to detect and rapidly respond to critical events. The integrated and intuitive display communicates a patient’s cardiovascular state so that it is easily and quickly understood without prior training. The display is designed to show patterns of functional relationships that aid in the detection, diagnosis, and treatment of a critical event.
{"title":"Graphic data display for cardiovascular system","authors":"J. Agutter, Noah Syroid, F. Drews, D. Westenskow, Julio C. Bermudez, D. Strayer","doi":"10.1109/INFVIS.2001.963295","DOIUrl":"https://doi.org/10.1109/INFVIS.2001.963295","url":null,"abstract":"Our multi-disciplinary group has developed a visual representation for cardiovascular physiological variables. This enhances a clinician’s ability to detect and rapidly respond to critical events. The integrated and intuitive display communicates a patient’s cardiovascular state so that it is easily and quickly understood without prior training. The display is designed to show patterns of functional relationships that aid in the detection, diagnosis, and treatment of a critical event.","PeriodicalId":131263,"journal":{"name":"IEEE Symposium on Information Visualization, 2001. INFOVIS 2001.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122382657","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-10-22DOI: 10.1109/INFVIS.2001.963289
A. Kobsa
An empirical comparison of three commercial information visualization systems on three different databases is presented. The systems use different paradigms for visualizing data. Tasks were selected to be "ecologically relevant", i.e. meaningful and interesting in the respec- tive domains. Users of one system turned out to solve problems significantly faster than users of the other two, while users of another system would supply significantly more correct answers. Reasons for these results and general observations about the studied systems are discussed.
{"title":"An empirical comparison of three commercial information visualization systems","authors":"A. Kobsa","doi":"10.1109/INFVIS.2001.963289","DOIUrl":"https://doi.org/10.1109/INFVIS.2001.963289","url":null,"abstract":"An empirical comparison of three commercial information visualization systems on three different databases is presented. The systems use different paradigms for visualizing data. Tasks were selected to be \"ecologically relevant\", i.e. meaningful and interesting in the respec- tive domains. Users of one system turned out to solve problems significantly faster than users of the other two, while users of another system would supply significantly more correct answers. Reasons for these results and general observations about the studied systems are discussed.","PeriodicalId":131263,"journal":{"name":"IEEE Symposium on Information Visualization, 2001. INFOVIS 2001.","volume":"2021 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124187529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-10-22DOI: 10.1109/INFVIS.2001.963284
Raimund Dachselt, J. Ebert
This paper proposes a new visualization and interaction technique for medium-sized trees, called Collapsible Cylindrical Trees (CCT). Child nodes are mapped on rotating cylinders, which will be dynamically displayed or hidden to achieve a useful balance of detail and context. Besides a comprehensible three-dimensional visualization of trees, the main feature of CCT is a very fast and intuitive interaction with the displayed nodes. Only a single click is needed to reach every node and perform an action on it, such as displaying a web page. The CCT browsing technique was developed for interaction with web hierarchies but is not limited to this domain. We also present sample implementations of CCT using VRML, which show the usefulness of this intuitive tree navigation technique.
{"title":"Collapsible cylindrical trees: a fast hierarchical navigation technique","authors":"Raimund Dachselt, J. Ebert","doi":"10.1109/INFVIS.2001.963284","DOIUrl":"https://doi.org/10.1109/INFVIS.2001.963284","url":null,"abstract":"This paper proposes a new visualization and interaction technique for medium-sized trees, called Collapsible Cylindrical Trees (CCT). Child nodes are mapped on rotating cylinders, which will be dynamically displayed or hidden to achieve a useful balance of detail and context. Besides a comprehensible three-dimensional visualization of trees, the main feature of CCT is a very fast and intuitive interaction with the displayed nodes. Only a single click is needed to reach every node and perform an action on it, such as displaying a web page. The CCT browsing technique was developed for interaction with web hierarchies but is not limited to this domain. We also present sample implementations of CCT using VRML, which show the usefulness of this intuitive tree navigation technique.","PeriodicalId":131263,"journal":{"name":"IEEE Symposium on Information Visualization, 2001. INFOVIS 2001.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126166157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-10-22DOI: 10.1109/INFVIS.2001.963288
D. Keim, M. Hao, J. Ladisch, M. Hsu, U. Dayal
Simple presentation graphics are intuitive and easy-to-use, but show only highly aggregated data and present only a very limited number of data values (as in the case of bar charts). In addition, these graphics may have a high degree of overlap which may occlude a significant portion of the data values (as in the case of the x-y plots). In this paper, we therefore propose a generalization of traditional bar charts and x-y-plots which allows the visualization of large amounts of data. The basic idea is to use the pixels within the bars to present the detailed information of the data records. Our so-called pixel bar charts retain the intuitiveness of traditional bar charts while allowing very large data sets to be visualized in an effective way. We show that, for an effective pixel placement, we have to solve complex optimization problems, and present an algorithm which efficiently solves the problem. Our application using real-world e-commerce data shows the wide applicability and usefulness of our new idea.
{"title":"Pixel bar charts: a new technique for visualizing large multi-attribute data sets without aggregation","authors":"D. Keim, M. Hao, J. Ladisch, M. Hsu, U. Dayal","doi":"10.1109/INFVIS.2001.963288","DOIUrl":"https://doi.org/10.1109/INFVIS.2001.963288","url":null,"abstract":"Simple presentation graphics are intuitive and easy-to-use, but show only highly aggregated data and present only a very limited number of data values (as in the case of bar charts). In addition, these graphics may have a high degree of overlap which may occlude a significant portion of the data values (as in the case of the x-y plots). In this paper, we therefore propose a generalization of traditional bar charts and x-y-plots which allows the visualization of large amounts of data. The basic idea is to use the pixels within the bars to present the detailed information of the data records. Our so-called pixel bar charts retain the intuitiveness of traditional bar charts while allowing very large data sets to be visualized in an effective way. We show that, for an effective pixel placement, we have to solve complex optimization problems, and present an algorithm which efficiently solves the problem. Our application using real-world e-commerce data shows the wide applicability and usefulness of our new idea.","PeriodicalId":131263,"journal":{"name":"IEEE Symposium on Information Visualization, 2001. INFOVIS 2001.","volume":"37 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123658856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2001-10-22DOI: 10.1109/INFVIS.2001.963280
J. Six, I. Tollis
We discuss four methodologies for the application of node grouping in graph visualization. In addition, we introduce techniques for force-directed and orthogonal drawing which use node grouping information and have been shown in experiments to perform better than previous techniques. Not only do these techniques have significantly improved performance with respect to standard aesthetic measures, but they also attain qualitative improvement.
{"title":"Effective graph visualization via node grouping","authors":"J. Six, I. Tollis","doi":"10.1109/INFVIS.2001.963280","DOIUrl":"https://doi.org/10.1109/INFVIS.2001.963280","url":null,"abstract":"We discuss four methodologies for the application of node grouping in graph visualization. In addition, we introduce techniques for force-directed and orthogonal drawing which use node grouping information and have been shown in experiments to perform better than previous techniques. Not only do these techniques have significantly improved performance with respect to standard aesthetic measures, but they also attain qualitative improvement.","PeriodicalId":131263,"journal":{"name":"IEEE Symposium on Information Visualization, 2001. INFOVIS 2001.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126303361","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：