{"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/sedanspot-detecting-anomalies-in-edge-streams","title":"SEDANSPOT: Detecting Anomalies in Edge Streams","arxiv_id":null,"date":"2018-11-20","proceeding":"ICDM 2018 11","authors":["Dhivya Eswaran","Christos Faloutsos"],"abstract":"Given a stream of edges from a time-evolving\r\n(un)weighted (un)directed graph, we consider the problem of detecting anomalous edges in near real-time using sublinear memory.\r\nWe propose SEDANSPOT, a principled randomized algorithm,\r\nwhich exploits two tell-tale signs of anomalous edges: they tend\r\nto (i) occur as bursts of activity and (ii) connect parts of the graph\r\nwhich are sparsely connected. SEDANSPOT has the following desirable properties: (a) Burst resistance: It provably downsamples\r\nedges from bursty periods of network traffic, (b) Holistic scoring:\r\nIt takes into account the whole (sampled) graph while scoring\r\nthe anomalousness of an edge, giving diminishing importance to\r\nfar-away neighbors, (c) Efficiency: It supports fast updates and\r\nscoring and hence can be efficiently maintained over stream;\r\nfurther, it can detect anomalous edges in sublinear space and\r\nconstant time per edge. Through experiments on real-world data,\r\nwe demonstrate that SEDANSPOT is 3× faster and 270% more\r\naccurate (in terms of AUC) than the state-of-the-art.","url_abs":"https://www.cs.cmu.edu/~deswaran/papers/icdm18-sedanspot.pdf","url_pdf":"https://www.cs.cmu.edu/~deswaran/papers/icdm18-sedanspot.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":"sedanspot-detecting-anomalies-in-edge-streams","repo_url":"https://github.com/dhivyaeswaran/sedanspot","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"anomaly-detection-in-edge-streams","task_name":"Anomaly Detection in Edge Streams"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"dhivyaeswaran/sedanspot","kind":"named_in_paper","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":"441107da8d3d37b3e19d7de196fe7d2623921b66f0fe65c2cb045c063f981dec","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}