Back to Search Start Over

DD-HDS: A Method for Visualization and Exploration of High-Dimensional Data

Authors :
Alain Giron
G. Fertil
Michel Verleysen
Sylvain Lespinats
Lespinats, Sylvain
Laboratoire d'Imagerie Fonctionnelle (LIF)
Université Pierre et Marie Curie - Paris 6 (UPMC)-IFR14-IFR49-Institut National de la Santé et de la Recherche Médicale (INSERM)
Statistique Appliquée et MOdélisation Stochastique (SAMOS)
Université Paris 1 Panthéon-Sorbonne (UP1)
Machine Learning Group (DICE-MLG)
Université Catholique de Louvain = Catholic University of Louvain (UCL)
Source :
IEEE Transactions on Neural Networks, IEEE Transactions on Neural Networks, Institute of Electrical and Electronics Engineers, 2007, 18 (5), pp.1265-79, IEEE Transactions on Neural Networks, 2007, 18 (5), pp.1265-79, HAL
Publication Year :
2007
Publisher :
Institute of Electrical and Electronics Engineers (IEEE), 2007.

Abstract

International audience; Mapping high-dimensional data in a low-dimensional space, for example, for visualization, is a problem of increasingly major concern in data analysis. This paper presents data-driven high-dimensional scaling (DD-HDS), a nonlinear mapping method that follows the line of multidimensional scaling (MDS) approach, based on the preservation of distances between pairs of data. It improves the performance of existing competitors with respect to the representation of high-dimensional data, in two ways. It introduces (1) a specific weighting of distances between data taking into account the concentration of measure phenomenon and (2) a symmetric handling of short distances in the original and output spaces, avoiding false neighbor representations while still allowing some necessary tears in the original distribution. More precisely, the weighting is set according to the effective distribution of distances in the data set, with the exception of a single user-defined parameter setting the tradeoff between local neighborhood preservation and global mapping. The optimization of the stress criterion designed for the mapping is realized by "force-directed placement" (FDP). The mappings of low- and high-dimensional data sets are presented as illustrations of the features and advantages of the proposed algorithm. The weighting function specific to high-dimensional data and the symmetric handling of short distances can be easily incorporated in most distance preservation-based nonlinear dimensionality reduction methods.

Details

ISSN :
10459227
Volume :
18
Database :
OpenAIRE
Journal :
IEEE Transactions on Neural Networks
Accession number :
edsair.doi.dedup.....1cbc78246ada196b2869c684e13552b6