{"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/graph-learning-from-filtered-signals-graph","title":"Graph Learning from Filtered Signals: Graph System and Diffusion Kernel Identification","arxiv_id":"1803.02553","date":"2018-03-07","proceeding":null,"authors":["Hilmi E. Egilmez","Eduardo Pavez","Antonio Ortega"],"abstract":"This paper introduces a novel graph signal processing framework for building\ngraph-based models from classes of filtered signals. In our framework,\ngraph-based modeling is formulated as a graph system identification problem,\nwhere the goal is to learn a weighted graph (a graph Laplacian matrix) and a\ngraph-based filter (a function of graph Laplacian matrices). In order to solve\nthe proposed problem, an algorithm is developed to jointly identify a graph and\na graph-based filter (GBF) from multiple signal/data observations. Our\nalgorithm is valid under the assumption that GBFs are one-to-one functions. The\nproposed approach can be applied to learn diffusion (heat) kernels, which are\npopular in various fields for modeling diffusion processes. In addition, for\nspecific choices of graph-based filters, the proposed problem reduces to a\ngraph Laplacian estimation problem. Our experimental results demonstrate that\nthe proposed algorithm outperforms the current state-of-the-art methods. We\nalso implement our framework on a real climate dataset for modeling of\ntemperature signals.","url_abs":"http://arxiv.org/abs/1803.02553v1","url_pdf":"http://arxiv.org/pdf/1803.02553v1.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":"graph-learning-from-filtered-signals-graph","repo_url":"https://github.com/STAC-USC/Graph_Learning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"graph-learning","task_name":"Graph Learning"},{"task_slug":null,"task_name":"valid"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1803.02553","atlas_url":"https://app.syntology.ai/?focus=1803.02553","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":"1803.02553"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1803.02553\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1803.02553"},"call":"get_concepts_for_paper(arxiv_id=\"1803.02553\")"}],"by_repo":[{"repo":"STAC-USC/Graph_Learning","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":"d79cf9929d5356325465a3e3388bf056061b809a1e60ec599c9fb2e41df42088","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}