{"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/global-weisfeiler-lehman-graph-kernels","title":"Global Weisfeiler-Lehman Graph Kernels","arxiv_id":"1703.02379","date":"2017-03-07","proceeding":null,"authors":["Christopher Morris","Kristian Kersting","Petra Mutzel"],"abstract":"Most state-of-the-art graph kernels only take local graph properties into\naccount, i.e., the kernel is computed with regard to properties of the\nneighborhood of vertices or other small substructures. On the other hand,\nkernels that do take global graph propertiesinto account may not scale well to\nlarge graph databases. Here we propose to start exploring the space between\nlocal and global graph kernels, striking the balance between both worlds.\nSpecifically, we introduce a novel graph kernel based on the $k$-dimensional\nWeisfeiler-Lehman algorithm. Unfortunately, the $k$-dimensional\nWeisfeiler-Lehman algorithm scales exponentially in $k$. Consequently, we\ndevise a stochastic version of the kernel with provable approximation\nguarantees using conditional Rademacher averages. On bounded-degree graphs, it\ncan even be computed in constant time. We support our theoretical results with\nexperiments on several graph classification benchmarks, showing that our\nkernels often outperform the state-of-the-art in terms of classification\naccuracies.","url_abs":"http://arxiv.org/abs/1703.02379v3","url_pdf":"http://arxiv.org/pdf/1703.02379v3.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":"global-weisfeiler-lehman-graph-kernels","repo_url":"https://github.com/chrsmrrs/glocalwl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"graph-classification","task_name":"Graph Classification"}],"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":"chrsmrrs/glocalwl","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":"c61660405468e9c5613f8d1c36d9f1b7f981267cd5ce6ebfa17842f6280c9596","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}