{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:27:30Z","timestamp":1742966850749,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030975456"},{"type":"electronic","value":"9783030975463"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-97546-3_44","type":"book-chapter","created":{"date-parts":[[2022,3,18]],"date-time":"2022-03-18T04:41:28Z","timestamp":1647578488000},"page":"543-555","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multivariate Ordinal Patterns for Symmetry Approximation in Dynamic Probabilistic Relational Models"],"prefix":"10.1007","author":[{"given":"Nils","family":"Finke","sequence":"first","affiliation":[]},{"given":"Ralf","family":"M\u00f6ller","sequence":"additional","affiliation":[]},{"given":"Marisa","family":"Mohr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,19]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Agostini, A., Celaya, E.: Exploiting domain symmetries in reinforcement learning with continuous state and action spaces. In: 2009 International Conference on Machine Learning and Applications, Miami, FL, USA, pp. 331\u2013336. IEEE (2009)","key":"44_CR1","DOI":"10.1109\/ICMLA.2009.41"},{"key":"44_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/3-540-57301-1_5","volume-title":"Foundations of Data Organization and Algorithms","author":"R Agrawal","year":"1993","unstructured":"Agrawal, R., Faloutsos, C., Swami, A.: Efficient similarity search in sequence databases. In: Lomet, D.B. (ed.) FODO 1993. LNCS, vol. 730, pp. 69\u201384. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57301-1_5"},{"issue":"17","key":"44_CR3","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1103\/PhysRevLett.88.174102","volume":"88","author":"C Bandt","year":"2002","unstructured":"Bandt, C., Pompe, B.: Permutation entropy: a natural complexity measure for time series. Phys. Rev. Lett. 88(17), 4 (2002)","journal-title":"Phys. Rev. Lett."},{"unstructured":"Bellman, R.: Adaptive Control Processes: A guided Tour. Princeton Legacy Library, Princeton University Press, Princeton (2015)","key":"44_CR4"},{"doi-asserted-by":"crossref","unstructured":"Bertozzi, A.L., Merkurjev, E.: Chapter 12 - Graph-based optimization approaches for machine learning, uncertainty quantification and networks. In: Kimmel, R., Tai, X.C. (eds.) Processing, Analyzing and Learning of Images, Shapes, and Forms: Part 2, Handbook of Numerical Analysis, vol. 20, pp. 503\u2013531. Elsevier (2019)","key":"44_CR5","DOI":"10.1016\/bs.hna.2019.04.001"},{"doi-asserted-by":"crossref","unstructured":"Chiu, B., Keogh, E., Lonardi, S.: Probabilistic discovery of time series motifs. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 493\u2013498 (2003)","key":"44_CR6","DOI":"10.1145\/956750.956808"},{"unstructured":"Dieleman, S., Fauw, J.D., Kavukcuoglu, K.: Exploiting cyclic symmetry in convolutional neural networks. In: Proceedings of the 33rd International Conference on Machine Learning, pp. 1889\u20131898 (2016)","key":"44_CR7"},{"unstructured":"Finke, N., Gehrke, M., Braun, T., Potten, T., M\u00f6ller, R.: Investigating matureness of probabilistic graphical models for dry-bulk shipping. In: Proceedings of the 10th International Conference on Probabilistic Graphical Models, pp. 197\u2013208 (2020)","key":"44_CR8"},{"key":"44_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-030-87626-5_23","volume-title":"KI 2021: Advances in Artificial Intelligence","author":"N Finke","year":"2021","unstructured":"Finke, N., Mohr, M.: A priori approximation of symmetries in dynamic probabilistic relational models. In: Edelkamp, S., M\u00f6ller, R., Rueckert, E. (eds.) KI 2021. LNCS (LNAI), vol. 12873, pp. 309\u2013323. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-87626-5_23"},{"key":"44_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-319-91379-7_5","volume-title":"Graph-Based Representation and Reasoning","author":"M Gehrke","year":"2018","unstructured":"Gehrke, M., Braun, T., M\u00f6ller, R.: Lifted dynamic junction tree algorithm. In: Chapman, P., Endres, D., Pernelle, N. (eds.) ICCS 2018. LNCS (LNAI), vol. 10872, pp. 55\u201369. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91379-7_5"},{"doi-asserted-by":"publisher","unstructured":"Keogh, E., Chakrabarti, K., Pazzani, M., Mehrotra, S.: Dimensionality reduction for fast similarity search in large time series databases. In: Knowledge and Information Systems, pp. 263\u2013286 (2001). https:\/\/doi.org\/10.1021\/acsami.7b03579","key":"44_CR11","DOI":"10.1021\/acsami.7b03579"},{"doi-asserted-by":"crossref","unstructured":"Kramer, S.: A brief history of learning symbolic higher-level representations from data (and a curious look forward). In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI-20, pp. 4868\u20134876 (2020)","key":"44_CR12","DOI":"10.24963\/ijcai.2020\/678"},{"doi-asserted-by":"crossref","unstructured":"Kruskal, J.B., Liberman, M.: The symmetric time warping problem: From continuous to discrete. In: Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley Publishing Co. (1983)","key":"44_CR13","DOI":"10.1137\/1025045"},{"unstructured":"Mohr, M., Wilhelm, F., Hartwig, M., M\u00f6ller, R., Keller, K.: New approaches in ordinal pattern representations for multivariate time series. In: Proceedings of the 33rd International Florida Artificial Intelligence Research Society Conference (2020)","key":"44_CR14"},{"doi-asserted-by":"crossref","unstructured":"Myers, A., Khasawneh, F.A.: On the automatic parameter selection for permutation entropy. Chaos: an Interdis. J. Nonlinear Sci. 30(3), 033130 (2020)","key":"44_CR15","DOI":"10.1063\/1.5111719"},{"doi-asserted-by":"crossref","unstructured":"Niepert, M., Van den Broeck, G.: Tractability through exchangeability: a new perspective on efficient probabilistic inference. In: AAAI-14 Proceedings of the 28th AAAI Conference on Artificial Intelligence, pp. 2467\u20132475. AAAI Press (2014)","key":"44_CR16","DOI":"10.1609\/aaai.v28i1.9073"},{"doi-asserted-by":"crossref","unstructured":"Petitjean, F., Inglada, J., Gancarski, P.: Satellite image time series analysis under time warping. IEEE Trans. Geosci. Remote Sens. 50(8) (2012)","key":"44_CR17","DOI":"10.1109\/TGRS.2011.2179050"},{"unstructured":"Poole, D.: First-order probabilistic inference. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence, pp. 985\u2013991 (2003)","key":"44_CR18"},{"unstructured":"Salvador, S., Chan, P.: FastDTW: toward accurate dynamic time warping in linear time and space. In: KDD Workshop on Mining Temporal and Sequential Data, pp. 70\u201380 (2004)","key":"44_CR19"},{"doi-asserted-by":"crossref","unstructured":"Sato, T.: A Statistical learning method for logic programs with distribution semantics. In: Proceedings of the 12th International Conference on Logic Programming, pp. 715\u2013729 (1995)","key":"44_CR20","DOI":"10.7551\/mitpress\/4298.003.0069"},{"unstructured":"Satorras, V.G., Hoogeboom, E., Welling, M.: E(n) equivariant graph neural networks. In: Proceedings of the 38th ICML (2021)","key":"44_CR21"},{"doi-asserted-by":"crossref","unstructured":"Yeh, C.C.M., et al.: Matrix profile I: all pairs similarity joins for time series: a unifying view that includes motifs, discords and shapelets. In: 2016 IEEE 16th International Conference on Data Mining (ICDM), pp. 1317\u20131322 (2016)","key":"44_CR22","DOI":"10.1109\/ICDM.2016.0179"}],"container-title":["Lecture Notes in Computer Science","AI 2021: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-97546-3_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T14:24:08Z","timestamp":1726842248000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-97546-3_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030975456","9783030975463"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-97546-3_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"19 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Joint Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"2 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ausai2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ajcai2021.net","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"120","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":"64","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":"53% - 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","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":"5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was postponed to 2022 and held virtually due to the COVID-19 pandemic.","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)"}}]}}