z-logo
Premium
Persistent Homology for the Evaluation of Dimensionality Reduction Schemes
Author(s) -
Rieck B.,
Leitte H.
Publication year - 2015
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/cgf.12655
Subject(s) - embedding , dimensionality reduction , computer science , persistent homology , data mining , robustness (evolution) , nonlinear dimensionality reduction , topological data analysis , curse of dimensionality , theoretical computer science , algorithm , artificial intelligence , gene , biochemistry , chemistry
High‐dimensional data sets are a prevalent occurrence in many application domains. This data is commonly visualized using dimensionality reduction (DR) methods. DR methods provide e.g. a two‐dimensional embedding of the abstract data that retains relevant high‐dimensional characteristics such as local distances between data points. Since the amount of DR algorithms from which users may choose is steadily increasing, assessing their quality becomes more and more important. We present a novel technique to quantify and compare the quality of DR algorithms that is based on persistent homology. An inherent beneficial property of persistent homology is its robustness against noise which makes it well suited for real world data. Our pipeline informs about the best DR technique for a given data set and chosen metric (e.g. preservation of local distances) and provides knowledge about the local quality of an embedding, thereby helping users understand the shortcomings of the selected DR method. The utility of our method is demonstrated using application data from multiple domains and a variety of commonly used DR methods.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here