{"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/doubly-stochastic-neighbor-embedding-on","title":"Doubly Stochastic Neighbor Embedding on Spheres","arxiv_id":"1609.01977","date":"2016-09-07","proceeding":null,"authors":["Yao Lu","Jukka Corander","Zhirong Yang"],"abstract":"Stochastic Neighbor Embedding (SNE) methods minimize the divergence between\nthe similarity matrix of a high-dimensional data set and its counterpart from a\nlow-dimensional embedding, leading to widely applied tools for data\nvisualization. Despite their popularity, the current SNE methods experience a\ncrowding problem when the data include highly imbalanced similarities. This\nimplies that the data points with higher total similarity tend to get crowded\naround the display center. To solve this problem, we introduce a fast\nnormalization method and normalize the similarity matrix to be doubly\nstochastic such that all the data points have equal total similarities.\nFurthermore, we show empirically and theoretically that the doubly\nstochasticity constraint often leads to embeddings which are approximately\nspherical. This suggests replacing a flat space with spheres as the embedding\nspace. The spherical embedding eliminates the discrepancy between the center\nand the periphery in visualization, which efficiently resolves the crowding\nproblem. We compared the proposed method (DOSNES) with the state-of-the-art SNE\nmethod on three real-world datasets and the results clearly indicate that our\nmethod is more favorable in terms of visualization quality.","url_abs":"http://arxiv.org/abs/1609.01977v2","url_pdf":"http://arxiv.org/pdf/1609.01977v2.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":"doubly-stochastic-neighbor-embedding-on","repo_url":"https://github.com/yaolubrain/DOSNES","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"data-visualization","task_name":"Data Visualization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1609.01977","atlas_url":"https://app.syntology.ai/?focus=1609.01977","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":"1609.01977"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1609.01977\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1609.01977"},"call":"get_concepts_for_paper(arxiv_id=\"1609.01977\")"}],"by_repo":[{"repo":"yaolubrain/DOSNES","kind":"official","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":"a61574bb2d0d11610141877af1b33086a178980daddddbaa573f3c2cdfa5af32","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}