{"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/an-information-theoretic-approach-to-8","title":"An Information-Theoretic Approach to Detecting Changes in Multi-Dimensional Data Streams","arxiv_id":null,"date":"2006-01-01","proceeding":"INFORMS 2006 1","authors":["Tamraparni Dasu","Shankar Krishnan","Suresh Venkatasubramanian","Ke Yi"],"abstract":"An important problem in processing large data streams is detecting changes in the underlying distribution that generates the data. The challenge in designing change detection schemes\r\nis making them general, scalable, and statistically sound. In this paper, we take a general,\r\ninformation-theoretic approach to the change detection problem, which works for multidimensional as well as categorical data. We use relative entropy, also called the Kullback-Leibler\r\ndistance, to measure the difference between two given distributions. The KL-distance is known\r\nto be related to the optimal error in determining whether the two distributions are the same\r\nand draws on fundamental results in hypothesis testing. The KL-distance also generalizes traditional distance measures in statistics, and has invariance properties that make it ideally suited\r\nfor comparing distributions.\r\nOur scheme is general; it is nonparametric and requires no assumptions on the underlying\r\ndistributions. It employs a statistical inference procedure based on the theory of bootstrapping,\r\nwhich allows us to determine whether our measurements are statistically significant. The scheme\r\nis also quite flexible from a practical perspective; it can be implemented using any spatial partitioning scheme that scales well with dimensionality. In addition to providing change detections,\r\nour method generalizes Kulldorff’s spatial scan statistic, allowing us to quantitatively identify\r\nspecific regions in space where large changes have occurred.\r\nWe provide a detailed experimental study that demonstrates the generality and efficiency of\r\nour approach with different kinds of multidimensional datasets, both synthetic and real.","url_abs":"https://www.researchgate.net/publication/248542520_An_Information-Theoretic_Approach_to_Detecting_Changes_in_MultiDimensional_Data_Streams","url_pdf":"https://www.cse.ust.hk/~yike/datadiff/datadiff.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":"an-information-theoretic-approach-to-8","repo_url":"https://github.com/mitre/menelaus","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"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":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"mitre/menelaus","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":"f561913ad46ac1cc23ee32dcbea0d49fa34c322acb65cae6add85611553fabd9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}