计算机科学
嵌入
插值(计算机图形学)
可视化
卷积(计算机科学)
计算
降维
快速傅里叶变换
算法
并行计算
人工智能
人工神经网络
运动(物理)
作者
George C. Linderman,Manas Rachh,John C. Schotland,Stefan Steinerberger,Yuval Kluger
出处
期刊:Nature Methods
[Springer Nature]
日期:2019-02-11
卷期号:16 (3): 243-245
被引量:450
标识
DOI:10.1038/s41592-018-0308-4
摘要
t-distributed Stochastic Neighborhood Embedding (t-SNE) is a method for dimensionality reduction and visualization that has become widely popular in recent years. Efficient implementations of t-SNE are available, but they scale poorly to datasets with hundreds of thousands to millions of high dimensional data-points. We present Fast Fourier Transform-accelerated Interpolation-based t-SNE (FIt-SNE), which dramatically accelerates the computation of t-SNE. The most time-consuming step of t-SNE is a convolution that we accelerate by interpolating onto an equispaced grid and subsequently using the fast Fourier transform to perform the convolution. We also optimize the computation of input similarities in high dimensions using multi-threaded approximate nearest neighbors. We further present a modification to t-SNE called "late exaggeration," which allows for easier identification of clusters in t-SNE embeddings. Finally, for datasets that cannot be loaded into the memory, we present out-of-core randomized principal component analysis (oocPCA), so that the top principal components of a dataset can be computed without ever fully loading the matrix, hence allowing for t-SNE of large datasets to be computed on resource-limited machines.
科研通智能强力驱动
Strongly Powered by AbleSci AI