2007 6th International Asia-Pacific Symposium on Visualization最新文献

2007 6th International Asia-Pacific Symposium on Visualization Pub Date : 2007-10-15 DOI: 10.1109/APVIS.2007.329278

W. Didimo, Francesco Giordano, G. Liotta

引用次数: 16

A comparison of vertex ordering algorithms for large graph visualization 大型图形可视化的顶点排序算法比较

2007 6th International Asia-Pacific Symposium on Visualization Pub Date : 2007-10-15 DOI: 10.1109/APVIS.2007.329289

C. Mueller, Benjamin Martin, A. Lumsdaine

{"title":"A comparison of vertex ordering algorithms for large graph visualization","authors":"C. Mueller, Benjamin Martin, A. Lumsdaine","doi":"10.1109/APVIS.2007.329289","DOIUrl":"https://doi.org/10.1109/APVIS.2007.329289","url":null,"abstract":"In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationships between data items in a dot-matrix plot format, with the axes labeled with the data items and points drawn if there is a relationship between two data items. The biggest challenge for displaying data using this representation is finding an ordering of the data items that reveals the internal structure of the data set. Poor orderings are indistinguishable from noise whereas a good ordering can reveal complex and subtle features of the data. We consider three general classes of algorithms for generating orderings: simple graph theoretic algorithms, symbolic sparse matrix reordering algorithms, and spectral decomposition algorithms. We apply each algorithm to synthetic and real world data sets and evaluate each algorithm for interpretability (i.e., does the algorithm lead to images with usable visual features?) and stability (i.e., does the algorithm consistently produce similar results?). We also provide a detailed discussion of the results for each algorithm across the different graph types and include a discussion of some strategies for using ordering algorithms for data analysis based on these results.","PeriodicalId":136557,"journal":{"name":"2007 6th International Asia-Pacific Symposium on Visualization","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114518253","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}

引用次数: 83

Integrated visualization system for monitoring security in large-scale local area network 大型局域网安全监控集成可视化系统

2007 6th International Asia-Pacific Symposium on Visualization Pub Date : 2007-10-15 DOI: 10.1109/APVIS.2007.329273

Shinichi Mukosaka, H. Koike

引用次数: 14

Labeling collinear sites 标记共线位点

2007 6th International Asia-Pacific Symposium on Visualization Pub Date : 2007-10-15 DOI: 10.1109/APVIS.2007.329274

M. Bekos, M. Kaufmann, A. Symvonis

引用次数: 6

Navigation techniques for 2.5D graph layout 2.5D图形布局的导航技术

2007 6th International Asia-Pacific Symposium on Visualization Pub Date : 2007-10-15 DOI: 10.1109/APVIS.2007.329279

A. Ahmed, Seok-Hee Hong

引用次数: 11

Visualizing social interaction in open source software projects 可视化开源软件项目中的社会互动

2007 6th International Asia-Pacific Symposium on Visualization Pub Date : 2007-10-15 DOI: 10.1109/APVIS.2007.329305

Michael Ogawa, K. Ma, C. Bird, Premkumar T. Devanbu, A. Gourley

引用次数: 35

Visualization of sanitized email logs for spam analysis 用于垃圾邮件分析的净化电子邮件日志的可视化

2007 6th International Asia-Pacific Symposium on Visualization Pub Date : 2007-10-15 DOI: 10.1109/APVIS.2007.329303

C. Muelder, K. Ma

引用次数: 5

Analysis of a high-dimensional approach to interactive graph drawing 一种高维交互式图形绘制方法的分析

2007 6th International Asia-Pacific Symposium on Visualization Pub Date : 2007-10-15 DOI: 10.1109/APVIS.2007.329281

H. Hosobe

{"title":"Analysis of a high-dimensional approach to interactive graph drawing","authors":"H. Hosobe","doi":"10.1109/APVIS.2007.329281","DOIUrl":"https://doi.org/10.1109/APVIS.2007.329281","url":null,"abstract":"Graph drawing is an information visualization technology for illustrating relations between objects. Interactive graph drawing is often important since it is difficult to statically lay out complex graphs. For the interactive drawing of general undirected graphs, we have proposed the high-dimensional approach, which uses static graph layouts in high-dimensional spaces to dynamically find two-dimensional layouts according to user interaction. Although the resulting interactive graph drawing method was found to be fast, other properties of it are not yet clear. In this paper, we analyze the high-dimensional approach to further explore its properties. Specifically, we perform the following two kinds of its analysis: (1) sensitivity analysis for investigating how the high-dimensional approach places graph nodes on the two-dimensional plane; (2) empirical analysis for examining the appropriateness of underlying graph layout methods. The results show that, as an underlying graph layout method, Kruskal and Seery's method based on Torgerson's multidimensional scaling method is more appropriate for the high-dimensional approach than other methods for computing graph layouts in high-dimensional spaces.","PeriodicalId":136557,"journal":{"name":"2007 6th International Asia-Pacific Symposium on Visualization","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128120038","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}

引用次数: 1

Interpreting large visual similarity matrices 解释大型视觉相似性矩阵

2007 6th International Asia-Pacific Symposium on Visualization Pub Date : 2007-10-15 DOI: 10.1109/APVIS.2007.329290

C. Mueller, Benjamin Martin, A. Lumsdaine

引用次数: 20

Many-to-one boundary labeling 多对一边界标记

2007 6th International Asia-Pacific Symposium on Visualization Pub Date : 2007-10-15 DOI: 10.7155/jgaa.00169

Chun-Cheng Lin, Hao-Jen Kao, H. Yen

{"title":"Many-to-one boundary labeling","authors":"Chun-Cheng Lin, Hao-Jen Kao, H. Yen","doi":"10.7155/jgaa.00169","DOIUrl":"https://doi.org/10.7155/jgaa.00169","url":null,"abstract":"In boundary labeling, each point site is uniquely connected to a label placed on the boundary of an enclosing rectangle by a leader, which may be a rectilinear or straight line segment. To our knowledge, all the results reported in the literature for boundary labeling deal with the so-called one-to-one boundary labeling, i.e., different sites are labelled differently. In certain applications of boundary labeling, however, more than one site may be required to be connected to a common label. In this case, the presence of crossings among leaders often becomes inevitable. Minimizing the total number of crossings in boundary labeling becomes a critical design issue as crossing is often regarded as the main source of confusion in visualization. In this paper, we consider the crossing minimization problem for multi-site-to-one-label boundary labeling, i.e., finding the placements of labels and leaders such that the total number of crossings among leaders is minimized. We show the crossing minimization problem to be NP-complete under certain one-side and two-side labeling schemes. Subsequently, approximation algorithms are derived for the above intractable problems. We also present an O(n2 log3 n)-time algorithm for the problem of minimizing the total leader length for multi-site-to-one-label boundary labeling, where n is the number of labels.","PeriodicalId":136557,"journal":{"name":"2007 6th International Asia-Pacific Symposium on Visualization","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125535845","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}

引用次数: 33