{"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/outlier-aware-network-embedding-for","title":"Outlier Aware Network Embedding for Attributed Networks","arxiv_id":"1811.07609","date":"2018-11-19","proceeding":null,"authors":["Sambaran Bandyopadhyay","Lokesh N","M. N. Murty"],"abstract":"Attributed network embedding has received much interest from the research\ncommunity as most of the networks come with some content in each node, which is\nalso known as node attributes. Existing attributed network approaches work well\nwhen the network is consistent in structure and attributes, and nodes behave as\nexpected. But real world networks often have anomalous nodes. Typically these\noutliers, being relatively unexplainable, affect the embeddings of other nodes\nin the network. Thus all the downstream network mining tasks fail miserably in\nthe presence of such outliers. Hence an integrated approach to detect anomalies\nand reduce their overall effect on the network embedding is required.\n  Towards this end, we propose an unsupervised outlier aware network embedding\nalgorithm (ONE) for attributed networks, which minimizes the effect of the\noutlier nodes, and hence generates robust network embeddings. We align and\njointly optimize the loss functions coming from structure and attributes of the\nnetwork. To the best of our knowledge, this is the first generic network\nembedding approach which incorporates the effect of outliers for an attributed\nnetwork without any supervision. We experimented on publicly available real\nnetworks and manually planted different types of outliers to check the\nperformance of the proposed algorithm. Results demonstrate the superiority of\nour approach to detect the network outliers compared to the state-of-the-art\napproaches. We also consider different downstream machine learning applications\non networks to show the efficiency of ONE as a generic network embedding\ntechnique. The source code is made available at\nhttps://github.com/sambaranban/ONE.","url_abs":"http://arxiv.org/abs/1811.07609v1","url_pdf":"http://arxiv.org/pdf/1811.07609v1.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":"outlier-aware-network-embedding-for","repo_url":"https://github.com/sambaranban/ONE","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"outlier-aware-network-embedding-for","repo_url":"https://github.com/Kaslanarian/SAGOD","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"outlier-aware-network-embedding-for","repo_url":"https://github.com/pygod-team/pygod","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"network-embedding","task_name":"Network Embedding"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1811.07609","atlas_url":"https://app.syntology.ai/?focus=1811.07609","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":"1811.07609"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1811.07609\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1811.07609"},"call":"get_concepts_for_paper(arxiv_id=\"1811.07609\")"}],"by_repo":[{"repo":"sambaranban/ONE","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Kaslanarian/SAGOD","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"pygod-team/pygod","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2402.11887"],"harvested_for_calls":[{"arxiv_id":"2402.11887","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2402.11887"},"call":"get_harvested_code_for_paper(arxiv_id=\"2402.11887\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"c686bb402956ba42baaaedb075d43a29fbaedac5299a8fa684cc535cde70af96","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}