.png){kind=icon}
返回
Optimizing graph layout by t-SNE perplexity estimation
.png){kind=icon}
OA
AI
DOI：10.1007/s41060-022-00348-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Perplexity is one of the key parameters of dimensionality reduction algorithm of t-distributed stochastic neighbor embedding (t-SNE). In this paper, we investigated the relationship of t-SNE perplexity and graph layout evaluation metrics including graph stress, preserved neighborhood information and visual inspection. As we found that a small perplexity is correlated with a relative higher normalized stress while preserving neighborhood information with a higher precision but less global structure information, we proposed our method to estimate appropriate perplexity either based on a modified standard t-SNE or the sklearn Barnes-Hut TSNE. Experimental results demonstrate effectiveness and ease of use of our approach when tested on a set of benchmark datasets.
Keyword:
Data visualization
Dimensionality reduction
Graph layout
Graph
network data
Perplexity
t-SNE
期刊
I
IF:
2.8
论文数:
1.1K
被引数:
1.3K
机构
引用论文
A unified inference procedure for a class of measures to assess improvement in risk prediction systems with survival data一类具有生存数据的风险预测系统评估改进措施的统一推理程序
OAAI
OAAI分享收藏A Graph Layout Framework Combining t-Distributed Neighbor Retrieval Visualizer and Energy Models.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAI分享收藏 没有更多内容
没有更多内容