{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/visualizing-large-scale-and-high-dimensional","title":"Visualizing Large-scale and High-dimensional Data","arxiv_id":"1602.00370","date":"2016-02-01","proceeding":null,"authors":["Jian Tang","Jingzhou Liu","Ming Zhang","Qiaozhu Mei"],"abstract":"We study the problem of visualizing large-scale and high-dimensional data in\na low-dimensional (typically 2D or 3D) space. Much success has been reported\nrecently by techniques that first compute a similarity structure of the data\npoints and then project them into a low-dimensional space with the structure\npreserved. These two steps suffer from considerable computational costs,\npreventing the state-of-the-art methods such as the t-SNE from scaling to\nlarge-scale and high-dimensional data (e.g., millions of data points and\nhundreds of dimensions). We propose the LargeVis, a technique that first\nconstructs an accurately approximated K-nearest neighbor graph from the data\nand then layouts the graph in the low-dimensional space. Comparing to t-SNE,\nLargeVis significantly reduces the computational cost of the graph construction\nstep and employs a principled probabilistic model for the visualization step,\nthe objective of which can be effectively optimized through asynchronous\nstochastic gradient descent with a linear time complexity. The whole procedure\nthus easily scales to millions of high-dimensional data points. Experimental\nresults on real-world data sets demonstrate that the LargeVis outperforms the\nstate-of-the-art methods in both efficiency and effectiveness. The\nhyper-parameters of LargeVis are also much more stable over different data\nsets.","url_abs":"http://arxiv.org/abs/1602.00370v2","url_pdf":"http://arxiv.org/pdf/1602.00370v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"visualizing-large-scale-and-high-dimensional","repo_url":"https://github.com/LiuChuang0059/Complex-Network","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"visualizing-large-scale-and-high-dimensional","repo_url":"https://github.com/elbamos/largeVis","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"visualizing-large-scale-and-high-dimensional","repo_url":"https://github.com/jlmelville/uwot","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"visualizing-large-scale-and-high-dimensional","repo_url":"https://github.com/lferry007/LargeVis","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"visualizing-large-scale-and-high-dimensional","repo_url":"https://github.com/mevers/animated_dimensionality_reduction","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"high","task_name":"Vocal Bursts Intensity Prediction"},{"task_slug":"graph-construction","task_name":"graph construction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1602.00370","atlas_url":"https://app.syntology.ai/?focus=1602.00370","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1602.00370"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1602.00370\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1602.00370"},"call":"get_concepts_for_paper(arxiv_id=\"1602.00370\")"}],"by_repo":[{"repo":"LiuChuang0059/Complex-Network","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"elbamos/largeVis","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"jlmelville/uwot","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"lferry007/LargeVis","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mevers/animated_dimensionality_reduction","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"b12cc4d1c8628691e59dc2d68a4d5481f089d9e311bb277f1bca192020221c04","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}