按年被提到
20162016 · 1 次2026
系统、数据库与网络›表格、数据草图与数据集·arXiv:1602.00370 · cs.LG

Visualizing Large-scale and High-dimensional Data

Jian Tang, Jingzhou Liu, Ming Zhang, Qiaozhu Mei · 2016
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2016-05-08 · 最近 2018-02-11
2不同的人
2活跃月份
2讨论串
393被引(OpenAlex)
arXiv 摘要(候选层不写导读)

We study the problem of visualizing large-scale and high-dimensional data in a low-dimensional (typically 2D or 3D) space. Much success has been reported recently by techniques that first compute a similarity structure of the data points and then project them into a low-dimensional space with the structure preserved. These two steps suffer from considerable computational costs, preventing the state-of-the-art methods such as the t-SNE from scaling to large-scale and high-dimensional data (e.g., millions of data points and hundreds of dimensions). We propose the LargeVis, a technique that first constructs an accurately approximated K-nearest neighbor graph from the data and then layouts the graph in the low-dimensional space. Comparing to t-SNE, LargeVis significantly reduces the computational cost of the graph construction step and employs a principled probabilistic model for the visualization step, the objective of which can be effectively optimized through asynchronous stochastic gradient descent with a linear time complexity. The whole procedure thus easily scales to millions of high-dimensional data points. Experimental results on real-world data sets demonstrate that the LargeVis outperforms the state-of-the-art methods in both efficiency and effectiveness. The hyper-parameters of LargeVis are also much more stable over different data sets.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论agibsonccc · 2018-02

“For those interested in this space, folks might like some of the work that went in to visualizing T Distributed Stochastic Neighbor Embedding and the successor to that LargeVis which use multiple forms of KNN trees each with their own trade offs: https://arxiv.org/abs/1301.3342 (Barnes Hut) https://arxiv.org/abs/1602.00370 (LargeVis) One uses Vantage P…”

Using k-d trees to efficiently calculate nearest neighbors in 3D vector space原评论 ↗
被提交为 story · 1 次