.png){kind=icon}
Return
Stochastic Multidimensional Scaling
.png){kind=icon}
OA
AI
DOI：10.1109/TSIPN.2017.2668145.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multidimensional scaling (MDS) is a popular dimensionality reduction technique that has been widely used for network visualization and cooperative localization. However, the traditional stress minimization formulation of MDS necessitates the use of batch optimization algorithms that are not scalable to large-sized problems. This paper considers an alternative stochastic stress minimization framework that is amenable to incremental and distributed solutions. A novel linear-complexity stochastic optimization algorithm is proposed that is provably convergent and simple to implement. The applicability of the proposed algorithm to localization and visualization tasks is also expounded. Extensive tests on synthetic and real datasets demonstrate the efficacy of the proposed algorithm.
Keywords:
Big data
localization
multidimensional scaling
stochastic SMACOF
visualization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.9
Papers:
734
Citations:
1.9K
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveInsurance activity and economic performance: Fresh evidence from asymmetric panel causality testsOAAI
OAAIShareSaveShareSaveShareSaveShareSave
View more