{"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/distributed-and-parallel-time-series-feature","title":"Distributed and parallel time series feature extraction for industrial big data applications","arxiv_id":"1610.07717","date":"2016-10-25","proceeding":null,"authors":["Maximilian Christ","Andreas W. Kempa-Liehr","Michael Feindt"],"abstract":"The all-relevant problem of feature selection is the identification of all\nstrongly and weakly relevant attributes. This problem is especially hard to\nsolve for time series classification and regression in industrial applications\nsuch as predictive maintenance or production line optimization, for which each\nlabel or regression target is associated with several time series and\nmeta-information simultaneously. Here, we are proposing an efficient, scalable\nfeature extraction algorithm for time series, which filters the available\nfeatures in an early stage of the machine learning pipeline with respect to\ntheir significance for the classification or regression task, while controlling\nthe expected percentage of selected but irrelevant features. The proposed\nalgorithm combines established feature extraction methods with a feature\nimportance filter. It has a low computational complexity, allows to start on a\nproblem with only limited domain knowledge available, can be trivially\nparallelized, is highly scalable and based on well studied non-parametric\nhypothesis tests. We benchmark our proposed algorithm on all binary\nclassification problems of the UCR time series classification archive as well\nas time series from a production line optimization project and simulated\nstochastic processes with underlying qualitative change of dynamics.","url_abs":"http://arxiv.org/abs/1610.07717v3","url_pdf":"http://arxiv.org/pdf/1610.07717v3.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":"distributed-and-parallel-time-series-feature","repo_url":"https://github.com/blue-yonder/tsfresh","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"distributed-and-parallel-time-series-feature","repo_url":"https://github.com/Jllamoza/bbva_attrition","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"distributed-and-parallel-time-series-feature","repo_url":"https://github.com/Jllamoza/bbva_attrition_FRESH","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"binary-classification","task_name":"Binary Classification"},{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"feature-importance","task_name":"Feature Importance"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"time-series-1","task_name":"Time Series"},{"task_slug":"time-series","task_name":"Time Series Analysis"},{"task_slug":"time-series-classification","task_name":"Time Series Classification"},{"task_slug":"feature-selection","task_name":"feature selection"},{"task_slug":"regression-1","task_name":"regression"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1610.07717","atlas_url":"https://app.syntology.ai/?focus=1610.07717","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1610.07717"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1610.07717\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1610.07717"},"call":"get_concepts_for_paper(arxiv_id=\"1610.07717\")"}],"by_repo":[{"repo":"blue-yonder/tsfresh","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Jllamoza/bbva_attrition","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Jllamoza/bbva_attrition_FRESH","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":"8c3a108e0d1f33cad48c8dd63281a685779a753ce27616e3520677b330fe6cdd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}