%0 Conference Paper %B 2011 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC) %D 2011 %T Evaluating visual and statistical exploration of scientific literature networks %A Gove,R. %A Dunne,C. %A Shneiderman, Ben %A Klavans,J. %A Dorr, Bonnie J %K abstracting %K academic literature %K action science explorer %K automatic clustering %K citation analysis %K citation network visualization %K Communities %K Context %K custom exploration goal %K Data visualization %K Databases %K Document filtering %K document handling %K document ranking %K easy-to-understand metrics %K empirical evaluation %K Google %K Graphical user interfaces %K Information filtering %K Information Visualization %K Libraries %K literature exploration %K network statistics %K paper filtering %K paper ranking %K scientific literature network %K statistical exploration %K summarization technique %K user-defined tasks %K visual exploration %K Visualization %X Action Science Explorer (ASE) is a tool designed to support users in rapidly generating readily consumable summaries of academic literature. It uses citation network visualization, ranking and filtering papers by network statistics, and automatic clustering and summarization techniques. We describe how early formative evaluations of ASE led to a mature system evaluation, consisting of an in-depth empirical evaluation with four domain experts. The evaluation tasks were of two types: predefined tasks to test system performance in common scenarios, and user-defined tasks to test the system's usefulness for custom exploration goals. The primary contribution of this paper is a validation of the ASE design and recommendations to provide: easy-to-understand metrics for ranking and filtering documents, user control over which document sets to explore, and overviews of the document set in coordinated views along with details-on-demand of specific papers. We contribute a taxonomy of features for literature search and exploration tools and describe exploration goals identified by our participants. %B 2011 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC) %I IEEE %P 217 - 224 %8 2011/09/18/22 %@ 978-1-4577-1246-3 %G eng %R 10.1109/VLHCC.2011.6070403 %0 Conference Paper %B 2011 44th Hawaii International Conference on System Sciences (HICSS) %D 2011 %T EventGraphs: Charting Collections of Conference Connections %A Hansen,D. %A Smith,M. A %A Shneiderman, Ben %K conference connections %K Conferences %K Data visualization %K EventGraphs %K hashtag %K measurement %K Media %K message identification %K multimedia computing %K NodeXL %K Real time systems %K social media network diagrams %K social networking (online) %K Twitter %X EventGraphs are social media network diagrams of conversations related to events, such as conferences. Many conferences now communicate a common "hashtag" or keyword to identify messages related to the event. EventGraphs help make sense of the collections of connections that form when people follow, reply or mention one another and a keyword. This paper defines EventGraphs, characterizes different types, and shows how the social media network analysis add-in NodeXL supports their creation and analysis. The structural patterns to look for in EventGraphs are highlighted and design ideas for their improvement are discussed. %B 2011 44th Hawaii International Conference on System Sciences (HICSS) %I IEEE %P 1 - 10 %8 2011/01/04/7 %@ 978-1-4244-9618-1 %G eng %R 10.1109/HICSS.2011.196 %0 Conference Paper %B 2011 IEEE Conference on Visual Analytics Science and Technology (VAST) %D 2011 %T TreeVersity: Comparing tree structures by topology and node's attributes differences %A Gomez,J.A.G. %A Buck-Coleman,A. %A Plaisant, Catherine %A Shneiderman, Ben %K Computer science %K data classification %K Data visualization %K Educational institutions %K hierarchy %K Image color analysis %K LifeFlow %K node attributes differences %K Pattern classification %K structural changes %K Topology %K topology attributes differences %K traffic agencies %K tree structures comparison %K trees (mathematics) %K TreeVersity %K Vegetation %K Visualization %X It is common to classify data in hierarchies, they provide a comprehensible way of understanding big amounts of data. From budgets to organizational charts or even the stock market, trees are everywhere and people find them easy to use. However when analysts need to compare two versions of the same tree structure, or two related taxonomies, the task is not so easy. Much work has been done on this topic, but almost all of it has been restricted to either compare the trees by topology, or by the node attribute values. With this project we are proposing TreeVersity, a framework for comparing tree structures, both by structural changes and by differences in the node attributes. This paper is based on our previous work on comparing traffic agencies using LifeFlow [1, 2] and on a first prototype of TreeVersity. %B 2011 IEEE Conference on Visual Analytics Science and Technology (VAST) %I IEEE %P 275 - 276 %8 2011/10/23/28 %@ 978-1-4673-0015-5 %G eng %R 10.1109/VAST.2011.6102471 %0 Conference Paper %B Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Confernece on Social Computing (SocialCom) %D 2011 %T Visual Analysis of Temporal Trends in Social Networks Using Edge Color Coding and Metric Timelines %A Khurana,U. %A Nguyen,Viet-An %A Hsueh-Chien Cheng %A Ahn,Jae-wook %A Chen,Xi %A Shneiderman, Ben %K Color %K computer scientists %K data analysts %K data visualisation %K Data visualization %K dynamic social network %K dynamic timeslider %K edge color coding %K excel sheet %K Image coding %K image colour analysis %K Layout %K measurement %K metric timelines %K Microsoft excel %K multiple graph metrics %K Net EvViz %K network components %K network layout %K network visualization tool %K NodeXL template %K social networking (online) %K temporal trends %K Twitter %K Visualization %X We present Net EvViz, a visualization tool for analysis and exploration of a dynamic social network. There are plenty of visual social network analysis tools but few provide features for visualization of dynamically changing networks featuring the addition or deletion of nodes or edges. Our tool extends the code base of the Node XL template for Microsoft Excel, a popular network visualization tool. The key features of this work are (1) The ability of the user to specify and edit temporal annotations to the network components in an Excel sheet, (2) See the dynamics of the network with multiple graph metrics plotted over the time span of the graph, called the Timeline, and (3) Temporal exploration of the network layout using an edge coloring scheme and a dynamic Time slider. The objectives of the new features presented in this paper are to let the data analysts, computer scientists and others to observe the dynamics or evolution in a network interactively. We presented Net EvViz to five users of Node XL and received positive responses. %B Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Confernece on Social Computing (SocialCom) %I IEEE %P 549 - 554 %8 2011/10/09/11 %@ 978-1-4577-1931-8 %G eng %R 10.1109/PASSAT/SocialCom.2011.212 %0 Journal Article %J IEEE/ACM Transactions on Computational Biology and Bioinformatics %D 2011 %T Visual Exploration across Biomedical Databases %A Lieberman,M.D. %A Taheri, S. %A Guo,Huimin %A Mirrashed,F. %A Yahav,I. %A Aris,A. %A Shneiderman, Ben %K Bioinformatics %K Biomedical computing %K biomedical databases %K cross-database exploration %K Data exploration and discovery %K Data visualization %K database management systems %K Databases, Factual %K DNA %K graph theory %K Information Storage and Retrieval %K information visualization. %K Keyword search %K medical computing %K natural language processing %K Proteins %K semantic networks %K semantics %K sequences %K text mining %K User-Computer Interface %K user-defined semantics %K visual databases %X Though biomedical research often draws on knowledge from a wide variety of fields, few visualization methods for biomedical data incorporate meaningful cross-database exploration. A new approach is offered for visualizing and exploring a query-based subset of multiple heterogeneous biomedical databases. Databases are modeled as an entity-relation graph containing nodes (database records) and links (relationships between records). Users specify a keyword search string to retrieve an initial set of nodes, and then explore intra- and interdatabase links. Results are visualized with user-defined semantic substrates to take advantage of the rich set of attributes usually present in biomedical data. Comments from domain experts indicate that this visualization method is potentially advantageous for biomedical knowledge exploration. %B IEEE/ACM Transactions on Computational Biology and Bioinformatics %V 8 %P 536 - 550 %8 2011/04//March %@ 1545-5963 %G eng %N 2 %R 10.1109/TCBB.2010.1 %0 Conference Paper %B International Conference on Computational Science and Engineering, 2009. CSE '09 %D 2009 %T First Steps to Netviz Nirvana: Evaluating Social Network Analysis with NodeXL %A Bonsignore,E. M %A Dunne,C. %A Rotman,D. %A Smith,M. %A Capone,T. %A Hansen,D. L %A Shneiderman, Ben %K Computer science %K computer science education %K data visualisation %K Data visualization %K Educational institutions %K graph drawing %K graph layout algorithm %K Information services %K Information Visualization %K Internet %K Libraries %K Microsoft Excel open-source template %K MILC %K multi-dimensional in-depth long-term case studies %K Netviz Nirvana %K NodeXL %K Open source software %K Programming profession %K SNA %K social network analysis %K Social network services %K social networking (online) %K spreadsheet programs %K structural relationship %K teaching %K visual analytics %K visualization tool %K Web sites %X Social Network Analysis (SNA) has evolved as a popular, standard method for modeling meaningful, often hidden structural relationships in communities. Existing SNA tools often involve extensive pre-processing or intensive programming skills that can challenge practitioners and students alike. NodeXL, an open-source template for Microsoft Excel, integrates a library of common network metrics and graph layout algorithms within the familiar spreadsheet format, offering a potentially low-barrier-to-entry framework for teaching and learning SNA. We present the preliminary findings of 2 user studies of 21 graduate students who engaged in SNA using NodeXL. The majority of students, while information professionals, had little technical background or experience with SNA techniques. Six of the participants had more technical backgrounds and were chosen specifically for their experience with graph drawing and information visualization. Our primary objectives were (1) to evaluate NodeXL as an SNA tool for a broad base of users and (2) to explore methods for teaching SNA. Our complementary dual case-study format demonstrates the usability of NodeXL for a diverse set of users, and significantly, the power of a tightly integrated metrics/visualization tool to spark insight and facilitate sense-making for students of SNA. %B International Conference on Computational Science and Engineering, 2009. CSE '09 %I IEEE %V 4 %P 332 - 339 %8 2009/08/29/31 %@ 978-1-4244-5334-4 %G eng %R 10.1109/CSE.2009.120 %0 Journal Article %J IEEE Computer Graphics and Applications %D 2009 %T Integrating Statistics and Visualization for Exploratory Power: From Long-Term Case Studies to Design Guidelines %A Perer,A. %A Shneiderman, Ben %K case studies %K Control systems %K Data analysis %K data mining %K data visualisation %K Data visualization %K data-mining %K design guidelines %K Employment %K exploration %K Filters %K Guidelines %K Information Visualization %K insights %K laboratory-based controlled experiments %K Performance analysis %K social network analysis %K Social network services %K social networking (online) %K social networks %K SocialAction %K statistical analysis %K Statistics %K visual analytics %K visual-analytics systems %K Visualization %X Evaluating visual-analytics systems is challenging because laboratory-based controlled experiments might not effectively represent analytical tasks. One such system, Social Action, integrates statistics and visualization in an interactive exploratory tool for social network analysis. This article describes results from long-term case studies with domain experts and extends established design goals for information visualization. %B IEEE Computer Graphics and Applications %V 29 %P 39 - 51 %8 2009/06//May %@ 0272-1716 %G eng %N 3 %R 10.1109/MCG.2009.44 %0 Journal Article %J IEEE Transactions on Visualization and Computer Graphics %D 2009 %T Temporal Summaries: Supporting Temporal Categorical Searching, Aggregation and Comparison %A Wang,T. D %A Plaisant, Catherine %A Shneiderman, Ben %A Spring, Neil %A Roseman,D. %A Marchand,G. %A Mukherjee,V. %A Smith,M. %K Aggregates %K Collaborative work %K Computational Biology %K Computer Graphics %K Data analysis %K data visualisation %K Data visualization %K Databases, Factual %K Displays %K Event detection %K Filters %K Heparin %K History %K Human computer interaction %K Human-computer interaction %K HUMANS %K Information Visualization %K Interaction design %K interactive visualization technique %K Medical Records Systems, Computerized %K Pattern Recognition, Automated %K Performance analysis %K Springs %K temporal categorical data visualization %K temporal categorical searching %K temporal ordering %K temporal summaries %K Thrombocytopenia %K Time factors %X When analyzing thousands of event histories, analysts often want to see the events as an aggregate to detect insights and generate new hypotheses about the data. An analysis tool must emphasize both the prevalence and the temporal ordering of these events. Additionally, the analysis tool must also support flexible comparisons to allow analysts to gather visual evidence. In a previous work, we introduced align, rank, and filter (ARF) to accentuate temporal ordering. In this paper, we present temporal summaries, an interactive visualization technique that highlights the prevalence of event occurrences. Temporal summaries dynamically aggregate events in multiple granularities (year, month, week, day, hour, etc.) for the purpose of spotting trends over time and comparing several groups of records. They provide affordances for analysts to perform temporal range filters. We demonstrate the applicability of this approach in two extensive case studies with analysts who applied temporal summaries to search, filter, and look for patterns in electronic health records and academic records. %B IEEE Transactions on Visualization and Computer Graphics %V 15 %P 1049 - 1056 %8 2009/12//Nov %@ 1077-2626 %G eng %N 6 %R 10.1109/TVCG.2009.187 %0 Conference Paper %B International Symposium on Collaborative Technologies and Systems, 2009. CTS '09 %D 2009 %T Understanding social computing participation with visual exploration tools %A Shneiderman, Ben %K Application software %K Books %K Collaborative tools %K Computer science %K Data visualization %K Educational institutions %K History %K International collaboration %K Social network services %K Sociotechnical systems %X The rapid growth of socio-technical systems, social media and social networking websites has raised the importance of understanding the determinants of their success. The pressure to understand success is increased by the shift from playful discretionary applications to mission critical applications in government, business, and civic settings. These include homeland defense, energy sustainability, environmental conservation, disaster response, and community safety. Information visualization tools and statistical methods can both be helpful, but their utility grows when they are well-integrated. This talk will demonstrate novel tools for network evolution and offer a framework for thinking about motivating technology-mediated social participation. %B International Symposium on Collaborative Technologies and Systems, 2009. CTS '09 %I IEEE %P xi-xii - xi-xii %8 2009/05/18/22 %@ 978-1-4244-4584-4 %G eng %R 10.1109/CTS.2009.5067426 %0 Conference Paper %B Information Visualization, 2007. IV '07. 11th International Conference %D 2007 %T Similarity-Based Forecasting with Simultaneous Previews: A River Plot Interface for Time Series Forecasting %A Buono,P. %A Plaisant, Catherine %A Simeone,A. %A Aris,A. %A Shneiderman, Ben %A Shmueli,G. %A Jank,W. %K data driven forecasting method %K data visualisation %K Data visualization %K Economic forecasting %K forecasting preview interface %K Graphical user interfaces %K historical time series dataset %K Laboratories %K new stock offerings %K partial time series %K pattern matching %K pattern matching search %K Predictive models %K river plot interface %K Rivers %K similarity-based forecasting %K Smoothing methods %K Technological innovation %K Testing %K time series %K time series forecasting %K Weather forecasting %X Time-series forecasting has a large number of applications. Users with a partial time series for auctions, new stock offerings, or industrial processes desire estimates of the future behavior. We present a data driven forecasting method and interface called similarity-based forecasting (SBF). A pattern matching search in an historical time series dataset produces a subset of curves similar to the partial time series. The forecast is displayed graphically as a river plot showing statistical information about the SBF subset. A forecasting preview interface allows users to interactively explore alternative pattern matching parameters and see multiple forecasts simultaneously. User testing with 8 users demonstrated advantages and led to improvements. %B Information Visualization, 2007. IV '07. 11th International Conference %I IEEE %P 191 - 196 %8 2007/07/04/6 %@ 0-7695-2900-3 %G eng %R 10.1109/IV.2007.101 %0 Journal Article %J IEEE Transactions on Visualization and Computer Graphics %D 2006 %T Balancing Systematic and Flexible Exploration of Social Networks %A Perer,A. %A Shneiderman, Ben %K Aggregates %K algorithms %K attribute ranking %K Cluster Analysis %K Computer Graphics %K Computer simulation %K Coordinate measuring machines %K coordinated views %K Data analysis %K data visualisation %K Data visualization %K exploratory data analysis %K Filters %K Gain measurement %K graph theory %K Graphical user interfaces %K Information Storage and Retrieval %K interactive graph visualization %K matrix algebra %K matrix overview %K Models, Biological %K Navigation %K network visualization %K Pattern analysis %K Population Dynamics %K Social Behavior %K social network analysis %K Social network services %K social networks %K social sciences computing %K Social Support %K SocialAction %K software %K statistical analysis %K statistical methods %K User-Computer Interface %X Social network analysis (SNA) has emerged as a powerful method for understanding the importance of relationships in networks. However, interactive exploration of networks is currently challenging because: (1) it is difficult to find patterns and comprehend the structure of networks with many nodes and links, and (2) current systems are often a medley of statistical methods and overwhelming visual output which leaves many analysts uncertain about how to explore in an orderly manner. This results in exploration that is largely opportunistic. Our contributions are techniques to help structural analysts understand social networks more effectively. We present SocialAction, a system that uses attribute ranking and coordinated views to help users systematically examine numerous SNA measures. Users can (1) flexibly iterate through visualizations of measures to gain an overview, filter nodes, and find outliers, (2) aggregate networks using link structure, find cohesive subgroups, and focus on communities of interest, and (3) untangle networks by viewing different link types separately, or find patterns across different link types using a matrix overview. For each operation, a stable node layout is maintained in the network visualization so users can make comparisons. SocialAction offers analysts a strategy beyond opportunism, as it provides systematic, yet flexible, techniques for exploring social networks %B IEEE Transactions on Visualization and Computer Graphics %V 12 %P 693 - 700 %8 2006/10//Sept %@ 1077-2626 %G eng %N 5 %R 10.1109/TVCG.2006.122 %0 Journal Article %J IEEE Transactions on Visualization and Computer Graphics %D 2006 %T Knowledge discovery in high-dimensional data: case studies and a user survey for the rank-by-feature framework %A Seo,Jinwook %A Shneiderman, Ben %K case study %K Computer aided software engineering %K Computer Society %K Data analysis %K data mining %K data visualisation %K Data visualization %K database management systems %K e-mail user survey %K Genomics %K Helium %K Hierarchical Clustering Explorer %K hierarchical clustering explorer. %K high-dimensional data %K Histograms %K Information visualization evaluation %K interactive systems %K interactive tool %K knowledge discovery %K multivariate data %K Rank-by-feature framework %K Scattering %K Testing %K user interface %K User interfaces %K user survey %K visual analytic tools %K visual analytics %K visualization tools %X Knowledge discovery in high-dimensional data is a challenging enterprise, but new visual analytic tools appear to offer users remarkable powers if they are ready to learn new concepts and interfaces. Our three-year effort to develop versions of the hierarchical clustering explorer (HCE) began with building an interactive tool for exploring clustering results. It expanded, based on user needs, to include other potent analytic and visualization tools for multivariate data, especially the rank-by-feature framework. Our own successes using HCE provided some testimonial evidence of its utility, but we felt it necessary to get beyond our subjective impressions. This paper presents an evaluation of the hierarchical clustering explorer (HCE) using three case studies and an e-mail user survey (n=57) to focus on skill acquisition with the novel concepts and interface for the rank-by-feature framework. Knowledgeable and motivated users in diverse fields provided multiple perspectives that refined our understanding of strengths and weaknesses. A user survey confirmed the benefits of HCE, but gave less guidance about improvements. Both evaluations suggested improved training methods %B IEEE Transactions on Visualization and Computer Graphics %V 12 %P 311 - 322 %8 2006/06//May %@ 1077-2626 %G eng %N 3 %R 10.1109/TVCG.2006.50 %0 Journal Article %J IEEE Transactions on Visualization and Computer Graphics %D 2006 %T Network Visualization by Semantic Substrates %A Shneiderman, Ben %A Aris,A. %K Automatic control %K data visualisation %K Data visualization %K Displays %K Filters %K Graphical user interfaces %K Information Visualization %K information visualization designers %K Law %K legal citations %K Legal factors %K legal precedent data %K network visualization %K NVSS 1.0 %K scalability %K semantic substrate %K Terminology %K Tunneling %K user-defined semantic substrates %X Networks have remained a challenge for information visualization designers because of the complex issues of node and link layout coupled with the rich set of tasks that users present. This paper offers a strategy based on two principles: (1) layouts are based on user-defined semantic substrates, which are non-overlapping regions in which node placement is based on node attributes, (2) users interactively adjust sliders to control link visibility to limit clutter and thus ensure comprehensibility of source and destination. Scalability is further facilitated by user control of which nodes are visible. We illustrate our semantic substrates approach as implemented in NVSS 1.0 with legal precedent data for up to 1122 court cases in three regions with 7645 legal citations %B IEEE Transactions on Visualization and Computer Graphics %V 12 %P 733 - 740 %8 2006/10//Sept %@ 1077-2626 %G eng %N 5 %R 10.1109/TVCG.2006.166 %0 Conference Paper %B Visual Analytics Science And Technology, 2006 IEEE Symposium On %D 2006 %T A Visual Interface for Multivariate Temporal Data: Finding Patterns of Events across Multiple Histories %A Fails,J. A %A Karlson,A. %A Shahamat,L. %A Shneiderman, Ben %K ball-and-chain visualization %K Chromium %K Computer science %K Data analysis %K data visualisation %K Data visualization %K Database languages %K event pattern discovery %K Graphical user interfaces %K History %K Information Visualization %K Medical treatment %K multivariate temporal data %K Pattern analysis %K pattern recognition %K PatternFinder integrated interface %K Query processing %K query visualization %K result-set visualization %K Spatial databases %K tabular visualization %K temporal pattern discovery %K temporal pattern searching %K Temporal query %K user interface %K User interfaces %K visual databases %K visual interface %X Finding patterns of events over time is important in searching patient histories, Web logs, news stories, and criminal activities. This paper presents PatternFinder, an integrated interface for query and result-set visualization for search and discovery of temporal patterns within multivariate and categorical data sets. We define temporal patterns as sequences of events with inter-event time spans. PatternFinder allows users to specify the attributes of events and time spans to produce powerful pattern queries that are difficult to express with other formalisms. We characterize the range of queries PatternFinder supports as users vary the specificity at which events and time spans are defined. Pattern Finder's query capabilities together with coupled ball-and-chain and tabular visualizations enable users to effectively query, explore and analyze event patterns both within and across data entities (e.g. patient histories, terrorist groups, Web logs, etc.) %B Visual Analytics Science And Technology, 2006 IEEE Symposium On %I IEEE %P 167 - 174 %8 2006/11/31/Oct. %@ 1-4244-0591-2 %G eng %R 10.1109/VAST.2006.261421 %0 Conference Paper %B IEEE Symposium on Information Visualization, 2005. INFOVIS 2005 %D 2005 %T Turning information visualization innovations into commercial products: lessons to guide the next success %A Shneiderman, Ben %A Rao,R. %A Andrews,K. %A Ahlberg,C. %A Brodbeck,D. %A Jewitt,T. %A Mackinlay,J. %K Books %K commercial development %K commercial product %K Computer interfaces %K Computer science %K data visualisation %K Data visualization %K Educational institutions %K exploratory data analysis %K information visualization innovation %K information visualization tool %K innovation management %K Laboratories %K Management training %K new technology emergence %K Technological innovation %K technology transfer %K Turning %K User interfaces %X As information visualization matures as an academic research field, commercial spinoffs are proliferating, but success stories are harder to find. This is the normal process of emergence for new technologies, but the panel organizers believe that there are certain strategies that facilitate success. To teach these lessons, we have invited several key figures who are seeking to commercialize information visualization tools. The panelists make short presentations, engage in a moderated discussion, and respond to audience questions. %B IEEE Symposium on Information Visualization, 2005. INFOVIS 2005 %I IEEE %P 241 - 244 %8 2005/10/23/25 %@ 0-7803-9464-X %G eng %R 10.1109/INFVIS.2005.1532153 %0 Conference Paper %B 16th International Conference on Scientific and Statistical Database Management, 2004. Proceedings %D 2004 %T Exploiting multiple paths to express scientific queries %A Lacroix,Z. %A Moths,T. %A Parekh,K. %A Raschid, Louiqa %A Vidal,M. -E %K access protocols %K biology computing %K BioNavigation system %K complex queries %K Costs %K Data analysis %K data handling %K Data visualization %K data warehouse %K Data warehouses %K Databases %K diseases %K distributed databases %K hard-coded scripts %K information resources %K Information retrieval %K mediation-based data integration system %K multiple paths %K query evaluation %K Query processing %K scientific data collection %K scientific discovery %K scientific information %K scientific information systems %K scientific object of interest %K scientific queries %K sequences %K Web resources %X The purpose of this demonstration is to present the main features of the BioNavigation system. Scientific data collection needed in various stages of scientific discovery is typically performed manually. For each scientific object of interest (e.g., a gene, a sequence), scientists query a succession of Web resources following links between retrieved entries. Each of the steps provides part of the intended characterization of the scientific object. This process is sometimes partially supported by hard-coded scripts or complex queries that will be evaluated by a mediation-based data integration system or against a data warehouse. These approaches fail in guiding the scientists during the collection process. In contrast, the BioNavigation approach presented in the paper provides the scientists with information on the available alternative resources, their provenance, and the costs of data collection. The BioNavigation system enhances a mediation-based integration system and provides scientists with support for the following: to ask queries at a high conceptual level; to visualize the multiple alternative resources that may be exploited to execute their data collection queries; to choose the final execution path to evaluate their queries. %B 16th International Conference on Scientific and Statistical Database Management, 2004. Proceedings %I IEEE %P 357 - 360 %8 2004/06/21/23 %@ 0-7695-2146-0 %G eng %R 10.1109/SSDM.2004.1311231 %0 Conference Paper %B Eighth International Conference on Information Visualisation, 2004. IV 2004. Proceedings %D 2004 %T Extending the utility of treemaps with flexible hierarchy %A Chintalapani,G. %A Plaisant, Catherine %A Shneiderman, Ben %K 2D displays %K Computer displays %K Computer science %K data visualisation %K Data visualization %K Educational institutions %K flexible hierarchy %K graphical user interface %K Graphical user interfaces %K hierarchical information %K Nominations and elections %K Switches %K Tree data structures %K Tree graphs %K Treemap 4.0 %K Two dimensional displays %K usability %K visualization technique %X Treemaps are a visualization technique for presenting hierarchical information on two-dimensional displays. Prior implementations limit the visualization to pre-defined static hierarchies. Flexible hierarchy, a new capability of Treemap 4.0, enables users to define various hierarchies through dynamically selecting a series of data attributes so that they can discover patterns, clusters and outliers. This work describes the design and implementation issues of flexible hierarchy. It then reports on a usability study, which led to enhancements to the interface. %B Eighth International Conference on Information Visualisation, 2004. IV 2004. Proceedings %I IEEE %P 335 - 344 %8 2004/07/14/16 %@ 0-7695-2177-0 %G eng %R 10.1109/IV.2004.1320166 %0 Conference Paper %B IEEE Symposium on Information Visualization, 2004. INFOVIS 2004 %D 2004 %T A Rank-by-Feature Framework for Unsupervised Multidimensional Data Exploration Using Low Dimensional Projections %A Seo,J. %A Shneiderman, Ben %K axis-parallel projections %K boxplot %K color-coded lower-triangular matrix %K computational complexity %K computational geometry %K Computer displays %K Computer science %K Computer vision %K Data analysis %K data mining %K data visualisation %K Data visualization %K Displays %K dynamic query %K Educational institutions %K exploratory data analysis %K feature detection %K feature detection/selection %K Feature extraction %K feature selection %K graph theory %K graphical displays %K histogram %K Information Visualization %K interactive systems %K Laboratories %K Multidimensional systems %K Principal component analysis %K rank-by-feature prism %K scatterplot %K statistical analysis %K statistical graphics %K statistical graphs %K unsupervised multidimensional data exploration %K very large databases %X Exploratory analysis of multidimensional data sets is challenging because of the difficulty in comprehending more than three dimensions. Two fundamental statistical principles for the exploratory analysis are (1) to examine each dimension first and then find relationships among dimensions, and (2) to try graphical displays first and then find numerical summaries (D.S. Moore, (1999). We implement these principles in a novel conceptual framework called the rank-by-feature framework. In the framework, users can choose a ranking criterion interesting to them and sort 1D or 2D axis-parallel projections according to the criterion. We introduce the rank-by-feature prism that is a color-coded lower-triangular matrix that guides users to desired features. Statistical graphs (histogram, boxplot, and scatterplot) and information visualization techniques (overview, coordination, and dynamic query) are combined to help users effectively traverse 1D and 2D axis-parallel projections, and finally to help them interactively find interesting features %B IEEE Symposium on Information Visualization, 2004. INFOVIS 2004 %I IEEE %P 65 - 72 %8 2004/// %@ 0-7803-8779-3 %G eng %R 10.1109/INFVIS.2004.3 %0 Journal Article %J Computer %D 2002 %T Interactively exploring hierarchical clustering results [gene identification] %A Seo,Jinwook %A Shneiderman, Ben %K algorithmic methods %K arrays %K Bioinformatics %K biological data sets %K biology computing %K Data analysis %K data mining %K data visualisation %K Data visualization %K DNA %K Fluorescence %K gene functions %K gene identification %K gene profiles %K Genetics %K Genomics %K Hierarchical Clustering Explorer %K hierarchical systems %K interactive exploration %K interactive information visualization tool %K interactive systems %K Large screen displays %K meaningful cluster identification %K metrics %K microarray data analysis %K pattern clustering %K pattern extraction %K Process control %K Sensor arrays %K sequenced genomes %K Tiles %X To date, work in microarrays, sequenced genomes and bioinformatics has focused largely on algorithmic methods for processing and manipulating vast biological data sets. Future improvements will likely provide users with guidance in selecting the most appropriate algorithms and metrics for identifying meaningful clusters-interesting patterns in large data sets, such as groups of genes with similar profiles. Hierarchical clustering has been shown to be effective in microarray data analysis for identifying genes with similar profiles and thus possibly with similar functions. Users also need an efficient visualization tool, however, to facilitate pattern extraction from microarray data sets. The Hierarchical Clustering Explorer integrates four interactive features to provide information visualization techniques that allow users to control the processes and interact with the results. Thus, hybrid approaches that combine powerful algorithms with interactive visualization tools will join the strengths of fast processors with the detailed understanding of domain experts %B Computer %V 35 %P 80 - 86 %8 2002/07// %@ 0018-9162 %G eng %N 7 %R 10.1109/MC.2002.1016905 %0 Conference Paper %B Parallel and Distributed Processing Symposium., Proceedings International, IPDPS 2002, Abstracts and CD-ROM %D 2002 %T Scheduling multiple data visualization query workloads on a shared memory machine %A Andrade,H. %A Kurc, T. %A Sussman, Alan %A Saltz, J. %K Atomic force microscopy %K Biomedical informatics %K Computer science %K Data analysis %K data visualisation %K Data visualization %K datasets %K deductive databases %K digitized microscopy image browsing %K directed graph %K directed graphs %K dynamic query scheduling model %K Educational institutions %K high workloads %K image database %K limited resources %K multiple data visualization query workloads %K multiple query optimization %K performance %K priority queue %K Processor scheduling %K Query processing %K query ranking %K Relational databases %K scheduling %K shared memory machine %K shared memory systems %K Virtual Microscope %K visual databases %X Query scheduling plays an important role when systems are faced with limited resources and high workloads. It becomes even more relevant for servers applying multiple query optimization techniques to batches of queries, in which portions of datasets as well as intermediate results are maintained in memory to speed up query evaluation. We present a dynamic query scheduling model based on a priority queue implementation using a directed graph and a strategy for ranking queries. We examine the relative performance of several ranking strategies on a shared-memory machine using two different versions of an application, called the Virtual Microscope, for browsing digitized microscopy images %B Parallel and Distributed Processing Symposium., Proceedings International, IPDPS 2002, Abstracts and CD-ROM %I IEEE %P 11 - 18 %8 2002/// %@ 0-7695-1573-8 %G eng %R 10.1109/IPDPS.2002.1015482 %0 Conference Paper %B Fifth International Conference on Information Visualisation, 2001. Proceedings %D 2001 %T Dynamic queries and brushing on choropleth maps %A Dang,G. %A North,C. %A Shneiderman, Ben %K brushing %K business %K cartography %K choropleth maps %K color coding %K colour graphics %K complex data sets %K Computational Intelligence Society %K Computer science %K data visualisation %K Data visualization %K demographic data %K Demography %K Dynamaps %K dynamic queries %K economic data %K Educational institutions %K geographic information system %K geographic information systems %K Joining processes %K map representations %K map-based information visualization %K Query processing %K Scattering %K scatterplot view %K tabular representations %K user interface %K User interfaces %K World Wide Web %X Users who must combine demographic, economic or other data in a geographic context are often hampered by the integration of tabular and map representations. Static, paper-based solutions limit the amount of data that can be placed on a single map or table. By providing an effective user interface, we believe that researchers, journalists, teachers, and students can explore complex data sets more rapidly and effectively. This paper presents Dynamaps, a generalized map-based information visualization tool for dynamic queries and brushing on choropleth maps. Users can use color coding to show a variable on each geographic region, and then filter out areas that do not meet the desired criteria. In addition, a scatterplot view and a details-on-demand window support overviews and specific fact-finding %B Fifth International Conference on Information Visualisation, 2001. Proceedings %I IEEE %P 757 - 764 %8 2001/// %@ 0-7695-1195-3 %G eng %R 10.1109/IV.2001.942141 %0 Conference Paper %B Proceedings of the IEEE 2nd International Symposium on Bioinformatics and Bioengineering Conference, 2001 %D 2001 %T Optimized seamless integration of biomolecular data %A Eckman,B. A %A Lacroix,Z. %A Raschid, Louiqa %K analysis %K Bioinformatics %K biology computing %K cost based knowledge %K Costs %K Data analysis %K data mining %K data visualisation %K Data visualization %K Data warehouses %K decision support %K digital library %K Educational institutions %K information resources %K Internet %K low cost query evaluation plans %K Mediation %K meta data %K metadata %K molecular biophysics %K multiple local heterogeneous data sources %K multiple remote heterogeneous data sources %K optimized seamless biomolecular data integration %K scientific discovery %K scientific information systems %K semantic knowledge %K software libraries %K visual databases %K Visualization %X Today, scientific data is inevitably digitized, stored in a variety of heterogeneous formats, and is accessible over the Internet. Scientists need to access an integrated view of multiple remote or local heterogeneous data sources. They then integrate the results of complex queries and apply further analysis and visualization to support the task of scientific discovery. Building a digital library for scientific discovery requires accessing and manipulating data extracted from flat files or databases, documents retrieved from the Web, as well as data that is locally materialized in warehouses or is generated by software. We consider several tasks to provide optimized and seamless integration of biomolecular data. Challenges to be addressed include capturing and representing source capabilities; developing a methodology to acquire and represent metadata about source contents and access costs; and decision support to select sources and capabilities using cost based and semantic knowledge, and generating low cost query evaluation plans %B Proceedings of the IEEE 2nd International Symposium on Bioinformatics and Bioengineering Conference, 2001 %I IEEE %P 23 - 32 %8 2001/11/04/6 %@ 0-7695-1423-5 %G eng %R 10.1109/BIBE.2001.974408 %0 Conference Paper %B IEEE Symposium on Information Visualization, 2001. INFOVIS 2001 %D 2001 %T Ordered treemap layouts %A Shneiderman, Ben %A Wattenberg,M. %K Clustering algorithms %K Computer science %K Data visualization %K Displays %K Electronic switching systems %K Filling %K Monte Carlo methods %K Read only memory %K Testing %B IEEE Symposium on Information Visualization, 2001. INFOVIS 2001 %I IEEE %P 73 - 78 %8 2001/// %@ 0-7695-7342-5 %G eng %R 10.1109/INFVIS.2001.963283 %0 Journal Article %J IEEE Computer Graphics and Applications %D 2001 %T Visualization of large data sets with the Active Data Repository %A Kurc, T. %A Catalyurek,U. %A Chang,Chialin %A Sussman, Alan %A Saltz, J. %K active data repository %K ADR runtime system %K Algorithm design and analysis %K application-specific processing %K C++ %K data mining %K data retrieval %K data visualisation %K Data visualization %K distributed-memory parallel machines %K Indexing %K Information retrieval %K isosurface rendering %K Isosurfaces %K large data sets %K large-scale multidimensional data %K Memory management %K modular services %K out-of-core data sets %K parallel machine %K Parallel machines %K Partitioning algorithms %K ray-casting-based volume rendering %K Rendering (computer graphics) %K Runtime %K software libraries %K storage management %X We implement ray-casting-based volume rendering and isosurface rendering methods using the Active Data Repository (ADR) for visualizing out-of-core data sets. We have developed the ADR object-oriented framework to provide support for applications that employ range queries with user-defined mapping and aggregation operations on large-scale multidimensional data. ADR targets distributed-memory parallel machines with one or more disks attached to each node. It is designed as a set of modular services implemented in C++, which can be customized for application-specific processing. The ADR runtime system supports common operations such as memory management, data retrieval, and scheduling of processing across a parallel machine %B IEEE Computer Graphics and Applications %V 21 %P 24 - 33 %8 2001/08//Jul %@ 0272-1716 %G eng %N 4 %R 10.1109/38.933521 %0 Conference Paper %B IEEE Symposium on Information Visualization, 1997. Proceedings %D 1997 %T Design and evaluation of incremental data structures and algorithms for dynamic query interfaces %A Tanin,E. %A Beigel,R. %A Shneiderman, Ben %K Algorithm design and analysis %K Bars %K Computer science %K continuous real-time feedback %K Data structures %K data visualisation %K Data visualization %K database access mechanism %K Displays %K DQI algorithms %K dynamic query interfaces %K Feedback %K Graphical user interfaces %K Heuristic algorithms %K incremental data structures %K Information Visualization %K large databases %K Manipulator dynamics %K NASA %K query formulation %K query languages %K Query processing %K real-time systems %K small databases %K User interfaces %K very large databases %K visual databases %K visual languages %X A dynamic query interface (DQI) is a database access mechanism that provides continuous real-time feedback to the user during query formulation. Previous work shows that DQIs are elegant and powerful interfaces to small databases. Unfortunately, when applied to large databases, previous DQI algorithms slow to a crawl. We present a new incremental approach to DQI algorithms and display updates that work well with large databases, both in theory and in practice. %B IEEE Symposium on Information Visualization, 1997. Proceedings %I IEEE %P 81 - 86 %8 1997/10/21/21 %@ 0-8186-8189-6 %G eng %R 10.1109/INFVIS.1997.636790 %0 Conference Paper %B , IEEE Symposium on Visual Languages, 1996. Proceedings %D 1996 %T The eyes have it: a task by data type taxonomy for information visualizations %A Shneiderman, Ben %K advanced graphical user interface design %K Art %K data mining %K data type taxonomy %K data visualisation %K Data visualization %K Displays %K Eyes %K Graphical user interfaces %K Information filtering %K Information filters %K information visualizations %K multi dimensional data %K Multimedia databases %K network data %K Taxonomy %K visual databases %K visual information seeking %K visual programming %X A useful starting point for designing advanced graphical user interfaces is the visual information seeking Mantra: overview first, zoom and filter, then details on demand. But this is only a starting point in trying to understand the rich and varied set of information visualizations that have been proposed in recent years. The paper offers a task by data type taxonomy with seven data types (one, two, three dimensional data, temporal and multi dimensional data, and tree and network data) and seven tasks (overview, zoom, filter, details-on-demand, relate, history, and extracts) %B , IEEE Symposium on Visual Languages, 1996. Proceedings %I IEEE %P 336 - 343 %8 1996/09/03/6 %@ 0-8186-7508-X %G eng %R 10.1109/VL.1996.545307 %0 Conference Paper %B Scalable High-Performance Computing Conference, 1994., Proceedings of the %D 1994 %T Dynamic program instrumentation for scalable performance tools %A Hollingsworth, Jeffrey K %A Miller, B. P %A Cargille, J. %K Application software %K binary image %K compiler writing %K Computer architecture %K Computer displays %K Computerized monitoring %K Concurrent computing %K data acquisition %K data collection %K data visualisation %K Data visualization %K dynamic program instrumentation %K efficient monitoring %K executing program %K Instruments %K large-scale parallel applications %K Large-scale systems %K operating system design %K Operating systems %K parallel programming %K program analysis %K program diagnostics %K program visualization %K Programming profession %K Sampling methods %K scalable performance tools %K software tools %X Presents a new technique called `dynamic instrumentation' that provides efficient, scalable, yet detailed data collection for large-scale parallel applications. Our approach is unique because it defers inserting any instrumentation until the application is in execution. We can insert or change instrumentation at any time during execution by modifying the application's binary image. Only the instrumentation required for the currently selected analysis or visualization is inserted. As a result, our technique collects several orders of magnitude less data than traditional data collection approaches. We have implemented a prototype of our dynamic instrumentation on the CM-5, and present results for several real applications. In addition, we include recommendations to operating system designers, compiler writers, and computer architects about the features necessary to permit efficient monitoring of large-scale parallel systems %B Scalable High-Performance Computing Conference, 1994., Proceedings of the %I IEEE %P 841 - 850 %8 1994/05// %@ 0-8186-5680-8 %G eng %R 10.1109/SHPCC.1994.296728