{"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/on-valid-optimal-assignment-kernels-and","title":"On Valid Optimal Assignment Kernels and Applications to Graph Classification","arxiv_id":"1606.01141","date":"2016-06-03","proceeding":"NeurIPS 2016 12","authors":["Nils M. Kriege","Pierre-Louis Giscard","Richard C. Wilson"],"abstract":"The success of kernel methods has initiated the design of novel positive\nsemidefinite functions, in particular for structured data. A leading design\nparadigm for this is the convolution kernel, which decomposes structured\nobjects into their parts and sums over all pairs of parts. Assignment kernels,\nin contrast, are obtained from an optimal bijection between parts, which can\nprovide a more valid notion of similarity. In general however, optimal\nassignments yield indefinite functions, which complicates their use in kernel\nmethods. We characterize a class of base kernels used to compare parts that\nguarantees positive semidefinite optimal assignment kernels. These base kernels\ngive rise to hierarchies from which the optimal assignment kernels are computed\nin linear time by histogram intersection. We apply these results by developing\nthe Weisfeiler-Lehman optimal assignment kernel for graphs. It provides high\nclassification accuracy on widely-used benchmark data sets improving over the\noriginal Weisfeiler-Lehman kernel.","url_abs":"http://arxiv.org/abs/1606.01141v3","url_pdf":"http://arxiv.org/pdf/1606.01141v3.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":[],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"graph-classification","task_name":"Graph Classification"},{"task_slug":null,"task_name":"valid"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/graph-classification-on-mutag","task":"Graph Classification","dataset":"MUTAG","model":"WL-OA","rank_in_archive_order":64,"of":74,"metrics":{"Accuracy":"84.5%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-nci1","task":"Graph Classification","dataset":"NCI1","model":"WL-OA","rank_in_archive_order":6,"of":69,"metrics":{"Accuracy":"86.1%"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-nci109","task":"Graph Classification","dataset":"NCI109","model":"WL-OA","rank_in_archive_order":2,"of":38,"metrics":{"Accuracy":"86.3"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-proteins","task":"Graph Classification","dataset":"PROTEINS","model":"WL-OA","rank_in_archive_order":48,"of":103,"metrics":{"Accuracy":"76.4%"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1606.01141","atlas_url":"https://app.syntology.ai/?focus=1606.01141","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":"1606.01141"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1606.01141\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1606.01141"},"call":"get_concepts_for_paper(arxiv_id=\"1606.01141\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"7131f92058a8953c7e463e36eecc5cf691f566db210332461bbb0eb84b5ad6d7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}