{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:42Z","timestamp":1740109302015,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T00:00:00Z","timestamp":1548720000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program","doi-asserted-by":"crossref","award":["2016YFE0100300","2016YFB1000700"],"award-info":[{"award-number":["2016YFE0100300","2016YFB1000700"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10115-018-1317-4","type":"journal-article","created":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T07:20:54Z","timestamp":1548746454000},"page":"1517-1546","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Similarity join on time series by utilizing a dynamic segmentation index"],"prefix":"10.1007","volume":"61","author":[{"given":"Jinhua","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3575-960X","authenticated-orcid":false,"given":"Qiuhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongsheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ningting","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingmin","family":"Chi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,29]]},"reference":[{"key":"1317_CR1","unstructured":"Camerra A, Palpanas T, Shieh J, Keogh EJ (2010) isax 2.0: indexing and mining one billion time series. In: ICDM, pp 58\u201367"},{"key":"1317_CR2","unstructured":"Keogh E, Pazzani M (1998) An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback. In: SIGKDD"},{"key":"1317_CR3","doi-asserted-by":"crossref","unstructured":"Steinbach M, Tan P, Kumar V, Klooster S, Potter C (2003) Discovery of climate indices using clustering. In: SIGKDD","DOI":"10.1145\/956750.956801"},{"key":"1317_CR4","doi-asserted-by":"crossref","unstructured":"Andoni A, Indyk P (2006) Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: FOCS, pp 459\u2013468","DOI":"10.1109\/FOCS.2006.49"},{"key":"1317_CR5","unstructured":"Agrawal R, Psaila G, Wimmers EL, Za\u00eft M (1995) Querying shapes of histories. In: VLDB\u201995, proceedings of 21th international conference on very large data bases, September 11\u201315, 1995, Zurich, Switzerland, pp 502\u2013514"},{"key":"1317_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-60159-7_4","volume-title":"Advances in Spatial Databases","author":"Krzysztof Koperski","year":"1995","unstructured":"Koperski K, Han J (1995) Discovery of spatial association rules in geographic information databases. In: Advances in spatial databases, 4th international symposium, SSD\u201995, Portland, Maine, USA, August 6\u20139, 1995, proceedings, pp 47\u201366"},{"key":"1317_CR7","doi-asserted-by":"crossref","unstructured":"Xiao C, Wang W, Lin X, Yu JX (2008) Efficient similarity joins for near duplicate detection. In: Proceedings of the 17th international conference on World Wide Web, WWW 2008, Beijing, China, April 21\u201325, 2008, pp 131\u2013140","DOI":"10.1145\/1367497.1367516"},{"key":"1317_CR8","doi-asserted-by":"crossref","unstructured":"Kolb L, Thor A, Rahm E (2012) Load balancing for mapreduce-based entity resolution. In: IEEE 28th international conference on data engineering (ICDE 2012), Washington, DC, USA (Arlington, Virginia), 1\u20135 April, 2012, pp 618\u2013629","DOI":"10.1109\/ICDE.2012.22"},{"key":"1317_CR9","doi-asserted-by":"crossref","unstructured":"Chaudhuri S, Ganti V, Kaushik R (2006) A primitive operator for similarity joins in data cleaning. In: Proceedings of the 22nd international conference on data engineering, ICDE 2006, 3\u20138 April 2006, Atlanta, GA, USA, p 5","DOI":"10.1109\/ICDE.2006.9"},{"key":"1317_CR10","unstructured":"Kanth K, Agrawal D, Singh A (1998) Dimensionality reduction for similarity searching in dynamic databases. In: SIGMOD"},{"key":"1317_CR11","doi-asserted-by":"crossref","unstructured":"Agrawal R, Faloutsos C, Swami AN (1993) Efficient similarity search in sequence databases. In: FODO","DOI":"10.1007\/3-540-57301-1_5"},{"key":"1317_CR12","unstructured":"Chan K, Fu A (1999) Efficient time series matching by wavelets. In: ICDE"},{"key":"1317_CR13","unstructured":"Yi B-K, Faloutsos C (2000) Fast time sequence indexing for arbitrary Lp norms. In: VLDB 2000, proceedings of 26th international conference on very large data bases, September 10\u201314, 2000, Cairo, Egypt, pp 385\u2013394"},{"key":"1317_CR14","doi-asserted-by":"crossref","unstructured":"Keogh EJ, Chakrabarti K, Mehrotra S, Pazzani MJ (2001) Locally adaptive dimensionality reduction for indexing large time series databases. In: Proceedings of the 2001 ACM SIGMOD international conference on Management of data, Santa Barbara, CA, USA, May 21\u201324, 2001, pp 151\u2013162","DOI":"10.1145\/375663.375680"},{"issue":"10","key":"1317_CR15","first-page":"793","volume":"6","author":"Y Wang","year":"2013","unstructured":"Wang Y, Wang P, Pei J, Wang W, Huang S (2013) A data-adaptive and dynamic segmentation index for whole matching on time series. PVLDB 6(10):793\u2013804","journal-title":"PVLDB"},{"key":"1317_CR16","unstructured":"Sarma AD, He Y, Chaudhuri S (2014) Clusterjoin: a similarity joins framework using map-reduce. In: PVLDB"},{"issue":"2","key":"1317_CR17","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/357775.357776","volume":"25","author":"C B\u00f6hm","year":"2000","unstructured":"B\u00f6hm C (2000) A cost model for query processing in high dimensional data spaces. ACM Trans Database Syst 25(2):129\u2013178","journal-title":"ACM Trans Database Syst"},{"key":"1317_CR18","doi-asserted-by":"crossref","unstructured":"Nobari S, Tauheed F, Heinis T, Karras P, Bressan S, Ailamaki A (2013) TOUCH: in-memory spatial join by hierarchical data-oriented partitioning. In: Proceedings of the ACM SIGMOD international conference on management of data, SIGMOD 2013, New York, NY, USA, June 22\u201327, 2013, pp 701\u2013712","DOI":"10.1145\/2463676.2463700"},{"key":"1317_CR19","doi-asserted-by":"crossref","unstructured":"Mueen A, Nath S, Liu J (2010) Fast approximate correlation for massive time-series data. In: Proceedings of the ACM SIGMOD international conference on management of data, SIGMOD 2010, Indianapolis, Indiana, USA, June 6\u201310, 2010, pp 171\u2013182","DOI":"10.1145\/1807167.1807188"},{"key":"1317_CR20","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan BW, Shen L (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49:291\u2013307","journal-title":"Bell Syst Tech J"},{"issue":"1","key":"1317_CR21","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/331605.331608","volume":"47","author":"David R. Karger","year":"2000","unstructured":"Karger DR (2000) Minimum cuts in near-linear time. J ACM 47:46\u201376","journal-title":"Journal of the ACM"},{"key":"1317_CR22","unstructured":"Fiduccia CM, Mattheyses RM (1982) A linear-time heuristic for improving network partitions. In: Proceedings of the 19th design automation conference, DAC \u201982, Las Vegas, Nevada, USA, June 14\u201316, 1982, pp 175\u2013181"},{"key":"1317_CR23","unstructured":"http:\/\/www.pmel.noaa.gov\/tao\/data_deliv\/\n                    \n                  . Accessed 6 Apr 2017"},{"key":"1317_CR24","unstructured":"http:\/\/archive.ics.uci.edu\/ml\/datasets\/\n                    \n                  . Accessed 6 Apr 2017"},{"key":"1317_CR25","unstructured":"Shim K, Srikant R, Agrawal R (1997) High-dimensional similarity joins. In: Proceedings of the thirteenth international conference on data engineering, April 7\u201311, 1997 Birmingham UK, pp 301\u2013311"},{"key":"1317_CR26","doi-asserted-by":"crossref","unstructured":"B\u00f6hm C, Braunm\u00fcller B, Krebs F, Kriegel H-P (2001) Epsilon grid order: an algorithm for the similarity join on massive high-dimensional data. In: Proceedings of the 2001 ACM SIGMOD international conference on management of data, Santa Barbara, CA, USA, May 21\u201324, 2001, pp 379\u2013388","DOI":"10.1145\/375663.375714"},{"key":"1317_CR27","doi-asserted-by":"crossref","unstructured":"Wang Y, Metwally A, Parthasarathy S (2013) Scalable all-pairs similarity search in metric spaces. In: The 19th ACM SIGKDD international conference on knowledge discovery and data mining, KDD 2013, Chicago, IL, USA, August 11\u201314, 2013, pp 829\u2013837","DOI":"10.1145\/2487575.2487625"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-018-1317-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-018-1317-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-018-1317-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T19:14:31Z","timestamp":1580238871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-018-1317-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,29]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["1317"],"URL":"https:\/\/doi.org\/10.1007\/s10115-018-1317-4","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2019,1,29]]},"assertion":[{"value":"23 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}