{"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/shape-constrained-tensor-decompositions-using","title":"Shape Constrained Tensor Decompositions using Sparse Representations in Over-Complete Libraries","arxiv_id":"1608.04674","date":"2016-08-16","proceeding":null,"authors":["Bethany Lusch","Eric C. Chi","J. Nathan Kutz"],"abstract":"We consider $N$-way data arrays and low-rank tensor factorizations where the\ntime mode is coded as a sparse linear combination of temporal elements from an\nover-complete library. Our method, Shape Constrained Tensor Decomposition\n(SCTD) is based upon the CANDECOMP/PARAFAC (CP) decomposition which produces\n$r$-rank approximations of data tensors via outer products of vectors in each\ndimension of the data. By constraining the vector in the temporal dimension to\nknown analytic forms which are selected from a large set of candidate\nfunctions, more readily interpretable decompositions are achieved and analytic\ntime dependencies discovered. The SCTD method circumvents traditional {\\em\nflattening} techniques where an $N$-way array is reshaped into a matrix in\norder to perform a singular value decomposition. A clear advantage of the SCTD\nalgorithm is its ability to extract transient and intermittent phenomena which\nis often difficult for SVD-based methods. We motivate the SCTD method using\nseveral intuitively appealing results before applying it on a number of\nhigh-dimensional, real-world data sets in order to illustrate the efficiency of\nthe algorithm in extracting interpretable spatio-temporal modes. With the rise\nof data-driven discovery methods, the decomposition proposed provides a viable\ntechnique for analyzing multitudes of data in a more comprehensible fashion.","url_abs":"http://arxiv.org/abs/1608.04674v1","url_pdf":"http://arxiv.org/pdf/1608.04674v1.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":"shape-constrained-tensor-decompositions-using","repo_url":"https://github.com/BethanyL/SCTD","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":"BethanyL/SCTD","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":"32b94f2aa8295e1f1a4003254d68485458cab1ddaeff67eb085ba5f020ed27c7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}