A novel virtual node approach for interactive visual analytics of big datasets in parallel coordinates

被引:8
作者
Huang, Mao Lin [1 ,2 ]
Huang, Tze-Haw [2 ]
Zhang, Xuyun [2 ]
机构
[1] Tianjin Univ, Sch Comp Software, China 92 Weijin Rd, Tianjin 300072, Peoples R China
[2] Univ Technol Sydney, Sch Software, FEIT, POB 123, Broadway, NSW 2007, Australia
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2016年 / 55卷
关键词
Big data; Visual analytics; Parallel coordinates; Hierarchical clustering; Multidimensional data visualization; Data retrieval;
D O I
10.1016/j.future.2015.02.003
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Big data is a collection of large and complex datasets that commonly appear in multidimensional and multivariate data formats. It has been recognized as a big challenge in modern computing/information sciences to gain (or find out) due to its massive volume and complexity (e.g. its multivariate format). Accordingly, there is an urgent need to find new and effective techniques to deal with such huge datasets. Parallel coordinates is a well-established geometrical system for visualizing multidimensional data that has been extensively studied for decades. There is also a variety of associated interaction techniques currently used with this geometrical system. However, none of these existing techniques can achieve the functions that are covered by the Select layer of Yi's Seven-Layer Interaction Model. This is because it is theoretically impossible to find a select of data items via a mouse-click (or mouse-rollover) operation over a particular visual poly-line (a visual object) with no geometric region. In this paper, we present a novel technique that uses a set of virtual nodes to practically achieve the Select interaction which has hitherto proven to be such a challenging sphere in parallel coordinates visualization. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:510 / 523
页数:14
相关论文
共 28 条
[1]  
Ankerst M., 1996, IEEE VIS HOT TOP SES
[2]   Uncovering clusters in crowded parallel coordinates visualizations [J].
Artero, AO ;
de Oliveira, MCF ;
Levkowitz, H .
IEEE SYMPOSIUM ON INFORMATION VISUALIZATION 2004, PROCEEDINGS, 2004, :81-88
[3]  
Bellman R. E., 1957, Dynamic programming. Princeton landmarks in mathematics
[4]   EFFICIENT ALGORITHMS FOR AGGLOMERATIVE HIERARCHICAL-CLUSTERING METHODS [J].
DAY, WHE ;
EDELSBRUNNER, H .
JOURNAL OF CLASSIFICATION, 1984, 1 (01) :7-24
[5]  
Eades P., 2000, Journal of Graph Algorithms and Applications, V4, DOI 10.7155/jgaa.00029
[6]   Cluster analysis and display of genome-wide expression patterns [J].
Eisen, MB ;
Spellman, PT ;
Brown, PO ;
Botstein, D .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1998, 95 (25) :14863-14868
[7]   Data mining and KDD: Promise and challenges [J].
Fayyad, U ;
Stolorz, P .
FUTURE GENERATION COMPUTER SYSTEMS, 1997, 13 (2-3) :99-115
[8]  
FEKETE JD, 1999, C HUM FACT COMP SYST
[9]  
Green M., 1998, ERGO/GERO Human Factors Science, V8, P1
[10]  
Guo PH, 2010, IEEE PAC VIS SYMP, P97, DOI 10.1109/PACIFICVIS.2010.5429608