{"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/identifying-and-alleviating-concept-drift-in","title":"Identifying and Alleviating Concept Drift in Streaming Tensor Decomposition","arxiv_id":"1804.09619","date":"2018-04-25","proceeding":null,"authors":["Ravdeep Pasricha","Ekta Gujral","Evangelos E. Papalexakis"],"abstract":"Tensor decompositions are used in various data mining applications from\nsocial network to medical applications and are extremely useful in discovering\nlatent structures or concepts in the data. Many real-world applications are\ndynamic in nature and so are their data. To deal with this dynamic nature of\ndata, there exist a variety of online tensor decomposition algorithms. A\ncentral assumption in all those algorithms is that the number of latent\nconcepts remains fixed throughout the entire stream. However, this need not be\nthe case. Every incoming batch in the stream may have a different number of\nlatent concepts, and the difference in latent concepts from one tensor batch to\nanother can provide insights into how our findings in a particular application\nbehave and deviate over time. In this paper, we define \"concept\" and \"concept\ndrift\" in the context of streaming tensor decomposition, as the manifestation\nof the variability of latent concepts throughout the stream. Furthermore, we\nintroduce SeekAndDestroy, an algorithm that detects concept drift in streaming\ntensor decomposition and is able to produce results robust to that drift. To\nthe best of our knowledge, this is the first work that investigates concept\ndrift in streaming tensor decomposition. We extensively evaluate SeekAndDestroy\non synthetic datasets, which exhibit a wide variety of realistic drift. Our\nexperiments demonstrate the effectiveness of SeekAndDestroy, both in the\ndetection of concept drift and in the alleviation of its effects, producing\nresults with similar quality to decomposing the entire tensor in one shot.\nAdditionally, in real datasets, SeekAndDestroy outperforms other streaming\nbaselines, while discovering novel useful components.","url_abs":"http://arxiv.org/abs/1804.09619v2","url_pdf":"http://arxiv.org/pdf/1804.09619v2.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":"identifying-and-alleviating-concept-drift-in","repo_url":"https://github.com/ravdeep003/conceptDrift","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"tensor-decomposition","task_name":"Tensor Decomposition"}],"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":"ravdeep003/conceptDrift","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":"0074a0769e4fb9d025127f99041d145cc302022b3fbeacc892342dd2647bc14e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}