Deep Recursive Embedding for High-Dimensional Data
Zixia Zhou, Yuanyuan Wang, Boudewijn P.F. Lelieveldt, Qian Tao

TL;DR
This paper introduces Deep Recursive Embedding (DRE), a novel method combining deep neural networks with t-SNE and UMAP principles to improve high-dimensional data visualization, especially in preserving global data structure.
Contribution
The paper proposes a parametric deep embedding framework with recursive training and a two-stage loss, enhancing global structure preservation in high-dimensional data visualization.
Findings
DRE outperforms traditional methods in global structure preservation.
The recursive training strategy improves embedding quality.
Experiments on public datasets validate the effectiveness of DRE.
Abstract
t-distributed stochastic neighbor embedding (t-SNE) is a well-established visualization method for complex high-dimensional data. However, the original t-SNE method is nonparametric, stochastic, and often cannot well prevserve the global structure of data as it emphasizes local neighborhood. With t-SNE as a reference, we propose to combine the deep neural network (DNN) with the mathematical-grounded embedding rules for high-dimensional data embedding. We first introduce a deep embedding network (DEN) framework, which can learn a parametric mapping from high-dimensional space to low-dimensional embedding. DEN has a flexible architecture that can accommodate different input data (vector, image, or tensor) and loss functions. To improve the embedding performance, a recursive training strategy is proposed to make use of the latent representations extracted by DEN. Finally, we propose a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Visualization and Analytics · Advanced Clustering Algorithms Research
