Improved data visualisation through nonlinear dissimilarity modelling

Abstract

Inherent to state-of-the-art dimension reduction algorithms is the assumption that global distances between observations are Euclidean, despite the potential for altogether non-Euclidean data manifolds. We demonstrate that a non-Euclidean manifold chart can be approximated by implementing a universal approximator over a dictionary of dissimilarity measures, building on recent developments in the field. This approach is transferable across domains such that observations can be vectors, distributions, graphs and time series for instance. Our novel dissimilarity learning method is illustrated with four standard visualisation datasets showing the benefits over the linear dissimilarity learning approach.

Publication DOI: https://doi.org/10.1016/j.patcog.2017.07.016
Divisions: College of Engineering & Physical Sciences
Additional Information: © 2017, Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/
Uncontrolled Keywords: dissimilarity,multidimensional scaling,visualisation,RBF network
Publication ISSN: 1873-5142
Last Modified: 24 Jan 2024 08:07
Date Deposited: 06 Sep 2017 10:35
PURE Output Type: Article
Published Date: 2018-01
Published Online Date: 2017-08-02
Accepted Date: 2017-07-17
Authors: Rice, Iain (ORCID Profile 0000-0003-4814-8920)

Export / Share Citation


Statistics

Additional statistics for this record