{"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/efficient-matrix-profile-computation-using","title":"Efficient Matrix Profile Computation Using Different Distance Functions","arxiv_id":"1901.05708","date":"2019-01-17","proceeding":null,"authors":["Reza Akbarinia","Bertrand Cloez"],"abstract":"Matrix profile has been recently proposed as a promising technique to the\nproblem of all-pairs-similarity search on time series. Efficient algorithms\nhave been proposed for computing it, e.g., STAMP, STOMP and SCRIMP++. All these\nalgorithms use the z-normalized Euclidean distance to measure the distance\nbetween subsequences. However, as we observed, for some datasets other\nEuclidean measurements are more useful for knowledge discovery from time\nseries. In this paper, we propose efficient algorithms for computing matrix\nprofile for a general class of Euclidean distances. We first propose a simple\nbut efficient algorithm called AAMP for computing matrix profile with the\n\"pure\" (non-normalized) Euclidean distance. Then, we extend our algorithm for\nthe p-norm distance. We also propose an algorithm, called ACAMP, that uses the\nsame principle as AAMP, but for the case of z-normalized Euclidean distance. We\nimplemented our algorithms, and evaluated their performance through\nexperimentation. The experiments show excellent performance results. For\nexample, they show that AAMP is very efficient for computing matrix profile for\nnon-normalized Euclidean distances. The results also show that the ACAMP\nalgorithm is significantly faster than SCRIMP++ (the state of the art matrix\nprofile algorithm) for the case of z-normalized Euclidean distance.","url_abs":"http://arxiv.org/abs/1901.05708v1","url_pdf":"http://arxiv.org/pdf/1901.05708v1.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":"efficient-matrix-profile-computation-using","repo_url":"https://github.com/StanislavParovoy/stumpy","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"efficient-matrix-profile-computation-using","repo_url":"https://github.com/TDAmeritrade/stumpy","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"efficient-matrix-profile-computation-using","repo_url":"https://github.com/MindSpore-scientific-2/code-10/tree/main/Profiling-Pareto-Front","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"efficient-matrix-profile-computation-using","repo_url":"https://github.com/MindSpore-scientific-2/code-8/tree/main/Profiling-Pareto-Front","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"time-series-1","task_name":"Time Series"},{"task_slug":"time-series","task_name":"Time Series Analysis"}],"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":"StanislavParovoy/stumpy","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"TDAmeritrade/stumpy","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MindSpore-scientific-2/code-10","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2412.06329"],"harvested_for_calls":[{"arxiv_id":"2412.06329","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2412.06329"},"call":"get_harvested_code_for_paper(arxiv_id=\"2412.06329\")"}]},{"repo":"MindSpore-scientific-2/code-8","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2307.16372"],"harvested_for_calls":[{"arxiv_id":"2307.16372","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2307.16372"},"call":"get_harvested_code_for_paper(arxiv_id=\"2307.16372\")"}]}],"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":"e60edccffd361f4c47a5ca1a922c50f09d3c7736c585a8890008e026f75841e3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}