{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T17:57:24Z","timestamp":1694023044299},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,1,4]],"date-time":"2015-01-04T00:00:00Z","timestamp":1420329600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10115-014-0814-3","type":"journal-article","created":{"date-parts":[[2015,1,3]],"date-time":"2015-01-03T14:34:04Z","timestamp":1420295644000},"page":"59-86","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Discovery of time series $$k$$ k -motifs based on multidimensional index"],"prefix":"10.1007","volume":"46","author":[{"given":"Nguyen Thanh","family":"Son","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duong Tuan","family":"Anh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,4]]},"reference":[{"key":"814_CR1","doi-asserted-by":"crossref","unstructured":"Beckman N, Kriege, H, Schneider R, Seeger B (1990) The $$\\text{ R }^{\\ast }$$ R * -tree: an efficient and robust access method for points and rectangles. In: Proceedings of 1990 ACM-SIGMOD conference, Atlantic City, NJ, pp 322\u2013331","DOI":"10.1145\/93597.98741"},{"key":"814_CR2","doi-asserted-by":"crossref","unstructured":"Buhler J, Tompa M (2001) Finding motifs using random projections. In: Proceedings of the 5th annual international conference on computational biology, pp 69\u201376","DOI":"10.1145\/369133.369172"},{"key":"814_CR3","first-page":"105","volume-title":"Advances in data analysis, data handling and business intelligences, studies in classification, data analysis, knowledge organization","author":"K Buza","year":"2010","unstructured":"Buza K, Thieme LS (2010) motif-based classification of time series with bayesian networks and svms. In: Fink A et al (eds) Advances in data analysis, data handling and business intelligences, studies in classification, data analysis, knowledge organization. Springer, Berlin, pp 105\u2013114"},{"key":"814_CR4","doi-asserted-by":"crossref","unstructured":"Castro N, Azevedo P (2010) Multiresolution motif discovery in time series. In: Proceedings of SIAM international conference on data mining, April 29\u2013May 1, Columbus, OH, USA","DOI":"10.1137\/1.9781611972801.73"},{"key":"814_CR5","doi-asserted-by":"crossref","unstructured":"Chiu B, Keogh E, Lonardi S (2003) Probabilistic discovery of time series motifs. In: Proceedings of the 9th International conference on knowledge discovery and data mining (KDD\u201903), pp 493\u2013498","DOI":"10.1145\/956750.956808"},{"key":"814_CR6","doi-asserted-by":"crossref","unstructured":"Ferreira P, Azevedo P, Silva C, Brito R (2006) Mining approximate motifs in time series. In: Proceedings of the 9th international conference on discovery science, pp 89\u2013101","DOI":"10.1007\/11893318_12"},{"key":"814_CR7","doi-asserted-by":"crossref","unstructured":"Faloutsos C, Ranganathan R, Manolopoulos Y (1994) Fast subsequence matching in time series databases. In: Proceedings of ACM SIGMOD conference, May, pp 419\u2013429","DOI":"10.1145\/191839.191925"},{"key":"814_CR8","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD international conference on management of data, June 18\u201321, pp 47\u201357","DOI":"10.1145\/602259.602266"},{"key":"814_CR9","unstructured":"Gruber C, Coduro M, Sick B (2006) Signature verification with dynamic RBF networks and time series motifs. In: Proceedings of 10th international workshop on Frontiers in handwriting recognition"},{"key":"814_CR10","unstructured":"Jiang Y, Li C, Han J (2009) Stock temporal prediction based on time series motifs. In: Proceedings of 8th international conference on machine learning and cybernetics, Baoding, China, July 12\u201315"},{"issue":"3","key":"814_CR11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/PL00011669","volume":"3","author":"E Keogh","year":"2001","unstructured":"Keogh E, Chakrabarti K, Pazzani M, Mehrotra S (2001) Dimensionality reduction for fast similarity search in large time series databases. Knowl Inf Syst 3(3):263\u2013286","journal-title":"Knowl Inf Syst"},{"key":"814_CR12","doi-asserted-by":"crossref","unstructured":"Keogh E, Chakrabarti K, Pazzani, M, Mehrotra S (2001) Locally adaptive dimensionality reduction for indexing large time series databases. In: Proceedings of ACM SIGMOD conference on management of data, Santa Barbara, CA, May 21\u201324, pp 151\u2013162","DOI":"10.1145\/375663.375680"},{"key":"814_CR13","unstructured":"Keogh E, Zhu Q, Hu B, Hao Y, Xi X, Wei L, Ratanamahatana CA (2011) The UCR time series classification\/clustering homepage. http:\/\/www.cs.ucr.edu\/~eamonn\/time_series_data"},{"key":"814_CR14","unstructured":"Lin J, Keogh E, Lonardi S, Patel P (2002) Finding motifs in time series. In: Proceedings of 2nd workshop on temporal data mining. Edmonton, Alberta, Canada"},{"key":"814_CR15","doi-asserted-by":"crossref","unstructured":"Lin J, Keogh E, Lonardi S, Chiu, B (2003) A symbolic representation of time series with implications for streaming algorithms. In: Proceedings of the 8th ACM SIGMOD workshop on research issues in data mining and knowledge discovery","DOI":"10.1145\/882082.882086"},{"key":"814_CR16","doi-asserted-by":"crossref","unstructured":"Li Q, Lopez IFV, Moon B (2004) Skyline index for time series data. IEEE Trans Knowl Data Eng 16(6):669\u2013684","DOI":"10.1109\/TKDE.2004.14"},{"key":"814_CR17","unstructured":"Meng J, Yuan J, Hans H, Wu Y (2008) Mining motifs from human motion. In: Proceedings of eurographics"},{"key":"814_CR18","doi-asserted-by":"crossref","unstructured":"Mueen A, Keogh E, Zhu Q, Cash S, Westover B (2009) Exact discovery of time series motifs. In: Proceedings of SIAM international conference on data mining, pp 473\u2013484","DOI":"10.1137\/1.9781611972795.41"},{"key":"814_CR19","doi-asserted-by":"crossref","unstructured":"Phu L, Anh DT (2011) Motif-based method for initialization the k-Means clustering for time series data. In: Wang D, Reynolds M. (eds) Proceedings of 24th Australasian joint conference (AI 2011), Perth, Australia, Dec 5\u20138. LNAI 7106, Springer, Berlin, pp 11\u201320","DOI":"10.1007\/978-3-642-25832-9_2"},{"issue":"1","key":"814_CR20","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1142\/S0219467802000482","volume":"2","author":"KB Pratt","year":"2002","unstructured":"Pratt KB, Fink E (2002) Search for patterns in compressed time series. Int J Image Graph 2(1):89\u2013106","journal-title":"Int J Image Graph"},{"key":"814_CR21","doi-asserted-by":"crossref","unstructured":"Ratanamahatana CA, Keogh E, Bagnall AJ, Lonardi S (2004) A novel bit level time series representation with implications for similarity search and clustering. In: Proceedings of PAKDD, Hanoi, Vietnam","DOI":"10.1007\/11430919_90"},{"key":"814_CR22","doi-asserted-by":"crossref","unstructured":"Schl\u00fcter T, Conrad S (2012) Hidden Markov Model-based time series prediction using motifs for detecting inter-time-serial correlations. In: Proceedings ACM symposium on applied computing (SAC), Riva del Garda (Trento), Italy","DOI":"10.1145\/2245276.2245308"},{"key":"814_CR23","unstructured":"Son NT, Anh DT (2011) Time series similarity search based on middle points and clipping. In: Proceedings of 3rd conference on data mining and optimization (DMO 2011), Putrajaya, Malaysia, June 28\u201329, pp 13\u201319"},{"key":"814_CR24","doi-asserted-by":"crossref","unstructured":"Son NT, Anh DT (2012) Discovering time series motifs based on multidimensional index and early abandoning. In: Proceedings of 4th international conference on computational collective intelligence (ICCCI 2012) Part 1, Ho Chi Minh City, Vietnam, November, LNAI 7653, Springer, Berlin, pp 72\u201382","DOI":"10.1007\/978-3-642-34630-9_8"},{"key":"814_CR25","doi-asserted-by":"crossref","unstructured":"Tanaka Y, Uehara K (2003) Discover motifs in multi dimensional time series using the principal component analysis and the MDL principle. In: Proceedings of 3rd international conference on machine learning and data mining in pattern recognition, Leipzig, Germany, July 5\u20137, pp 252\u2013265","DOI":"10.1007\/3-540-45065-3_22"},{"key":"814_CR26","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s10994-005-5829-2","volume":"58","author":"Y Tanaka","year":"2005","unstructured":"Tanaka Y, Iwamoto K, Uehara K (2005) Discovery of time series motif from multi-dimensional data based on MDL principle. Mach Learn 58:269\u2013300","journal-title":"Mach Learn"},{"issue":"7","key":"814_CR27","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1016\/j.knosys.2008.03.022","volume":"21","author":"H Tang","year":"2008","unstructured":"Tang H, Liao S (2008) Discovering original motifs with different lengths from time series. Knowl Based Syst 21(7):666\u2013671","journal-title":"Knowl Based Syst"},{"key":"814_CR28","doi-asserted-by":"crossref","unstructured":"Xi X, Keogh E, Li W, Mafra-neto A (2007) Finding motifs in a database of shapes. In: Proceedings of SDM 2007, LNCS 4721, Springer, Heidelberg, pp 249\u2013260","DOI":"10.1137\/1.9781611972771.23"},{"key":"814_CR29","doi-asserted-by":"crossref","unstructured":"Yankov D, Keogh E, Medina J, Chiu B, Zordan V (2007) Detecting motifs under uniform scaling. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, pp 844\u2013853","DOI":"10.1145\/1281192.1281282"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0814-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-014-0814-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0814-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T05:26:55Z","timestamp":1566192415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-014-0814-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,4]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["814"],"URL":"https:\/\/doi.org\/10.1007\/s10115-014-0814-3","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,4]]}}}