{"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/biasedwalk-biased-sampling-for-representation","title":"BiasedWalk: Biased Sampling for Representation Learning on Graphs","arxiv_id":"1809.02482","date":"2018-09-07","proceeding":null,"authors":["Duong Nguyen","Fragkiskos D. Malliaros"],"abstract":"Network embedding algorithms are able to learn latent feature representations\nof nodes, transforming networks into lower dimensional vector representations.\nTypical key applications, which have effectively been addressed using network\nembeddings, include link prediction, multilabel classification and community\ndetection. In this paper, we propose BiasedWalk, a scalable, unsupervised\nfeature learning algorithm that is based on biased random walks to sample\ncontext information about each node in the network. Our random-walk based\nsampling can behave as Breath-First-Search (BFS) and Depth-First-Search (DFS)\nsamplings with the goal to capture homophily and role equivalence between the\nnodes in the network. We have performed a detailed experimental evaluation\ncomparing the performance of the proposed algorithm against various baseline\nmethods, on several datasets and learning tasks. The experiment results show\nthat the proposed method outperforms the baseline ones in most of the tasks and\ndatasets.","url_abs":"http://arxiv.org/abs/1809.02482v1","url_pdf":"http://arxiv.org/pdf/1809.02482v1.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":"biasedwalk-biased-sampling-for-representation","repo_url":"https://github.com/duong18/BiasedWalk","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"community-detection","task_name":"Community Detection"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"network-embedding","task_name":"Network Embedding"},{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"duong18/BiasedWalk","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":"ab3c29b77778e6c32d1806c4fb26ecfdec297d35946f5b7bbe21250ceef601e1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}