For Authors_For Subscribers_For Librarians_For SocietiesFor Advertisers

Home | About Us | Contact Us | Site Map | FAQs

journal home
 
Services for Readers
Services for authors
Customer Services


December 2003, Volume 2, Number 4, Pages 247-257
Table of contents   Previous  Full text  Next   PDF
Original Article
A visual workspace for constructing hybrid multidimensional scaling algorithms and coordinating multiple views
Greg Ross1 and Matthew Chalmers1

1Department of Computing Science, University of Glasgow, Glasgow, U.K.

Correspondence to: Greg Ross, Department of Computing Science, University of Glasgow, Lilybank Gardens, Glasgow, G12 8QQ, UK. Tel: +44 141 330 3339; Fax: +44 141 330 4913. E-mail: gr@dcs.gla.ac.uk

Greg Ross is supported by a studentship from Nickleby HFE Ltd

Abstract

Data can be distinguished according to volume, variable types and distribution, and each of these characteristics imposes constraints upon the choice of applicable algorithms for their visualisation. This has led to an abundance of often disparate algorithmic techniques. 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 paper presents a system and framework in which a user can easily explore algorithms as well as their hybrid conjunctions and the data flowing through them. Visual programming and a novel algorithmic architecture let the user semi-automatically define data-flows and the coordination of multiple views of algorithmic and visualisation components. We propose that our approach has two main benefits: significant improvements in run times of MDS algorithms can be achieved, and intermediate views of the data and the visualisation program structure can provide greater insight and control over the visualisation process.

Information Visualization (2003) 2, 247-257. doi:10.1057/palgrave.ivs.9500056

Keywords

data-flow; visual programming; multidimensional scaling; multiple views

Received 1 August 2003; revised 12 September 2003; accepted 18 September 2003
Table of contents   Previous  Full text  Next   PDF