A virtual workspace for hybrid multidimensional scaling algorithms

In visualising multidimensional data, it is well known that different types of algorithms to process them. Data sets might be distinguished according to volume, variable types and distribution, and each of these characteristics imposes constraints upon the choice of applicable algorithms for their visualization. Previous work has shown that a hybrid algorithmic approach can be successful in addressing the impact of data volume on the feasibility of multidimensional scaling (MDS). This suggests that hybrid combinations of appropriate algorithms might also successfully address other characteristics of data. This paper presents a system and framework in which a user can easily explore hybrid algorithms and the data flowing through them. Visual programming and a novel algorithmic architecture let the user semi-automatically define data flows and the co-ordination of multiple views.

[1]  Matthew Chalmers,et al.  Fast Multidimensional Scaling Through Sampling, Springs and Interpolation , 2003, Inf. Vis..

[2]  Andreas Buja,et al.  Interactive High-Dimensional Data Visualization , 1996 .

[3]  David H. Laidlaw,et al.  The application visualization system: a computational environment for scientific visualization , 1989, IEEE Computer Graphics and Applications.

[4]  Matthew Chalmers,et al.  A linear iteration time layout algorithm for visualising high-dimensional data , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[5]  Samuel Kaski,et al.  Self organization of a massive document collection , 2000, IEEE Trans. Neural Networks Learn. Syst..

[6]  Richard A. Becker,et al.  Brushing scatterplots , 1987 .

[7]  Paul S. Bradley,et al.  Refining Initial Points for K-Means Clustering , 1998, ICML.

[8]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[9]  Matthew Chalmers,et al.  Improving hybrid MDS with pivot-based searching , 2003, IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714).

[10]  Matthew Chalmers,et al.  A hybrid layout algorithm for sub-quadratic multidimensional scaling , 2002, IEEE Symposium on Information Visualization, 2002. INFOVIS 2002..

[11]  E. Oja.  Simplified neuron model as a principal component analyzer , 1982, Journal of mathematical biology.

[12]  Graham J. Wills,et al.  High interaction graphics , 1995 .

[13]  Chris North,et al.  Snap-together visualization: can users construct and operate coordinated visualizations? , 2000, Int. J. Hum. Comput. Stud..

[14]  Samuel Kaski,et al.  Dimensionality reduction by random mapping: fast similarity computation for clustering , 1998, 1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227).

[15]  Peter Eades,et al.  A Heuristic for Graph Drawing , 1984 .

[16]  David G. Hendry,et al.  An informal information-seeking environment , 1997 .

[17]  Paul E. Haeberli,et al.  ConMan: a visual programming language for interactive graphics , 1988, SIGGRAPH.