{"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/expected-similarity-estimation-for-large","title":"Expected Similarity Estimation for Large-Scale Batch and Streaming Anomaly Detection","arxiv_id":"1601.06602","date":"2016-01-25","proceeding":null,"authors":["Markus Schneider","Wolfgang Ertel","Fabio Ramos"],"abstract":"We present a novel algorithm for anomaly detection on very large datasets and\ndata streams. The method, named EXPected Similarity Estimation (EXPoSE), is\nkernel-based and able to efficiently compute the similarity between new data\npoints and the distribution of regular data. The estimator is formulated as an\ninner product with a reproducing kernel Hilbert space embedding and makes no\nassumption about the type or shape of the underlying data distribution. We show\nthat offline (batch) learning with EXPoSE can be done in linear time and online\n(incremental) learning takes constant time per instance and model update.\nFurthermore, EXPoSE can make predictions in constant time, while it requires\nonly constant memory. In addition, we propose different methodologies for\nconcept drift adaptation on evolving data streams. On several real datasets we\ndemonstrate that our approach can compete with state of the art algorithms for\nanomaly detection while being an order of magnitude faster than most other\napproaches.","url_abs":"http://arxiv.org/abs/1601.06602v3","url_pdf":"http://arxiv.org/pdf/1601.06602v3.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":"expected-similarity-estimation-for-large","repo_url":"https://github.com/numenta/NAB","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"anomaly-detection","task_name":"Anomaly Detection"},{"task_slug":"incremental-learning","task_name":"Incremental Learning"}],"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":"numenta/NAB","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1510.03336"],"harvested_for_calls":[{"arxiv_id":"1510.03336","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1510.03336"},"call":"get_harvested_code_for_paper(arxiv_id=\"1510.03336\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"a6653b12f1c21640273d1558ed5efd56b3d2562341cf19cf06422049c12d70f6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}