{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:40:10Z","timestamp":1760240410922,"version":"build-2065373602"},"reference-count":27,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T00:00:00Z","timestamp":1559692800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["665501","G091017N","G0F9816N"],"award-info":[{"award-number":["665501","G091017N","G0F9816N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["615517"],"award-info":[{"award-number":["615517"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Numerical time series data are pervasive, originating from sources as diverse as wearable devices, medical equipment, to sensors in industrial plants. In many cases, time series contain interesting information in terms of subsequences that recur in approximate form, so-called motifs. Major open challenges in this area include how one can formalize the interestingness of such motifs and how the most interesting ones can be found. We introduce a novel approach that tackles these issues. We formalize the notion of such subsequence patterns in an intuitive manner and present an information-theoretic approach for quantifying their interestingness with respect to any prior expectation a user may have about the time series. The resulting interestingness measure is thus a subjective measure, enabling a user to find motifs that are truly interesting to them. Although finding the best motif appears computationally intractable, we develop relaxations and a branch-and-bound approach implemented in a constraint programming solver. As shown in experiments on synthetic data and two real-world datasets, this enables us to mine interesting patterns in small or mid-sized time series.<\/jats:p>","DOI":"10.3390\/e21060566","type":"journal-article","created":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T03:38:01Z","timestamp":1559792281000},"page":"566","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["SIMIT: Subjectively Interesting Motifs in Time Series"],"prefix":"10.3390","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5160-2237","authenticated-orcid":false,"given":"Junning","family":"Deng","sequence":"first","affiliation":[{"name":"Department of Electronics and Information Systems, Ghent University, Technologiepark-Zwijnaarde 122, 9052 Ghent, Belgium"}]},{"given":"Jefrey","family":"Lijffijt","sequence":"additional","affiliation":[{"name":"Department of Electronics and Information Systems, Ghent University, Technologiepark-Zwijnaarde 122, 9052 Ghent, Belgium"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9895-9927","authenticated-orcid":false,"given":"Bo","family":"Kang","sequence":"additional","affiliation":[{"name":"Department of Electronics and Information Systems, Ghent University, Technologiepark-Zwijnaarde 122, 9052 Ghent, Belgium"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2692-7504","authenticated-orcid":false,"given":"Tijl","family":"De Bie","sequence":"additional","affiliation":[{"name":"Department of Electronics and Information Systems, Ghent University, Technologiepark-Zwijnaarde 122, 9052 Ghent, Belgium"}]}],"member":"1968","published-online":{"date-parts":[[2019,6,5]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1002\/widm.1119","article-title":"Time series motif discovery: dimensions and applications","volume":"4","author":"Mueen","year":"2014","journal-title":"Wiley Interdiscip. Rev. Data Min. Knowl. Discov."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Mueen, A., Keogh, E.J., Zhu, Q., Cash, S., and Westover, M.B. (2009). Exact Discovery of Time Series Motifs, SDM.","DOI":"10.1137\/1.9781611972795.41"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Yeh, C.M., Zhu, Y., Ulanova, L., Begum, N., Ding, Y., Dau, H.A., Silva, D.F., Mueen, A., and Keogh, E. (2016, January 12\u201315). Matrix Profile I: All Pairs Similarity Joins for Time Series: A Unifying View That Includes Motifs, Discords and Shapelets. Proceedings of the 2016 IEEE 16th International Conference on Data Mining (ICDM), Barcelona, Spain.","DOI":"10.1109\/ICDM.2016.0179"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s10115-014-0793-4","article-title":"Enumeration of time series motifs of all lengths","volume":"45","author":"Mueen","year":"2015","journal-title":"Knowl. Inf. Syst."},{"key":"ref_5","unstructured":"Lin, J., Keogh, E., Lonardi, S., and Patel, P. (2002, January 23\u201326). Finding Motifs in Time Series. Proceedings of the ACM SIGKDD, Edmonton, AB, Canada."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Chiu, B., Keogh, E., and Lonardi, S. (2003, January 24\u201327). Probabilistic Discovery of Time Series Motifs. Proceedings of the ACM SIGKDD, Washington, DC, USA.","DOI":"10.1145\/956750.956808"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Rakthanmanon, T., Campana, B.J.L., Mueen, A., Batista, G.E.A.P.A., Westover, M.B., Zhu, Q., Zakaria, J., and Keogh, E. (2012, January 12\u201316). Searching and mining trillions of time series subsequences under dynamic time warping. Proceedings of the ACM SIGKDD, Beijing, China.","DOI":"10.1145\/2339530.2339576"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"e1501057","DOI":"10.1126\/sciadv.1501057","article-title":"Earthquake detection through computationally efficient similarity search","volume":"1","author":"Yoon","year":"2015","journal-title":"Sci. Adv."},{"key":"ref_9","first-page":"10:1","article-title":"GrammarViz 3.0: Interactive Discovery of Variable-Length Time Series Patterns","volume":"12","author":"Senin","year":"2018","journal-title":"ACM TKDD"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Linardi, M., Zhu, Y., Palpanas, T., and Keogh, E. (2018, January 10\u201315). Matrix Profile X: VALMOD\u2014Scalable Discovery of Variable-Length Motifs in Data Series. Proceedings of the SIGMOD, Houston, TX, USA.","DOI":"10.1145\/3183713.3183744"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Yeh, C.M., Kavantzas, N., and Keogh, E. (2017, January 18\u201321). Matrix Profile VI: Meaningful Multidimensional Motif Discovery. Proceedings of the IEEE ICDM, New Orleans, LA, USA.","DOI":"10.1109\/ICDM.2017.66"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Mueen, A., and Keogh, E. (2010, January 24\u201328). Online Discovery and Maintenance of Time Series Motifs. Proceedings of the ACM SIGKDD, Washington, DC, USA.","DOI":"10.1145\/1835804.1835941"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Lin, J., and Li, Y. (2010, January 12\u201315). Finding approximate frequent patterns in streaming medical data. Proceedings of the IEEE International Symposium on CBMS, Perth, Australia.","DOI":"10.1109\/CBMS.2010.6042675"},{"key":"ref_14","unstructured":"Keogh, E., Wei, L., Xi, X., Lee, S., and Vlachos, M. (2006, January 12\u201315). LB_Keogh Supports Exact Indexing of Shapes under Rotation Invariance with Arbitrary Representations and Distance Measures. Proceedings of the 32nd International Conference on Very Large Data Bases, Seoul, Korea."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"e1199","DOI":"10.1002\/widm.1199","article-title":"Survey on time series motif discovery","volume":"7","author":"Torkamani","year":"2017","journal-title":"Wiley Interdiscip. Rev. Data Min. Knowl. Discov."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"De Bie, T. (2011, January 21\u201324). An information-theoretic framework for data mining. Proceedings of the ACM SIGKDD, San Diego, CA, USA.","DOI":"10.1145\/2020408.2020497"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"De Bie, T. (2013, January 17\u201319). Subjective interestingness in exploratory data mining. Proceedings of the IDA, London, UK.","DOI":"10.1007\/978-3-642-41398-8_3"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10618-010-0209-3","article-title":"Maximum entropy models and subjective interestingness: an application to tiles in binary databases","volume":"23","year":"2011","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02418571","article-title":"Sur les fonctions convexes et les in\u00e9galit\u00e9s entre les valeurs moyennes","volume":"30","author":"Jensen","year":"1906","journal-title":"Acta Math."},{"key":"ref_20","unstructured":"Google (2018, January 15). Google Optimization Tools(OR-Tools). Available online: https:\/\/github.com\/google\/or-tools."},{"key":"ref_21","unstructured":"Chen, Y., Keogh, E., Hu, B., Begum, N., Bagnall, A., Mueen, A., and Batista, G. (2018, January 15). The UCR Time Series Classification Archive. Available online: www.cs.ucr.edu\/~eamonn\/time_series_data\/."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/51.932724","article-title":"The Impact of the MIT-BIH Arrhythmia Database","volume":"20","author":"Moody","year":"2001","journal-title":"IEEE Eng. Med. Biol. Mag."},{"key":"ref_23","unstructured":"Open Power System Data (2018, March 15). Data Package Time Series. Available online: https:\/\/data.open-power-system-data.org\/time_series\/."},{"key":"ref_24","unstructured":"ENTOSO-E (2018, March 15). Detailed Hourly Load Data for All Countries 2006\u20132015. Available online: https:\/\/www.entsoe.eu\/data\/data-portal\/."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.physa.2015.03.083","article-title":"Renyi entropy and complexity measure for skew-Gaussian distributions and related families","volume":"433","year":"2015","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"2469","DOI":"10.1016\/j.chaos.2007.10.039","article-title":"Nonsymmetric entropy and maximum nonsymmetric entropy principle","volume":"40","author":"Liu","year":"2009","journal-title":"Chaos Solitons Fractals"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0377-0427(00)00433-7","article-title":"Interior-point methods","volume":"124","author":"Potra","year":"2000","journal-title":"J. Comput. Appl. Math."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/6\/566\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:56:24Z","timestamp":1760187384000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/6\/566"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,5]]},"references-count":27,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2019,6]]}},"alternative-id":["e21060566"],"URL":"https:\/\/doi.org\/10.3390\/e21060566","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2019,6,5]]}}}