{"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/proximity-forest-an-effective-and-scalable","title":"Proximity Forest: An effective and scalable distance-based classifier for time series","arxiv_id":"1808.10594","date":"2018-08-31","proceeding":null,"authors":["Benjamin Lucas","Ahmed Shifaz","Charlotte Pelletier","Lachlan O'Neill","Nayyar Zaidi","Bart Goethals","Francois Petitjean","Geoffrey I. Webb"],"abstract":"Research into the classification of time series has made enormous progress in\nthe last decade. The UCR time series archive has played a significant role in\nchallenging and guiding the development of new learners for time series\nclassification. The largest dataset in the UCR archive holds 10 thousand time\nseries only; which may explain why the primary research focus has been in\ncreating algorithms that have high accuracy on relatively small datasets.\n  This paper introduces Proximity Forest, an algorithm that learns accurate\nmodels from datasets with millions of time series, and classifies a time series\nin milliseconds. The models are ensembles of highly randomized Proximity Trees.\nWhereas conventional decision trees branch on attribute values (and usually\nperform poorly on time series), Proximity Trees branch on the proximity of time\nseries to one exemplar time series or another; allowing us to leverage the\ndecades of work into developing relevant measures for time series. Proximity\nForest gains both efficiency and accuracy by stochastic selection of both\nexemplars and similarity measures.\n  Our work is motivated by recent time series applications that provide orders\nof magnitude more time series than the UCR benchmarks. Our experiments\ndemonstrate that Proximity Forest is highly competitive on the UCR archive: it\nranks among the most accurate classifiers while being significantly faster. We\ndemonstrate on a 1M time series Earth observation dataset that Proximity Forest\nretains this accuracy on datasets that are many orders of magnitude greater\nthan those in the UCR repository, while learning its models at least 100,000\ntimes faster than current state of the art models Elastic Ensemble and COTE.","url_abs":"http://arxiv.org/abs/1808.10594v2","url_pdf":"http://arxiv.org/pdf/1808.10594v2.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":"proximity-forest-an-effective-and-scalable","repo_url":"https://github.com/fpetitjean/ProximityForest","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"proximity-forest-an-effective-and-scalable","repo_url":"https://github.com/MonashTS/tempo","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"BSD-3-Clause"}},{"paper_slug":"proximity-forest-an-effective-and-scalable","repo_url":"https://github.com/NikoKVCS/proximity_forest","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"proximity-forest-an-effective-and-scalable","repo_url":"https://github.com/dotnet54/multivariate-measures","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-2.0"}},{"paper_slug":"proximity-forest-an-effective-and-scalable","repo_url":"https://github.com/moradisten/PForests","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"proximity-forest-an-effective-and-scalable","repo_url":"https://github.com/moradisten/ProximityForests-python","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"attribute","task_name":"Attribute"},{"task_slug":"earth-observation","task_name":"Earth Observation"},{"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"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1808.10594","atlas_url":"https://app.syntology.ai/?focus=1808.10594","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":"1808.10594"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1808.10594\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1808.10594"},"call":"get_concepts_for_paper(arxiv_id=\"1808.10594\")"}],"by_repo":[{"repo":"fpetitjean/ProximityForest","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MonashTS/tempo","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"NikoKVCS/proximity_forest","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"dotnet54/multivariate-measures","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"moradisten/PForests","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"moradisten/ProximityForests-python","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":"a326348b939852c85227ef5a3dfc5d5c526e2dd5e4fe1a9cfcbfc1373a9c882d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}