Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.00253 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918005724676096 |
|---|---|
| author | Li, Liting |
| author_facet | Li, Liting |
| contents | This article introduces a functional method for lower-dimensional smooth representations in terms of time-varying dissimilarities. The method incorporates dissimilarity representation in multidimensional scaling and smoothness approach of functional data analysis by using cubic B-spline basis functions. The model is designed to arrive at optimal representations with an iterative procedure such that dissimilarities evaluated by estimated representations are almost the same as original dissimilarities of objects in a low dimension which is easier for people to recognize. To solve expensive computation in optimization, we propose a computationally efficient method by taking gradient steps with respect to individual sub-functions of target functions using a Stochastic Gradient Descent algorithm. Keywords: Multidimensional Scaling, Functional Data Analysis, Statistical Modeling, Quasi-Newton Method, Stochastic Gradient Descent |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_00253 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Functional Multidimensional Scaling Li, Liting Methodology 62P99 This article introduces a functional method for lower-dimensional smooth representations in terms of time-varying dissimilarities. The method incorporates dissimilarity representation in multidimensional scaling and smoothness approach of functional data analysis by using cubic B-spline basis functions. The model is designed to arrive at optimal representations with an iterative procedure such that dissimilarities evaluated by estimated representations are almost the same as original dissimilarities of objects in a low dimension which is easier for people to recognize. To solve expensive computation in optimization, we propose a computationally efficient method by taking gradient steps with respect to individual sub-functions of target functions using a Stochastic Gradient Descent algorithm. Keywords: Multidimensional Scaling, Functional Data Analysis, Statistical Modeling, Quasi-Newton Method, Stochastic Gradient Descent |
| title | Functional Multidimensional Scaling |
| topic | Methodology 62P99 |
| url | https://arxiv.org/abs/2505.00253 |