{"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/concept-drift-and-anomaly-detection-in-graph","title":"Concept Drift and Anomaly Detection in Graph Streams","arxiv_id":"1706.06941","date":"2017-06-21","proceeding":null,"authors":["Daniele Zambon","Cesare Alippi","Lorenzo Livi"],"abstract":"Graph representations offer powerful and intuitive ways to describe data in a\nmultitude of application domains. Here, we consider stochastic processes\ngenerating graphs and propose a methodology for detecting changes in\nstationarity of such processes. The methodology is general and considers a\nprocess generating attributed graphs with a variable number of vertices/edges,\nwithout the need to assume one-to-one correspondence between vertices at\ndifferent time steps. The methodology acts by embedding every graph of the\nstream into a vector domain, where a conventional multivariate change detection\nprocedure can be easily applied. We ground the soundness of our proposal by\nproving several theoretical results. In addition, we provide a specific\nimplementation of the methodology and evaluate its effectiveness on several\ndetection problems involving attributed graphs representing biological\nmolecules and drawings. Experimental results are contrasted with respect to\nsuitable baseline methods, demonstrating the effectiveness of our approach.","url_abs":"http://arxiv.org/abs/1706.06941v3","url_pdf":"http://arxiv.org/pdf/1706.06941v3.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":"concept-drift-and-anomaly-detection-in-graph","repo_url":"https://github.com/dzambon/cdg","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"anomaly-detection","task_name":"Anomaly Detection"},{"task_slug":"change-detection","task_name":"Change Detection"}],"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":"dzambon/cdg","kind":"official","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":"126d95921c721dcb279a55f4aa37e6f0ccaa70b6f31f6fbdf5f27fe1d4948feb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}