{"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/billion-scale-network-embedding-with","title":"Billion-scale Network Embedding with Iterative Random Projection","arxiv_id":"1805.02396","date":"2018-05-07","proceeding":null,"authors":["Ziwei Zhang","Peng Cui","Haoyang Li","Xiao Wang","Wenwu Zhu"],"abstract":"Network embedding, which learns low-dimensional vector representation for\nnodes in the network, has attracted considerable research attention recently.\nHowever, the existing methods are incapable of handling billion-scale networks,\nbecause they are computationally expensive and, at the same time, difficult to\nbe accelerated by distributed computing schemes. To address these problems, we\npropose RandNE (Iterative Random Projection Network Embedding), a novel and\nsimple billion-scale network embedding method. Specifically, we propose a\nGaussian random projection approach to map the network into a low-dimensional\nembedding space while preserving the high-order proximities between nodes. To\nreduce the time complexity, we design an iterative projection procedure to\navoid the explicit calculation of the high-order proximities. Theoretical\nanalysis shows that our method is extremely efficient, and friendly to\ndistributed computing schemes without any communication cost in the\ncalculation. We also design a dynamic updating procedure which can efficiently\nincorporate the dynamic changes of the networks without error aggregation.\nExtensive experimental results demonstrate the efficiency and efficacy of\nRandNE over state-of-the-art methods in several tasks including network\nreconstruction, link prediction and node classification on multiple datasets\nwith different scales, ranging from thousands to billions of nodes and edges.","url_abs":"http://arxiv.org/abs/1805.02396v2","url_pdf":"http://arxiv.org/pdf/1805.02396v2.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":"billion-scale-network-embedding-with","repo_url":"https://github.com/ZW-ZHANG/RandNE","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"billion-scale-network-embedding-with","repo_url":"https://github.com/benedekrozemberczki/karateclub","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[{"task_slug":"distributed-computing","task_name":"Distributed Computing"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"network-embedding","task_name":"Network Embedding"},{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1805.02396","atlas_url":"https://app.syntology.ai/?focus=1805.02396","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":"1805.02396"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1805.02396\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1805.02396"},"call":"get_concepts_for_paper(arxiv_id=\"1805.02396\")"}],"by_repo":[{"repo":"ZW-ZHANG/RandNE","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"benedekrozemberczki/karateclub","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":"5d58749f5271723d25edb1e3051d52156844ee62a280471b480d2cfd0295083a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}