Online landmark replacement for out-of-sample dimensionality reduction methods
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909353661956096 |
|---|---|
| author | Thongprayoon, Chanon Masuda, Naoki |
| author_facet | Thongprayoon, Chanon Masuda, Naoki |
| contents | A strategy to assist visualization and analysis of large and complex data sets is dimensionality reduction, with which one maps each data point into a low-dimensional manifold. However, various dimensionality reduction techniques are computationally infeasible for large data. Out-of-sample techniques aim to resolve this difficulty; they only apply the dimensionality reduction technique on a small portion of data, referred to as landmarks, and determine the embedding coordinates of the other points using landmarks as references. Out-of-sample techniques have been applied to online settings, or when data arrive as time series. However, existing online out-of-sample techniques use either all the previous data points as landmarks or the fixed set of landmarks and therefore are potentially not good at capturing the geometry of the entire data set when the time series is non-stationary. To address this problem, we propose an online landmark replacement algorithm for out-of-sample techniques using geometric graphs and the minimal dominating set on them. We mathematically analyze some properties of the proposed algorithm, particularly focusing on the case of landmark multidimensional scaling as the out-of-sample technique, and test its performance on synthetic and empirical time series data. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_12646 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Online landmark replacement for out-of-sample dimensionality reduction methods Thongprayoon, Chanon Masuda, Naoki Physics and Society A strategy to assist visualization and analysis of large and complex data sets is dimensionality reduction, with which one maps each data point into a low-dimensional manifold. However, various dimensionality reduction techniques are computationally infeasible for large data. Out-of-sample techniques aim to resolve this difficulty; they only apply the dimensionality reduction technique on a small portion of data, referred to as landmarks, and determine the embedding coordinates of the other points using landmarks as references. Out-of-sample techniques have been applied to online settings, or when data arrive as time series. However, existing online out-of-sample techniques use either all the previous data points as landmarks or the fixed set of landmarks and therefore are potentially not good at capturing the geometry of the entire data set when the time series is non-stationary. To address this problem, we propose an online landmark replacement algorithm for out-of-sample techniques using geometric graphs and the minimal dominating set on them. We mathematically analyze some properties of the proposed algorithm, particularly focusing on the case of landmark multidimensional scaling as the out-of-sample technique, and test its performance on synthetic and empirical time series data. |
| title | Online landmark replacement for out-of-sample dimensionality reduction methods |
| topic | Physics and Society |
| url | https://arxiv.org/abs/2311.12646 |