Fast Embedding for JOFC Using the Raw Stress Criterion-Reference-Cited by-同舟云学术

Fast Embedding for JOFC Using the Raw Stress Criterion

Published:2017-10-02 Issue:4 Volume:26 Page:786-802
ISSN:1061-8600
Container-title:Journal of Computational and Graphical Statistics
language:en
Short-container-title:Journal of Computational and Graphical Statistics

Author:

Lyzinski Vince¹,Park Youngser²,Priebe Carey E.³,Trosset Michael⁴

Affiliation:

1. Human Language Technology Center of Excellence, Johns Hopkins University, Baltimore, MD

2. Center for Imaging Sciences, Johns Hopkins University, Baltimore, MD

3. Department of Applied Mathematics and Statistics, Johns Hopkins University, Baltimore, MD

4. Department of Statistics, Indiana University, Bloomington, IN

Publisher

Informa UK Limited

Subject

Statistics, Probability and Uncertainty,Discrete Mathematics and Combinatorics,Statistics and Probability

Link

https://www.tandfonline.com/doi/pdf/10.1080/10618600.2017.1321551

Reference42 articles.

1. Fidelity-Commensurability Tradeoff in Joint Embedding of Disparate Dissimilarities

2. Analysis of individual differences in multidimensional scaling via an n-way generalization of “Eckart-Young” decomposition

3. Castle, B. (2012), “Quasi-Newton Methods for Stochastic Optimization and Proximity-Based Methods for Disparate Information Fusion,” Ph.D. dissertation, Indiana University, Department of Computer Science.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Synergistic graph fusion via encoder embedding;Information Sciences;2024-09

2. Graph matching beyond perfectly-overlapping Erdős–Rényi random graphs;Statistics and Computing;2022-02-11

3. The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics;The Annals of Statistics;2019-10-01

4. Information Recovery in Shuffled Graphs via Graph Matching;IEEE Transactions on Information Theory;2018-05