Global and local structure preserving GPU t-SNE methods for large-scale applications

被引:16
作者
Meyer, Bruno Henrique [1 ]
Ramirez Pozo, Aurora Trinidad [1 ]
Nunan Zola, Wagner M. [1 ]
机构
[1] Univ Fed Parana, Comp Sci Dept, Curitiba, Parana, Brazil
关键词
t-SNE; Large-scale data; GPU; Dimensionality reduction; DIMENSIONALITY;
D O I
10.1016/j.eswa.2022.116918
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Currently, the use of dimensionality reduction techniques such as t-distributed stochastic neighbor embedding (t-SNE) to visualize data has become essential in dealing with large-scale datasets. The state-of-the-art t-SNE-based techniques rely on a variety of methods to take advantage of GPU parallelism. The major contributions of this work consist of a new approach named simulated wide-warp anchor t-SNE (SWW-AtSNE) that combines the SWW-tSNE technique with the anchor t-SNE (AtSNE) approach, which has better preservation of global structures than SWW-tSNE and a faster execution time than AtSNE. The preservation of global structures was measured with a new metric called medium neighborhood preservation (MNP). We also propose and study the adaptations of the technique simulated wide-warp t-SNE (SWW-tSNE). The adaptations consist of using a preprocessing technique or changing the initialization method using principal component analysis (PCA). The proposal of SWW-AtSNE and the adaptations of SWW-tSNE also include the possibility of performing dimensionality reduction in two dimensions in addition to three dimensions. Furthermore, this research compares different t-SNE-based techniques using large-scale datasets. Two essential criteria are used in the comparisons: the preservation of global and local structures. Moreover, this paper compares seven methods through two AI applications: reinforcement learning and generative adversarial networks (GANs). The experimental results show that strategies such as the AtSNE method could improve dimensionality reduction quality, considering the preservation of global structures. However, it cannot achieve better results than other approaches, such as using principal component analysis in the initialization of t-SNE. Nevertheless, the ideas of both methods could be merged into a unique technique in future studies.
引用
收藏
页数:17
相关论文
共 27 条
[1]  
Abadi M, 2016, PROCEEDINGS OF OSDI'16: 12TH USENIX SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION, P265
[2]   A HIERARCHICAL O(N-LOG-N) FORCE-CALCULATION ALGORITHM [J].
BARNES, J ;
HUT, P .
NATURE, 1986, 324 (6096) :446-449
[3]  
Brock A, 2019, Arxiv, DOI arXiv:1809.11096
[4]  
Burtscher M., 2011, GPU computing Gems Emerald edition, P75
[5]  
Linderman GC, 2017, Arxiv, DOI arXiv:1712.09005
[6]   GPU accelerated t-distributed stochastic neighbor embedding [J].
Chan, David M. ;
Rao, Roshan ;
Huang, Forrest ;
Canny, John F. .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2019, 131 :1-13
[7]  
Chan DM, 2018, INT SYM COMP ARCHIT, P330, DOI [10.1109/SBAC-PAD.2018.00060, 10.1109/CAHPC.2018.8645912]
[8]  
Dasgupta S, 2008, ACM S THEORY COMPUT, P537
[9]   AtSNE: Efficient and Robust Visualization on GPU through Hierarchical Optimization [J].
Fu, Cong ;
Zhang, Yonghui ;
Cai, Deng ;
Ren, Xiang .
KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, :176-186
[10]  
Hinton G., 2002, ADV NEURAL INFORM PR, V15, P833, DOI DOI 10.5555/2968618.2968725