{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T16:27:33Z","timestamp":1775665653029,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T00:00:00Z","timestamp":1549411200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T00:00:00Z","timestamp":1549411200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA2386-16-1-4036"],"award-info":[{"award-number":["FA2386-16-1-4036"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DE170100037"],"award-info":[{"award-number":["DE170100037"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP140100087"],"award-info":[{"award-number":["DP140100087"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10618-019-00617-3","type":"journal-article","created":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T11:52:59Z","timestamp":1549453979000},"page":"607-635","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":159,"title":["Proximity Forest: an effective and scalable distance-based classifier for time series"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2021-3076","authenticated-orcid":false,"given":"Benjamin","family":"Lucas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4627-8935","authenticated-orcid":false,"given":"Ahmed","family":"Shifaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4652-7778","authenticated-orcid":false,"given":"Charlotte","family":"Pelletier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lachlan","family":"O\u2019Neill","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nayyar","family":"Zaidi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9327-9554","authenticated-orcid":false,"given":"Bart","family":"Goethals","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5334-3574","authenticated-orcid":false,"given":"Fran\u00e7ois","family":"Petitjean","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9963-5169","authenticated-orcid":false,"given":"Geoffrey I.","family":"Webb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,6]]},"reference":[{"issue":"3","key":"617_CR1","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/s10618-016-0483-9","volume":"31","author":"A Bagnall","year":"2017","unstructured":"Bagnall A, Lines J, Bostrom A, Large J, Keogh E (2017) The great time series classification bake off: a review and experimental evaluation of recent algorithmic advances. Data Min Knowl Discov 31(3):606\u2013660","journal-title":"Data Min Knowl Discov"},{"issue":"9","key":"617_CR2","doi-asserted-by":"publisher","first-page":"2522","DOI":"10.1109\/TKDE.2015.2416723","volume":"27","author":"A Bagnall","year":"2015","unstructured":"Bagnall A, Lines J, Hills J, Bostrom A (2015) Time-series classification with COTE: the collective of transformation-based ensembles. IEEE Trans Knowl Data Eng 27(9):2522\u20132535","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"617_CR3","doi-asserted-by":"crossref","unstructured":"Balakrishnan S, Madigan D (2006) Decision trees for functional variables. In: IEEE international conference on data mining (ICDM-06), pp 798\u2013802","DOI":"10.1109\/ICDM.2006.49"},{"key":"617_CR4","unstructured":"Bernhardsson E (2013) Indexing with annoy. \n                    https:\/\/github.com\/spotify\/annoy\n                    \n                  . Accessed 23 March 2018"},{"issue":"1","key":"617_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Random forests. Mach Learn 45(1):5\u201332","journal-title":"Mach Learn"},{"key":"617_CR6","doi-asserted-by":"crossref","unstructured":"Chen L, Ng R (2004) On the marriage of lp-norms and edit distance. In: Proceedings of the thirtieth international conference on very large data bases, vol 30, pp 792\u2013803. VLDB Endowment","DOI":"10.1016\/B978-012088469-8.50070-X"},{"key":"617_CR7","doi-asserted-by":"crossref","unstructured":"Chen L, \u00d6zsu M T, Oria V (2005) Robust and fast similarity search for moving object trajectories. In: Proceedings of the 2005 ACM SIGMOD international conference on management of data, pp 491\u2013502. ACM","DOI":"10.1145\/1066157.1066213"},{"key":"617_CR8","unstructured":"Chen Y, Keogh E, Hu B, Begum N, Bagnall A, Mueen A, Batista G (2015) The UCR time series classification archive . \n                    www.cs.ucr.edu\/~eamonn\/time_series_data\/\n                    \n                  . Accessed 23 March 2018"},{"key":"617_CR9","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330","journal-title":"J Mach Learn Res"},{"key":"617_CR10","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.ins.2013.02.030","volume":"239","author":"H Deng","year":"2013","unstructured":"Deng H, Runger G, Tuv E, Vladimir M (2013) A time series forest for classification and feature extraction. Inf Sci 239:142\u2013153","journal-title":"Inf Sci"},{"issue":"3","key":"617_CR11","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.1016\/j.patcog.2011.08.018","volume":"45","author":"A Douzal-Chouakria","year":"2012","unstructured":"Douzal-Chouakria A, Amblard C (2012) Classification trees for time series. Pattern Recognit 45(3):1076\u20131091","journal-title":"Pattern Recognit"},{"issue":"1","key":"617_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-006-6226-1","volume":"63","author":"P Geurts","year":"2006","unstructured":"Geurts P, Ernst D, Wehenkel L (2006) Extremely randomized trees. Mach Learn 63(1):3\u201342","journal-title":"Mach Learn"},{"issue":"2","key":"617_CR13","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/s10618-012-0251-4","volume":"26","author":"T G\u00f3recki","year":"2013","unstructured":"G\u00f3recki T, \u0141uczak M (2013) Using derivatives in time series classification. Data Min Knowl Discov 26(2):310\u2013331","journal-title":"Data Min Knowl Discov"},{"issue":"2","key":"617_CR14","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10115-015-0905-9","volume":"49","author":"J Grabocka","year":"2016","unstructured":"Grabocka J, Wistuba M, Schmidt-Thieme L (2016) Fast classification of univariate and multivariate time series through shapelet discovery. Knowl Inf Syst 49(2):429\u2013454","journal-title":"Knowl Inf Syst"},{"key":"617_CR15","unstructured":"Haghiri S, Ghoshdastidar D, von Luxburg U (2017) Comparison-based nearest neighbor search. arXiv e-prints, \n                    arXiv:1704.01460"},{"key":"617_CR16","unstructured":"Haghiri S, Garreau D, von Luxburg U (2018) Comparison-based random forests. arXiv e-prints, \n                    arXiv:1806.06616"},{"key":"617_CR17","doi-asserted-by":"crossref","unstructured":"Hamooni H, Mueen A (2014) Dual-domain hierarchical classification of phonetic time series. In: 2014 IEEE international conference on data mining, pp 160\u2013169. IEEE","DOI":"10.1109\/ICDM.2014.92"},{"issue":"4","key":"617_CR18","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1007\/s10618-013-0322-1","volume":"28","author":"J Hills","year":"2014","unstructured":"Hills J, Lines J, Baranauskas E, Mapp J, Bagnall A (2014) Classification of time series by shapelet transformation. Data Min Knowl Discov 28(4):851\u2013881","journal-title":"Data Min Knowl Discov"},{"key":"617_CR19","unstructured":"Ho TK (1995) Random decision forests. In: Proceedings of the third international conference on document analysis and recognition, 1995, vol 1, pp 278\u2013282. IEEE"},{"issue":"9","key":"617_CR20","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1016\/j.patcog.2010.09.022","volume":"44","author":"YS Jeong","year":"2011","unstructured":"Jeong YS, Jeong MK, Omitaomu OA (2011) Weighted dynamic time warping for time series classification. Pattern Recognit 44(9):2231\u20132240","journal-title":"Pattern Recognit"},{"issue":"5","key":"617_CR21","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.1007\/s10618-016-0473-y","volume":"30","author":"I Karlsson","year":"2016","unstructured":"Karlsson I, Papapetrou P, Bostr\u00f6m H (2016) Generalized random shapelet forests. Data Min Knowl Discov 30(5):1053\u20131085","journal-title":"Data Min Knowl Discov"},{"key":"617_CR22","unstructured":"Keogh E, Wei L, Xi X, Lee S H, Vlachos M (2006) LB\\_Keogh supports exact indexing of shapes under rotation invariance with arbitrary representations and distance measures. In: Proceedings of the 32nd international conference on very large data bases, pp 882\u2013893. VLDB Endowment"},{"key":"617_CR23","doi-asserted-by":"crossref","unstructured":"Keogh EJ, Pazzani MJ (2001) Derivative dynamic time warping. In: Proceedings of the 2001 SIAM international conference on data mining, pp 1\u201311. SIAM","DOI":"10.1137\/1.9781611972719.1"},{"issue":"9","key":"617_CR24","doi-asserted-by":"publisher","first-page":"2169","DOI":"10.1016\/j.patcog.2008.11.030","volume":"42","author":"D Lemire","year":"2009","unstructured":"Lemire D (2009) Faster retrieval with a two-pass dynamic-time-warping lower bound. Pattern Recognit 42(9):2169\u20132180","journal-title":"Pattern Recognit"},{"issue":"2","key":"617_CR25","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/1862413.1862417","volume":"2","author":"Y Lifshits","year":"2010","unstructured":"Lifshits Y (2010) Nearest neighbor search: algorithmic perspective. SIGSPATIAL Spec 2(2):12\u201315","journal-title":"SIGSPATIAL Spec"},{"issue":"2","key":"617_CR26","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10844-012-0196-5","volume":"39","author":"J Lin","year":"2012","unstructured":"Lin J, Khade R, Li Y (2012) Rotation-invariant similarity in time series using bag-of-patterns representation. J Intell Inf Syst 39(2):287\u2013315","journal-title":"J Intell Inf Syst"},{"issue":"3","key":"617_CR27","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10618-014-0361-2","volume":"29","author":"J Lines","year":"2015","unstructured":"Lines J, Bagnall A (2015) Time series classification with ensembles of elastic distance measures. Data Min Knowl Discov 29(3):565","journal-title":"Data Min Knowl Discov"},{"issue":"2","key":"617_CR28","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1109\/TPAMI.2008.76","volume":"31","author":"PF Marteau","year":"2009","unstructured":"Marteau PF (2009) Time warp edit distance with stiffness adjustment for time series matching. IEEE Trans Pattern Anal Mach Intell 31(2):306\u2013318","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"617_CR29","unstructured":"Marteau PF (2016) Times series averaging and denoising from a probabilistic perspective on time-elastic kernels. arXiv preprint, \n                    arXiv:1611.09194"},{"key":"617_CR30","unstructured":"Muja M. FLANN-Fast library for approximate nearest neighbors. \n                    www.cs.ubc.ca\/research\/flann\/\n                    \n                  . Accessed 23 March 2018"},{"issue":"2","key":"617_CR31","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.patcog.2005.06.012","volume":"39","author":"E P\u0119kalska","year":"2006","unstructured":"P\u0119kalska E, Duin RP, Pacl\u00edk P (2006) Prototype selection for dissimilarity-based classifiers. Pattern Recognit 39(2):189\u2013208","journal-title":"Pattern Recognit"},{"key":"617_CR32","doi-asserted-by":"crossref","unstructured":"Petitjean F, Forestier G, Webb GI, Nicholson AE, Chen Y, Keogh E (2014) Dynamic time warping averaging of time series allows faster and more accurate classification. In: 2014 IEEE international conference on data mining, pp 470\u2013479. IEEE","DOI":"10.1109\/ICDM.2014.27"},{"issue":"1","key":"617_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-015-0878-8","volume":"47","author":"F Petitjean","year":"2016","unstructured":"Petitjean F, Forestier G, Webb GI, Nicholson AE, Chen Y, Keogh E (2016) Faster and more accurate classification of time series by exploiting a novel dynamic time warping averaging algorithm. Knowl Inf Syst 47(1):1\u201326","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"617_CR34","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2011.09.029","volume":"414","author":"F Petitjean","year":"2012","unstructured":"Petitjean F, Gan\u00e7arski P (2012) Summarizing a set of time series by averaging: from Steiner sequence to compact multiple alignment. Theor Comput Sci 414(1):76\u201391","journal-title":"Theor Comput Sci"},{"key":"617_CR35","doi-asserted-by":"crossref","unstructured":"Rakthanmanon T, Keogh E (2013) Fast shapelets: a scalable algorithm for discovering time series shapelets. In: Proceedings of the 13th SIAM international conference on data mining, pp 668\u2013676. SIAM","DOI":"10.1137\/1.9781611972832.74"},{"key":"617_CR36","unstructured":"Sakoe H, Chiba S (1971) A dynamic programming approach to continuous speech recognition. In: Proceedings of the seventh international congress on acoustics, vol 3, pp 65\u201369. Budapest, Hungary"},{"issue":"1","key":"617_CR37","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TASSP.1978.1163055","volume":"26","author":"H Sakoe","year":"1978","unstructured":"Sakoe H, Chiba S (1978) Dynamic programming algorithm optimization for spoken word recognition. IEEE Trans Acoust Speech Signal Process 26(1):43\u201349","journal-title":"IEEE Trans Acoust Speech Signal Process"},{"key":"617_CR38","doi-asserted-by":"publisher","unstructured":"Sathe S, Aggarwal CC (2017) Similarity forests. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201917, pp 395\u2013403. ACM. \n                    https:\/\/doi.org\/10.1145\/3097983.3098046","DOI":"10.1145\/3097983.3098046"},{"issue":"6","key":"617_CR39","doi-asserted-by":"publisher","first-page":"1505","DOI":"10.1007\/s10618-014-0377-7","volume":"29","author":"P Sch\u00e4fer","year":"2015","unstructured":"Sch\u00e4fer P (2015) The BOSS is concerned with time series classification in the presence of noise. Data Min Knowl Discov 29(6):1505\u20131530","journal-title":"Data Min Knowl Discov"},{"key":"617_CR40","first-page":"1","volume":"2","author":"P Sch\u00e4fer","year":"2015","unstructured":"Sch\u00e4fer P (2015) Scalable time series classification. Data Min Knowl Discov 2:1\u201326","journal-title":"Data Min Knowl Discov"},{"key":"617_CR41","doi-asserted-by":"publisher","unstructured":"Sch\u00e4fer P, H\u00f6gqvist M (2012) SFA: a symbolic fourier approximation and index for similarity search in high dimensional datasets. In: Proceedings of the 15th international conference on extending database technology, EDBT \u201912, pp 516\u2013527. ACM. \n                    https:\/\/doi.org\/10.1145\/2247596.2247656","DOI":"10.1145\/2247596.2247656"},{"key":"617_CR42","doi-asserted-by":"crossref","unstructured":"Sch\u00e4fer P, Leser U (2017) Fast and accurate time series classification with WEASEL. In: Proceedings of the 2017 ACM on conference on information and knowledge management, pp 637\u2013646. ACM","DOI":"10.1145\/3132847.3132980"},{"key":"617_CR43","doi-asserted-by":"crossref","unstructured":"Senin P, Malinchik S (2013) SAX-VSM: Interpretable time series classification using SAX and vector space model. In: 2013 IEEE 13th international conference on data mining, pp 1175\u20131180. IEEE","DOI":"10.1109\/ICDM.2013.52"},{"issue":"6","key":"617_CR44","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1109\/TKDE.2012.88","volume":"25","author":"A Stefan","year":"2013","unstructured":"Stefan A, Athitsos V, Das G (2013) The move-split-merge metric for time series. IEEE Trans Knowl Data Eng 25(6):1425\u20131438","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"617_CR45","doi-asserted-by":"crossref","unstructured":"Tan CW, Webb GI, Petitjean F (2017) Indexing and classifying gigabytes of time series under time warping. In: Proceedings of the 2017 SIAM international conference on data mining, pp 282\u2013290. SIAM","DOI":"10.1137\/1.9781611974973.32"},{"key":"617_CR46","doi-asserted-by":"crossref","unstructured":"Ting K.M, Zhu Y, Carman M, Zhu Y, Zhou Z.H (2016) Overcoming key weaknesses of distance-based neighbourhood methods using a data dependent dissimilarity measure. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp 1205\u20131214. ACM","DOI":"10.1145\/2939672.2939779"},{"key":"617_CR47","doi-asserted-by":"crossref","unstructured":"Ueno K, Xi X, Keogh E, Lee DJ (2006) Anytime classification using the nearest neighbor algorithm with applications to stream mining. In: 6th international conference on data mining, 2006. ICDM\u201906, pp 623\u2013632. IEEE","DOI":"10.1109\/ICDM.2006.21"},{"issue":"1","key":"617_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00778-004-0144-2","volume":"15","author":"M Vlachos","year":"2006","unstructured":"Vlachos M, Hadjieleftheriou M, Gunopulos D, Keogh E (2006) Indexing multidimensional time-series. Int J Very Large Data Bases 15(1):1\u201320","journal-title":"Int J Very Large Data Bases"},{"issue":"2","key":"617_CR49","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10618-012-0250-5","volume":"26","author":"X Wang","year":"2013","unstructured":"Wang X, Mueen A, Ding H, Trajcevski G, Scheuermann P, Keogh E (2013) Experimental comparison of representation methods and distance measures for time series data. Data Min Knowl Discov 26(2):275\u2013309","journal-title":"Data Min Knowl Discov"},{"key":"617_CR50","unstructured":"Yamada Y, Suzuki E, Yokoi H, Takabayashi K (2003) Decision-tree induction from time-series data based on a standard-example split test. In: Proceedings of the twentieth international conference on international conference on machine learning, ICML\u201903, pp 840\u2013847. AAAI Press. \n                    http:\/\/dl.acm.org\/citation.cfm?id=3041838.3041944"},{"issue":"1","key":"617_CR51","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10618-010-0179-5","volume":"22","author":"L Ye","year":"2011","unstructured":"Ye L, Keogh E (2011) Time series shapelets: a novel technique that allows accurate, interpretable and fast classification. Data Min Knowl Discov 22(1):149\u2013182","journal-title":"Data Min Knowl Discov"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-019-00617-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-019-00617-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-019-00617-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T13:53:32Z","timestamp":1589723612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-019-00617-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,6]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["617"],"URL":"https:\/\/doi.org\/10.1007\/s10618-019-00617-3","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,6]]},"assertion":[{"value":"24 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}