{"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/ned-an-inter-graph-node-metric-based-on-edit","title":"NED: An Inter-Graph Node Metric Based On Edit Distance","arxiv_id":"1602.02358","date":"2016-02-07","proceeding":null,"authors":["Haohan Zhu","Xianrui Meng","George Kollios"],"abstract":"Node similarity is a fundamental problem in graph analytics. However, node\nsimilarity between nodes in different graphs (inter-graph nodes) has not\nreceived a lot of attention yet. The inter-graph node similarity is important\nin learning a new graph based on the knowledge of an existing graph (transfer\nlearning on graphs) and has applications in biological, communication, and\nsocial networks. In this paper, we propose a novel distance function for\nmeasuring inter-graph node similarity with edit distance, called NED. In NED,\ntwo nodes are compared according to their local neighborhood structures which\nare represented as unordered k-adjacent trees, without relying on labels or\nother assumptions. Since the computation problem of tree edit distance on\nunordered trees is NP-Complete, we propose a modified tree edit distance,\ncalled TED*, for comparing neighborhood trees. TED* is a metric distance, as\nthe original tree edit distance, but more importantly, TED* is polynomially\ncomputable. As a metric distance, NED admits efficient indexing, provides\ninterpretable results, and shows to perform better than existing approaches on\na number of data analysis tasks, including graph de-anonymization. Finally, the\nefficiency and effectiveness of NED are empirically demonstrated using\nreal-world graphs.","url_abs":"http://arxiv.org/abs/1602.02358v3","url_pdf":"http://arxiv.org/pdf/1602.02358v3.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":"ned-an-inter-graph-node-metric-based-on-edit","repo_url":"https://github.com/zhuhaohan/NED","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"transfer-learning","task_name":"Transfer 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":"zhuhaohan/NED","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":"61789d555bc9e24f1dc526d42154f9064379aa09671ffa1ad33c301fdc0f873e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}