{"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/kernel-method-for-persistence-diagrams-via","title":"Kernel method for persistence diagrams via kernel embedding and weight factor","arxiv_id":"1706.03472","date":"2017-06-12","proceeding":null,"authors":["Genki Kusano","Kenji Fukumizu","Yasuaki Hiraoka"],"abstract":"Topological data analysis is an emerging mathematical concept for\ncharacterizing shapes in multi-scale data. In this field, persistence diagrams\nare widely used as a descriptor of the input data, and can distinguish robust\nand noisy topological properties. Nowadays, it is highly desired to develop a\nstatistical framework on persistence diagrams to deal with practical data. This\npaper proposes a kernel method on persistence diagrams. A theoretical\ncontribution of our method is that the proposed kernel allows one to control\nthe effect of persistence, and, if necessary, noisy topological properties can\nbe discounted in data analysis. Furthermore, the method provides a fast\napproximation technique. The method is applied into several problems including\npractical data in physics, and the results show the advantage compared to the\nexisting kernel method on persistence diagrams.","url_abs":"http://arxiv.org/abs/1706.03472v1","url_pdf":"http://arxiv.org/pdf/1706.03472v1.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":"kernel-method-for-persistence-diagrams-via","repo_url":"https://github.com/genki-kusano/python-pwgk","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"graph-classification","task_name":"Graph Classification"},{"task_slug":"topological-data-analysis","task_name":"Topological Data Analysis"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/graph-classification-on-neuron-average","task":"Graph Classification","dataset":"NEURON-Average","model":"PWGK","rank_in_archive_order":5,"of":5,"metrics":{"Accuracy":"62.80"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-neuron-binary","task":"Graph Classification","dataset":"NEURON-BINARY","model":"PWGK","rank_in_archive_order":5,"of":5,"metrics":{"Accuracy":"80.1"},"uses_additional_data":false},{"leaderboard":"/sota/graph-classification-on-neuron-multi","task":"Graph Classification","dataset":"NEURON-MULTI","model":"PWGK","rank_in_archive_order":4,"of":5,"metrics":{"Accuracy":"45.5"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1706.03472","atlas_url":"https://app.syntology.ai/?focus=1706.03472","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":"1706.03472"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1706.03472\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1706.03472"},"call":"get_concepts_for_paper(arxiv_id=\"1706.03472\")"}],"by_repo":[{"repo":"genki-kusano/python-pwgk","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":"bd90e48b0ed67a98234ab0b7c2370525d58bf87269d04eaa5557c15b5002a358","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}