{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T01:47:49Z","timestamp":1743731269639,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,8,7]],"date-time":"2018-08-07T00:00:00Z","timestamp":1533600000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["732051"],"award-info":[{"award-number":["732051"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10618-018-0580-z","type":"journal-article","created":{"date-parts":[[2018,8,7]],"date-time":"2018-08-07T05:38:51Z","timestamp":1533620331000},"page":"1481-1507","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["ParCorr: efficient parallel methods to identify similar time series pairs across sliding windows"],"prefix":"10.1007","volume":"32","author":[{"given":"Djamel Edine","family":"Yagoubi","sequence":"first","affiliation":[]},{"given":"Reza","family":"Akbarinia","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4871-0434","authenticated-orcid":false,"given":"Boyan","family":"Kolev","sequence":"additional","affiliation":[]},{"given":"Oleksandra","family":"Levchenko","sequence":"additional","affiliation":[]},{"given":"Florent","family":"Masseglia","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"Valduriez","sequence":"additional","affiliation":[]},{"given":"Dennis","family":"Shasha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,7]]},"reference":[{"issue":"4","key":"580_CR1","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/S0022-0000(03)00025-4","volume":"66","author":"D Achlioptas","year":"2003","unstructured":"Achlioptas D (2003) Database-friendly random projections: Johnson\u2013Lindenstrauss with binary coins. J Comput Syst Sci 66(4):671\u2013687","journal-title":"J Comput Syst Sci"},{"key":"580_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Faloutsos C, Swami AN (1993) Efficient similarity search in sequence databases. In: Proceedings of the international conference on foundations of data organization and algorithms (FODO). Springer, pp 69\u201384","DOI":"10.1007\/3-540-57301-1_5"},{"key":"580_CR3","doi-asserted-by":"crossref","unstructured":"Assent I, Krieger R, Afschari F, Seidl T (2008) The ts-tree: efficient time series search and retrieval. In: Proceedings of the international conference on extending database technology (EDBT), pp 252\u2013263","DOI":"10.1145\/1353343.1353376"},{"key":"580_CR4","doi-asserted-by":"crossref","unstructured":"Cai Y, Ng R (2004) Indexing spatio-temporal trajectories with Chebyshev polynomials. In: Proceedings of the international conference on management of data (SIGMOD). ACM, pp 599\u2013610","DOI":"10.1145\/1007568.1007636"},{"key":"580_CR5","unstructured":"Camerra A, Palpanas T, Shieh J, Keogh E (2010) iSAX 2.0: Indexing and mining one billion time series. In: Proceedings of the international conference on data mining (ICDM), pp 58\u201367"},{"issue":"1","key":"580_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10115-012-0606-6","volume":"39","author":"A Camerra","year":"2014","unstructured":"Camerra A, Shieh J, Palpanas T, Rakthanmanon T, Keogh EJ (2014) Beyond one billion time series: indexing and mining very large time series collections with iSAX2\n                    \n                      \n                    \n                    $$+$$\n                    \n                      \n                        +\n                      \n                    \n                  . Knowl Inf Syst 39(1):123\u2013151","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"580_CR7","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1145\/568518.568520","volume":"27","author":"K Chakrabarti","year":"2002","unstructured":"Chakrabarti K, Keogh E, Mehrotra S, Pazzani M (2002) Locally adaptive dimensionality reduction for indexing large time series databases. ACM Trans Data Syst 27(2):188\u2013228","journal-title":"ACM Trans Data Syst"},{"key":"580_CR8","unstructured":"Chan K, Fu AW (1999) Efficient time series matching by wavelets. In: Proceedings of the international conference on data engineering (ICDE). IEEE Computer Society, pp 126\u2013133"},{"key":"580_CR9","doi-asserted-by":"crossref","unstructured":"Charikar MS (2002) Similarity estimation techniques from rounding algorithms. In: Proceedings of the thirty-fourth annual ACM symposium on theory of computing (STOC), pp 380\u2013388","DOI":"10.1145\/509907.509965"},{"key":"580_CR10","doi-asserted-by":"crossref","unstructured":"Cole R, Shasha D, Zhao X (2005) Fast window correlations over uncooperative time series. In: Proceedings of the international conference on knowledge discovery and data mining (SIGKDD). ACM, pp 743\u2013749","DOI":"10.1145\/1081870.1081966"},{"key":"580_CR11","doi-asserted-by":"crossref","unstructured":"Faloutsos C, Ranganathan M, Manolopoulos Y (1994) Fast subsequence matching in time-series databases. In: Proceedings of the international conference on management of data (SIGMOD), pp 419\u2013429","DOI":"10.1145\/191839.191925"},{"key":"580_CR12","doi-asserted-by":"crossref","unstructured":"Geerts F, Goethals B, Mielik\u00e4inen T (2004) Tiling databases. In: International conference on discovery science, pp 278\u2013289","DOI":"10.1007\/978-3-540-30214-8_22"},{"key":"580_CR13","unstructured":"Gionis A, Indyk P, Motwani R (1999) Similarity search in high dimensions via hashing. In: Proceedings of the international conference on very large databases (VLDB), pp 518\u2013529"},{"key":"580_CR14","doi-asserted-by":"crossref","unstructured":"Gionis A, Mannila H, Sepp\u00e4nen J (2004) Geometric and combinatorial tiles in 0\u20131 data. In: Knowledge discovery in databases: PKDD, pp 173\u2013184","DOI":"10.1007\/978-3-540-30116-5_18"},{"key":"580_CR15","doi-asserted-by":"crossref","unstructured":"Guo T, Sathe S, Aberer K (2015) Fast distributed correlation discovery over streaming time-series data. In: Proceedings of the international conference on information and knowledge management (CIKM), pp 1161\u20131170","DOI":"10.1145\/2806416.2806440"},{"key":"580_CR16","doi-asserted-by":"crossref","unstructured":"Hallac D, Vare S, Boyd SP, Leskovec J (2017) Toeplitz inverse covariance-based clustering of multivariate time series data. In: Proceedings of the international conference on knowledge discovery and data mining (SIGKDD), pp 215\u2013223","DOI":"10.1145\/3097983.3098060"},{"key":"580_CR17","doi-asserted-by":"crossref","unstructured":"Henelius A, Karlsson I, Papapetrou P, Ukkonen A, Puolam\u00e4ki K (2016) Semigeometric tiling of event sequences. In: Machine learning and knowledge discovery in databases. ECML PKDD, pp 329\u2013344","DOI":"10.1007\/978-3-319-46128-1_21"},{"key":"580_CR18","unstructured":"Incorporated research institutions for seismology\u2014seismic data access. \n                    http:\/\/ds.iris.edu\/data\/access\/\n                    \n                  . Accessed 16 Apr 2018"},{"key":"580_CR19","doi-asserted-by":"crossref","unstructured":"Indyk P (2000) Stable distributions, pseudorandom generators, embeddings and data stream computation. In: 41st annual symposium on foundations of computer science (FOCS), pp 189\u2013197","DOI":"10.1109\/SFCS.2000.892082"},{"key":"580_CR20","unstructured":"Johnson WB, Lindenstrauss J (1984) Extensions of Lipschitz mappings into a Hilbert space. In: Conference in modern analysis and probability, vol 26 of contemporary mathematics, pp 189\u2013206"},{"issue":"3","key":"580_CR21","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/PL00011669","volume":"3","author":"EJ Keogh","year":"2001","unstructured":"Keogh EJ, Chakrabarti K, Pazzani MJ, 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":"580_CR22","doi-asserted-by":"crossref","unstructured":"Kushilevitz E, Ostrovsky R, Rabani Y (1998) Efficient search for approximate nearest neighbor in high dimensional spaces. In: Proceedings of the 30th annual ACM symposium on theory of computing (STOC), pp 614\u2013623","DOI":"10.1145\/276698.276877"},{"key":"580_CR23","doi-asserted-by":"crossref","unstructured":"Matsubara Y, Sakurai Y (2016) Regime shifts in streams: real-time forecasting of co-evolving time sequences. In: Proceedings of the international conference on knowledge discovery and data mining (SIGKDD), pp 1045\u20131054","DOI":"10.1145\/2939672.2939755"},{"key":"580_CR24","doi-asserted-by":"crossref","unstructured":"Mueen A, Nath S, Liu J (2010) Fast approximate correlation for massive time-series data. In: Proceedings of the international conference on management of data (SIGMOD), pp 171\u2013182","DOI":"10.1145\/1807167.1807188"},{"key":"580_CR25","unstructured":"Mueen A, Zhu Y, Yeh M, Kamgar K, Viswanathan K, Gupta C, Keogh E (2017) The fastest similarity search algorithm for time series subsequences under Euclidean distance. \n                    http:\/\/www.cs.unm.edu\/~mueen\/FastestSimilaritySearch.html\n                    \n                  . Accessed 16 Apr 2018"},{"key":"580_CR26","unstructured":"Papadimitriou S, Sun J, Faloutsos C (2005) Streaming pattern discovery in multiple time-series. In: Proceedings of the international conference on very large databases (VLDB), pp 697\u2013708"},{"key":"580_CR27","doi-asserted-by":"crossref","unstructured":"Papadimitriou S, Yu PS (2006) Optimal multi-scale patterns in time series streams. In: Proceedings of the international conference on management of data (SIGMOD), pp 647\u2013658","DOI":"10.1145\/1142473.1142545"},{"key":"580_CR28","doi-asserted-by":"crossref","unstructured":"Perng C, Wang H, Ma S (2006) Fast relevance discovery in time series. In: Proceedings of the international conference on data mining (ICDM), pp 1016\u20131020","DOI":"10.1109\/ICDM.2006.71"},{"key":"580_CR29","doi-asserted-by":"crossref","unstructured":"Sakurai Y, Faloutsos C, Yamamuro M (2007) Stream monitoring under the time warping distance. In: Proceedings of the international conference on data engineering (ICDE), pp 1046\u20131055","DOI":"10.1109\/ICDE.2007.368963"},{"key":"580_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4046-2","volume-title":"High performance discovery in time series, techniques and case studies","author":"D Shasha","year":"2004","unstructured":"Shasha D, Zhu Y (2004) High performance discovery in time series, techniques and case studies. Springer, Berlin"},{"key":"580_CR31","doi-asserted-by":"crossref","unstructured":"Shieh J, Keogh E (2008) iSAX: Indexing and mining terabyte sized time series. In: Proceedings of the international conference on knowledge discovery and data mining (SIGKDD), pp 623\u2013631","DOI":"10.1145\/1401890.1401966"},{"key":"580_CR32","doi-asserted-by":"crossref","unstructured":"Xie Q, Shang S, Yuan B, Pang C, Zhang X (2013) Local correlation detection with linearity enhancement in streaming data. In: Proceedings of the international conference on information and knowledge management (CIKM), pp 309\u2013318","DOI":"10.1145\/2505515.2505746"},{"key":"580_CR33","doi-asserted-by":"crossref","unstructured":"Yeh CM, Herle HV, Keogh EJ (2016a) Matrix profile III: the matrix profile allows visualization of salient subsequences in massive time series. In: Proceedings of the international conference on data mining (ICDM), pp 579\u2013588","DOI":"10.1109\/ICDM.2016.0069"},{"key":"580_CR34","doi-asserted-by":"crossref","unstructured":"Yeh CM, Zhu Y, Ulanova L, Begum N, Ding Y, Dau HA, Silva DF, Mueen A, Keogh EJ (2016b) Matrix profile I: all pairs similarity joins for time series: a unifying view that includes motifs, discords and shapelets. In: Proceedings of the international conference on data mining (ICDM), pp 1317\u20131322","DOI":"10.1109\/ICDM.2016.0179"},{"key":"580_CR35","unstructured":"Zaharia M, Chowdhury M, Franklin MJ, Shenker S, Stoica I (2010) Spark: cluster computing with working sets. In: Proceedings of the 2nd USENIX conference on hot topics in cloud computing, pp 10\u201310"},{"key":"580_CR36","doi-asserted-by":"crossref","unstructured":"Zhu Y, Zimmerman Z, Senobari NS, Yeh CM, Funning G, Mueen A, Brisk P, Keogh EJ (2016) Matrix profile II: exploiting a novel algorithm and gpus to break the one hundred million barrier for time series motifs and joins. In: Proceedings of the international conference on data mining (ICDM), pp 739\u2013748","DOI":"10.1109\/ICDM.2016.0085"},{"key":"580_CR37","doi-asserted-by":"crossref","unstructured":"Zhu Y, Imamura N, Nikovski DN, Keogh EJ (2017) Matrix profile VII: time series chains: a new primitive for time series data mining. In: Proceedings of the international conference on data mining (ICDM)","DOI":"10.1109\/ICDM.2017.79"},{"key":"580_CR38","doi-asserted-by":"crossref","unstructured":"Zoumpatianos K, Idreos S, Palpanas T (2014) Indexing for interactive exploration of big data series. In: Proceedings of the international conference on management of data (SIGMOD), pp 1555\u20131566","DOI":"10.1145\/2588555.2610498"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-018-0580-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-018-0580-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-018-0580-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T02:46:17Z","timestamp":1569206777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-018-0580-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,7]]},"references-count":38,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["580"],"URL":"https:\/\/doi.org\/10.1007\/s10618-018-0580-z","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2018,8,7]]},"assertion":[{"value":"9 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}