{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T16:50:52Z","timestamp":1771606252176,"version":"3.50.1"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031498954","type":"print"},{"value":"9783031498961","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-49896-1_8","type":"book-chapter","created":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T14:02:29Z","timestamp":1702994549000},"page":"113-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Extracting Features from\u00a0Random Subseries: A Hybrid Pipeline for\u00a0Time Series Classification and\u00a0Extrinsic Regression"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Middlehurst","sequence":"first","affiliation":[]},{"given":"Anthony","family":"Bagnall","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,20]]},"reference":[{"issue":"3","key":"8_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.: The great time series classification bake off: a review and experimental evaluation of recent algorithmic advances. Data Min. Knowl. Disc. 31(3), 606\u2013660 (2017)","journal-title":"Data Min. Knowl. Disc."},{"key":"8_CR2","unstructured":"Bagnall, A., et al.: The UEA multivariate time series classification archive. arXiv preprint arXiv:1811.00075 (2018)"},{"key":"8_CR3","first-page":"1","volume":"17","author":"A Benavoli","year":"2016","unstructured":"Benavoli, A., Corani, G., Mangili, F.: Should we really use post-hoc tests based on mean-ranks? J. Mach. Learn. Res. 17, 1\u201310 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"8_CR4","first-page":"24","volume":"32","author":"A Bostrom","year":"2017","unstructured":"Bostrom, A., Bagnall, A.: Binary shapelet transform for multiclass time series classification. Trans. Large-Scale Data Knowl. Centered Syst. 32, 24\u201346 (2017)","journal-title":"Trans. Large-Scale Data Knowl. Centered Syst."},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00058655","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman, L.: Bagging predictors. Mach. Learn. 24(2), 123\u2013140 (1996)","journal-title":"Mach. Learn."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Cabello, N., Naghizade, E., Qi, J., Kulik, L.: Fast and accurate time series classification through supervised interval search. In: IEEE International Conference on Data Mining (2020)","DOI":"10.1109\/ICDM50108.2020.00107"},{"key":"8_CR7","unstructured":"Cabello, N., Naghizade, E., Qi, J., Kulik, L.: Fast, accurate and interpretable time series classification through randomization. arXiv preprint arXiv:2105.14876 (2021)"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.neucom.2018.03.067","volume":"307","author":"M Christ","year":"2018","unstructured":"Christ, M., Braun, N., Neuffer, J., Kempa-Liehr, A.W.: Time Series FeatuRe Extraction on basis of Scalable Hypothesis tests (tsfresh-A Python package). Neurocomputing 307, 72\u201377 (2018)","journal-title":"Neurocomputing"},{"issue":"6","key":"8_CR9","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1109\/JAS.2019.1911747","volume":"6","author":"H Dau","year":"2019","unstructured":"Dau, H., et al.: The UCR time series archive. IEEE\/CAA J. Automatica Sinica 6(6), 1293\u20131305 (2019)","journal-title":"IEEE\/CAA J. Automatica Sinica"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1007\/s10618-020-00701-z","volume":"34","author":"A Dempster","year":"2020","unstructured":"Dempster, A., Petitjean, F., Webb, G.: ROCKET: exceptionally fast and accurate time series classification using random convolutional kernels. Data Min. Knowl. Disc. 34, 1454\u20131495 (2020)","journal-title":"Data Min. Knowl. Disc."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Dempster, A., Schmidt, D.F., Webb, G.I.: HYDRA: competing convolutional kernels for fast and accurate time series classification. arXiv preprint arXiv:2203.13652 (2022)","DOI":"10.1007\/s10618-023-00939-3"},{"key":"8_CR12","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"8_CR13","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.: A time series forest for classification and feature extraction. Inf. Sci. 239, 142\u2013153 (2013)","journal-title":"Inf. Sci."},{"issue":"6","key":"8_CR14","doi-asserted-by":"publisher","first-page":"1936","DOI":"10.1007\/s10618-020-00710-y","volume":"34","author":"H Fawaz","year":"2020","unstructured":"Fawaz, H., et al.: InceptionTime: finding AlexNet for time series classification. Data Min. Knowl. Disc. 34(6), 1936\u20131962 (2020)","journal-title":"Data Min. Knowl. Disc."},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-030-29859-3_33","volume-title":"Hybrid Artificial Intelligent Systems","author":"M Flynn","year":"2019","unstructured":"Flynn, M., Large, J., Bagnall, T.: The contract random interval spectral ensemble (c-RISE): the effect of contracting a classifier on accuracy. In: P\u00e9rez Garc\u00eda, H., S\u00e1nchez Gonz\u00e1lez, L., Castej\u00f3n Limas, M., Quinti\u00e1n Pardo, H., Corchado Rodr\u00edguez, E. (eds.) HAIS 2019. LNCS (LNAI), vol. 11734, pp. 381\u2013392. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29859-3_33"},{"key":"8_CR16","first-page":"2677","volume":"9","author":"S Garc\u00eda","year":"2008","unstructured":"Garc\u00eda, S., Herrera, F.: An extension on \u201cstatistical comparisons of classifiers over multiple data sets\u2019\u2019 for all pairwise comparisons. J. Mach. Learn. Res. 9, 2677\u20132694 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1007\/978-3-030-75762-5_63","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"D Gay","year":"2021","unstructured":"Gay, D., Bondu, A., Lemaire, V., Boull\u00e9, M.: Interpretable feature construction for\u00a0time series extrinsic regression. In: Karlapalem, K., et al. (eds.) PAKDD 2021. LNCS (LNAI), vol. 12712, pp. 804\u2013816. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75762-5_63"},{"key":"8_CR18","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.: Extremely randomized trees. Mach. Learn. 63, 3\u201342 (2006)","journal-title":"Mach. Learn."},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Guijo-Rubio, D., Middlehurst, M., Arcencio, G., Silva, D.F., Bagnall, A.: Unsupervised feature based algorithms for time series extrinsic regression. arXiv preprint arXiv:2305.01429 (2023)","DOI":"10.1007\/s10618-024-01027-w"},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"Guillaume, A., Vrain, C., Elloumi, W.: Random dilated shapelet transform: a new approach for time series shapelets. In: El Yacoubi, M., Granger, E., Yuen, P.C., Pal, U., Vincent, N. (eds.) Pattern Recognition and Artificial Intelligence: Third International Conference, ICPRAI 2022, Paris, France, 1\u20133 June 2022, Proceedings, Part I, pp. 653\u2013664. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-09037-0_53","DOI":"10.1007\/978-3-031-09037-0_53"},{"key":"8_CR21","unstructured":"Herrmann, M., Tan, C.W., Salehi, M., Webb, G.I.: Proximity Forest 2.0: a new effective and scalable similarity-based classifier for time series. arXiv preprint arXiv:2304.05800 (2023)"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Lines, J., Davis, L., Hills, J., Bagnall, A.: A shapelet transform for time series classification. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2012)","DOI":"10.1145\/2339530.2339579"},{"issue":"5","key":"8_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3182382","volume":"12","author":"J Lines","year":"2018","unstructured":"Lines, J., Taylor, S., Bagnall, A.: Time series classification with HIVE-COTE: the hierarchical vote collective of transformation-based ensembles. ACM Trans. Knowl. Discov. Data 12(5), 1\u201336 (2018)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"6","key":"8_CR24","doi-asserted-by":"publisher","first-page":"1821","DOI":"10.1007\/s10618-019-00647-x","volume":"33","author":"C Lubba","year":"2019","unstructured":"Lubba, C., Sethi, S., Knaute, P., Schultz, S., Fulcher, B., Jones, N.: Catch22: canonical time-series characteristics. Data Min. Knowl. Disc. 33(6), 1821\u20131852 (2019)","journal-title":"Data Min. Knowl. Disc."},{"issue":"3","key":"8_CR25","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s10618-019-00617-3","volume":"33","author":"B Lucas","year":"2019","unstructured":"Lucas, B., et al.: Proximity forest: an effective and scalable distance-based classifier for time series. Data Min. Knowl. Disc. 33(3), 607\u2013635 (2019)","journal-title":"Data Min. Knowl. Disc."},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1007\/978-3-030-67658-2_38","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"M Middlehurst","year":"2021","unstructured":"Middlehurst, M., Large, J., Cawley, G., Bagnall, A.: The temporal dictionary ensemble (TDE) classifier for time series classification. In: Hutter, F., Kersting, K., Lijffijt, J., Valera, I. (eds.) ECML PKDD 2020. LNCS (LNAI), vol. 12457, pp. 660\u2013676. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67658-2_38"},{"key":"8_CR27","doi-asserted-by":"publisher","unstructured":"Middlehurst, M., Bagnall, A.: The FreshPRINCE: a simple transformation based pipeline time series classifier. In: El Yacoubi, M., Granger, E., Yuen, P.C., Pal, U., Vincent, N. (eds.) Pattern Recognition and Artificial Intelligence, ICPRAI 2022. LNCS, vol. 13364, pp. 150\u2013161. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-09282-4_13","DOI":"10.1007\/978-3-031-09282-4_13"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Middlehurst, M., Large, J., Bagnall, A.: The canonical interval forest (CIF) classifier for time series classification. In: IEEE International Conference on Big Data, pp. 188\u2013195 (2020)","DOI":"10.1109\/BigData50022.2020.9378424"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Middlehurst, M., Large, J., Flynn, M., Lines, J., Bostrom, A., Bagnall, A.: HIVE-COTE 2.0: a new meta ensemble for time series classification. Mach. Learn. 110, 3211\u20133243 (2021)","DOI":"10.1007\/s10994-021-06057-9"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Middlehurst, M., Sch\u00e4fer, P., Bagnall, A.: Bake off redux: a review and experimental evaluation of recent time series classification algorithms. arXiv preprint arXiv:2304.13029 (2023)","DOI":"10.1007\/s10618-024-01022-1"},{"key":"8_CR31","doi-asserted-by":"publisher","unstructured":"Nguyen, T.L., Ifrim, G.: Fast time series classification with random symbolic subsequences. In: Guyet, T., Ifrim, G., Malinowski, S., Bagnall, A., Shafer, P., Lemaire, V. (eds.) International Workshop on Advanced Analytics and Learning on Temporal Data, vol. 13812, pp. 50\u201365. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-24378-3_4","DOI":"10.1007\/978-3-031-24378-3_4"},{"issue":"10","key":"8_CR32","doi-asserted-by":"publisher","first-page":"1619","DOI":"10.1109\/TPAMI.2006.211","volume":"28","author":"JJ Rodriguez","year":"2006","unstructured":"Rodriguez, J.J., Kuncheva, L.I., Alonso, C.J.: Rotation forest: a new classifier ensemble method. IEEE Trans. Pattern Anal. Mach. Intell. 28(10), 1619\u20131630 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"8_CR33","doi-asserted-by":"crossref","unstructured":"Sch\u00e4fer, P., Leser, U.: Fast and accurate time series classification with WEASEL. In: Proceedings of the ACM Conference on Information and Knowledge Management, pp. 637\u2013646 (2017)","DOI":"10.1145\/3132847.3132980"},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Sch\u00e4fer, P., Leser, U.: Weasel 2.0 - a random dilated dictionary transform for fast, accurate and memory constrained time series classification. arXiv preprint arXiv:2301.10194 (2023)","DOI":"10.1007\/s10994-023-06395-w"},{"issue":"3","key":"8_CR35","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1007\/s10618-020-00679-8","volume":"34","author":"A Shifaz","year":"2020","unstructured":"Shifaz, A., Pelletier, C., Petitjean, F., Webb, G.I.: TS-CHIEF: a scalable and accurate forest algorithm for time series classification. Data Min. Knowl. Discov. 34(3), 742\u2013775 (2020)","journal-title":"Data Min. Knowl. Discov."},{"key":"8_CR36","doi-asserted-by":"publisher","first-page":"1032","DOI":"10.1007\/s10618-021-00745-9","volume":"35","author":"CW Tan","year":"2021","unstructured":"Tan, C.W., Bergmeir, C., Petitjean, F., Webb, G.: Time series extrinsic regression. Data Min. Knowl. Discov. 35, 1032\u20131060 (2021)","journal-title":"Data Min. Knowl. Discov."},{"key":"8_CR37","doi-asserted-by":"publisher","first-page":"1623","DOI":"10.1007\/s10618-022-00844-1","volume":"36","author":"CW Tan","year":"2022","unstructured":"Tan, C.W., Dempster, A., Bergmeir, C., Webb, G.: MultiRocket: multiple pooling operators and transformations for fast and effective time series classification. Data Min. Knowl. Discov. 36, 1623\u20131646 (2022)","journal-title":"Data Min. Knowl. Discov."}],"container-title":["Lecture Notes in Computer Science","Advanced Analytics and Learning on Temporal Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49896-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T10:08:00Z","timestamp":1730887680000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49896-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031498954","9783031498961"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49896-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"20 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AALTD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Advanced Analytics and Learning on Temporal Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaltd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecml-aaltd.github.io\/aaltd2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2-3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2-3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}