{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:31:47Z","timestamp":1773246707391,"version":"3.50.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031264214","type":"print"},{"value":"9783031264221","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-26422-1_6","type":"book-chapter","created":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T01:08:37Z","timestamp":1679879317000},"page":"87-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["TS-MIoU: A Time Series Similarity Metric Without Mapping"],"prefix":"10.1007","author":[{"given":"Azim","family":"Ahmadzadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krishna Rukmini","family":"Puthucode","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruizhe","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafal A.","family":"Angryk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,18]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Ahmadzadeh, A., Kempton, D.J., Chen, Y., Angryk, R.A.: Multiscale iou: A metric for evaluation of salient object detection with fine structures. In: 2021 IEEE International Conference on Image Processing (ICIP), pp. 684\u2013688 (2021). https:\/\/doi.org\/10.1109\/ICIP42928.2021.9506337","DOI":"10.1109\/ICIP42928.2021.9506337"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Alt, H.: The computational geometry of comparing shapes. In: Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday. LNCS, vol. 5760, pp. 235\u2013248. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-03456-5_16","DOI":"10.1007\/978-3-642-03456-5_16"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Batista, G.E.A.P.A., Wang, X., Keogh, E.J.: A complexity-invariant distance measure for time series. In: Proceedings of the Eleventh SIAM International Conference on Data Mining, SDM 2011, 28\u201330 April 2011, Mesa, Arizona, USA, pp. 699\u2013710. SIAM \/ Omnipress (2011). https:\/\/doi.org\/10.1137\/1.9781611972818.60","DOI":"10.1137\/1.9781611972818.60"},{"key":"6_CR4","unstructured":"Berndt, D.J., Clifford, J.: Using dynamic time warping to find patterns in time series. In: Knowledge Discovery in Databases: Papers from the 1994 AAAI Workshop, Seattle, Washington, USA, July 1994. Technical Report WS-94-03, pp. 359\u2013370. AAAI Press (1994)"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Chen, L., Ng, R.T.: On the marriage of lp-norms and edit distance. In: (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, Toronto, Canada, 31 August - 3 September 2004, pp. 792\u2013803. Morgan Kaufmann (2004). https:\/\/doi.org\/10.1016\/B978-012088469-8.50070-X, https:\/\/www.vldb.org\/conf\/2004\/RS21P2.PDF","DOI":"10.1016\/B978-012088469-8.50070-X"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Chen, L., \u00d6zsu, M.T., Oria, V.: Robust and fast similarity search for moving object trajectories. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, SIGMOD 2005, pp. 491\u2013502. Association for Computing Machinery, New York, NY, USA (2005). https:\/\/doi.org\/10.1145\/1066157.1066213","DOI":"10.1145\/1066157.1066213"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Dau, H.A., et al.: The UCR time series archive. IEEE CAA J. Autom. Sinica 6(6), 1293\u20131305 (2019)","DOI":"10.1109\/JAS.2019.1911747"},{"key":"6_CR8","unstructured":"Dau, H.A., et al.: The ucr time series classification archive (October 2018). https:\/\/www.cs.ucr.edu\/~eamonn\/time_series_data_2018\/"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Frentzos, E., Gratsias, K., Theodoridis, Y.: Index-based most similar trajectory search. In: Proceedings of the 23rd International Conference on Data Engineering, ICDE 2007, The Marmara Hotel, Istanbul, Turkey, 15\u201320 April 2007, pp. 816\u2013825. IEEE Computer Society (2007). https:\/\/doi.org\/10.1109\/ICDE.2007.367927","DOI":"10.1109\/ICDE.2007.367927"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Ge, F., Wang, S., Liu, T.: Image-segmentation evaluation from the perspective of salient object extraction. In: 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2006), vol. 1, pp. 1146\u20131153. IEEE (2006)","DOI":"10.1109\/CVPR.2006.147"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1038\/239174c0","volume":"239","author":"G Gilbert","year":"1972","unstructured":"Gilbert, G.: Distance between sets. Nature 239, 174\u2013174 (1972)","journal-title":"Nature"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Harris, C.R., Millman, K.J., et al.: Array programming with NumPy. Nature 585(7825), 357\u2013362 (2020)","DOI":"10.1038\/s41586-020-2649-2"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Hong, J.Y., Park, S.H., Baek, J.G.: Ssdtw: Shape segment dynamic time warping. Expert Syst. Appl. 150, 113291 (2020)","DOI":"10.1016\/j.eswa.2020.113291"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Jaccard, P.: The distribution of the flora in the alpine zone. New Phytologist 11, 37\u201350 (1912)","DOI":"10.1111\/j.1469-8137.1912.tb05611.x"},{"key":"6_CR15","unstructured":"Kadous, W., Taylor, S.A.: Grasp: Recognition of australian sign language using instrumented gloves (1995)"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Keogh, E.J.: Exact indexing of dynamic time warping. In: Proceedings of 28th International Conference on Very Large Data Bases, VLDB 2002, Hong Kong, 20\u201323 August 2002, pp. 406\u2013417. Morgan Kaufmann (2002). https:\/\/doi.org\/10.1016\/B978-155860869-6\/50043-3, www.vldb.org\/conf\/2002\/S12P01.pdf","DOI":"10.1016\/B978-155860869-6\/50043-3"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Keogh, E.J., Ratanamahatana, C.A.: Exact indexing of dynamic time warping. Knowl. Inf. Syst. 7(3), 358\u2013386 (2005)","DOI":"10.1007\/s10115-004-0154-9"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Kosub, S.: A note on the triangle inequality for the jaccard distance. Pattern Recognit. Lett. 120, 36\u201338 (2019)","DOI":"10.1016\/j.patrec.2018.12.007"},{"key":"6_CR19","unstructured":"Levenshtein, V.I., et al.: Binary codes capable of correcting deletions, insertions, and reversals. In: Soviet Physics Doklady. vol. 10, pp. 707\u2013710. Soviet Union (1966)"},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Lin, B., Su, J.: Shapes based trajectory queries for moving objects. In: 13th ACM International Workshop on Geographic Information Systems, ACM-GIS 2005, 4\u20135 November 2005, Bremen, Germany, Proceedings, pp. 21\u201330. ACM (2005). https:\/\/doi.org\/10.1145\/1097064.1097069","DOI":"10.1145\/1097064.1097069"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vis. 60(2), 91\u2013110 (2004)","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Ma, R., Ahmadzadeh, A., Boubrahimi, S.F., Angryk, R.A.: Segmentation of time series in improving dynamic time warping. In: 2018 IEEE International Conference on Big Data (Big Data), pp. 3756\u20133761 (2018). https:\/\/doi.org\/10.1109\/BigData.2018.8622554","DOI":"10.1109\/BigData.2018.8622554"},{"key":"6_CR23","unstructured":"Mandelbrot, B.B.: The fractal geometry of nature. 1982, San Francisco, CA (1982)"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Marteau, P.: Time warp edit distance with stiffness adjustment for time series matching. IEEE Trans. Pattern Anal. Mach. Intell. 31(2), 306\u2013318 (2009)","DOI":"10.1109\/TPAMI.2008.76"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Moreira-Matias, L., Gama, J., Ferreira, M., Mendes-Moreira, J., Damas, L.: Predicting taxi-passenger demand using streaming data. IEEE Trans. Intell. Transp. Syst. 14(3), 1393\u20131402 (2013)","DOI":"10.1109\/TITS.2013.2262376"},{"key":"6_CR26","unstructured":"Mrak, S., et al.: Reliability of objective picture quality measures. J. Electr. Eng. 55(1\u20132), 3\u201310 (2004)"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Pilgrim, I., Taylor, R.P.: Fractal analysis of time-series data sets: Methods and challenges (2019)","DOI":"10.5772\/intechopen.81958"},{"key":"6_CR28","unstructured":"Ratanamahatana, C.A., Keogh, E.: Everything you know about dynamic time warping is wrong. In: Third workshop on Mining Temporal And Sequential Data, vol. 32. Citeseer (2004)"},{"key":"6_CR29","doi-asserted-by":"publisher","unstructured":"Ratanamahatana, C.A., Keogh, E.J.: Making time-series classification more accurate using learned constraints, pp. 11\u201322 (2004). https:\/\/doi.org\/10.1137\/1.9781611972740.2","DOI":"10.1137\/1.9781611972740.2"},{"key":"6_CR30","doi-asserted-by":"publisher","unstructured":"Sakoe, H., Chiba, S.: Dynamic programming algorithm optimization for spoken word recognition. IEEE Trans. Acoust. Speech Signal Process. 26(1), 43\u201349 (1978). https:\/\/doi.org\/10.1109\/TASSP.1978.1163055","DOI":"10.1109\/TASSP.1978.1163055"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Sukhanov, S., Wu, R., Debes, C., Zoubir, A.M.: Dynamic pattern matching with multiple queries on large scale data streams. Signal Process. 171, 107402 (2020)","DOI":"10.1016\/j.sigpro.2019.107402"},{"key":"6_CR32","unstructured":"Tavenard, R., et al.: Tslearn, a machine learning toolkit for time series data. J. Mach. Learn. Res. 21, 118:1\u2013118:6 (2020)"},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Theiler, J.: Estimating fractal dimension. J. Optical Soc. Am. A-optics Image Sci. Vis. 7(6), 1055\u20131073 (1990)","DOI":"10.1364\/JOSAA.7.001055"},{"key":"6_CR34","unstructured":"Vlachos, M., Kollios, G., Gunopulos, D.: Discovering similar multidimensional trajectories. In: Proceedings 18th International Conference On Data Engineering. pp. 673\u2013684. IEEE (2002)"},{"key":"6_CR35","unstructured":"Yi, B., Faloutsos, C.: Fast time sequence indexing for arbitrary lp norms, pp. 385\u2013394 (2000), www.vldb.org\/conf\/2000\/P385.pdf"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26422-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T01:56:10Z","timestamp":1729130170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26422-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031264214","9783031264221"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26422-1_6","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":"18 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grenoble","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.ecmlpkdd.org\/","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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1060","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":"236","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":"22% - 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":"3-4","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":"3-4","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)"}},{"value":"17 demo track papers have been accepted from 28 submissions","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}