Improving hybrid MDS with pivot-based searching

Morrison, A. and Chalmers, M. (2003) Improving hybrid MDS with pivot-based searching. In: INFOVIS'03: Ninth Annual IEEE Conference on Information Visualization, Seattle, WA., USA, 19-21 Oct 2003, pp. 85-90. ISBN 0780381548

108445.pdf - Accepted Version



An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of the original model involved performing a nearest-neighbour search for every data item. The complexity of this phase has been reduced by treating all high-dimensional relationships as a set of discretised distances to a constant number of randomly selected pivot items. In improving this computational bottleneck, the complexity is reduced from O(N√N) to O(N5/4). As well as documenting this improvement, the paper describes evaluation with a data set of 108000 14-dimensional items; a considerable increase on the size of data previously tested. Results illustrate that the reduction in complexity is reflected in significantly improved run times and that no negative impact is made upon the quality of layout produced.

Item Type:Conference Proceedings
Glasgow Author(s) Enlighten ID:Chalmers, Professor Matthew and Morrison, Dr Alistair
Authors: Morrison, A., and Chalmers, M.
College/School:College of Science and Engineering > School of Computing Science
Copyright Holders:Copyright © 2003 IEEE
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher

University Staff: Request a correction | Enlighten Editors: Update this record