{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:56:16Z","timestamp":1725861376940},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319425528"},{"type":"electronic","value":"9783319425535"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42553-5_1","type":"book-chapter","created":{"date-parts":[[2016,7,18]],"date-time":"2016-07-18T07:42:23Z","timestamp":1468827743000},"page":"3-12","source":"Crossref","is-referenced-by-count":0,"title":["Similarity Search Algorithm over Data Supply Chain Based on Key Points"],"prefix":"10.1007","author":[{"given":"Peng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin-Ming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,19]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/MIC.2013.41","volume":"17","author":"P Groth","year":"2013","unstructured":"Groth, P.: Transparency and reliability in the data supply chain. IEEE Internet Comput. 17(2), 69\u201371 (2013)","journal-title":"IEEE Internet Comput."},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.asoc.2014.11.040","volume":"28","author":"C Ozturk","year":"2015","unstructured":"Ozturk, C., Hancer, E., Karaboga, D.: Dynamic clustering with improved binary artificial bee colony algorithm. Appl. Soft Comput. 28, 69\u201380 (2015)","journal-title":"Appl. Soft Comput."},{"key":"1_CR3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.ins.2012.08.023","volume":"222","author":"A Hatamlou","year":"2013","unstructured":"Hatamlou, A.: Black hole: a new heuristic optimization approach for data clustering. Inf. Sci. 222, 175\u2013184 (2013)","journal-title":"Inf. Sci."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Iwashita, T., Hochin, T., Nomiya, H.: Optimal number of clusters for fast similarity search of time series considering transformations. In: 2014 IIAI 3rd International Conference on Advanced Applied Informatics (IIAIAAI), pp. 711\u2013717. IEEE (2014)","DOI":"10.1109\/IIAI-AAI.2014.146"},{"issue":"3","key":"1_CR5","doi-asserted-by":"crossref","first-page":"2741","DOI":"10.3390\/ijerph110302741","volume":"11","author":"S Ghassempour","year":"2014","unstructured":"Ghassempour, S., Girosi, F., Maeder, A.: Clustering multivariate time series using hidden Markov models. Int. J. Environ. Res. Public Health 11(3), 2741\u20132763 (2014)","journal-title":"Int. J. Environ. Res. Public Health"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-3-642-40820-5_21","volume-title":"Network and Parallel Computing","author":"Y-S Huang","year":"2013","unstructured":"Huang, Y.-S., Yu, K.-M., Zhou, L.-W., Hsu, C.-H., Liu, S.-H.: Accelerating parallel frequent itemset mining on graphics processors with sorting. In: Hsu, C.-H., Li, X., Shi, X., Zheng, R. (eds.) NPC 2013. LNCS, vol. 8147, pp. 245\u2013256. Springer, Heidelberg (2013)"},{"key":"1_CR7","unstructured":"Wikimeta (2013). http:\/\/wikimeta.com\/"},{"key":"1_CR8","unstructured":"OpenCalais (2013). http:\/\/www.opencalais.com\/"},{"key":"1_CR9","unstructured":"Pingar (2013). http:\/\/www.pingar.com\/"},{"key":"1_CR10","unstructured":"AlchemyAPI (2013). http:\/\/www.alchemyapi.com\/"},{"key":"1_CR11","unstructured":"Semantria (2013). http:\/\/semantria.com\/"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Backurs, A., Indyk, P.: Edit distance cannot be computed in strongly subquadratic time (unless SETH is false). In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, pp. 51\u201358. ACM (2015)","DOI":"10.1145\/2746539.2746612"},{"issue":"11","key":"1_CR13","doi-asserted-by":"crossref","first-page":"1609","DOI":"10.1109\/TKDE.2009.201","volume":"22","author":"W Lang","year":"2010","unstructured":"Lang, W., Morse, M., Patel, J.M.: Dictionary-based compression for long time-series similarity. IEEE Trans. Knowl. Data Eng. 22(11), 1609\u20131622 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Lecture Notes in Computer Science","Big Data Computing and Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42553-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:38:38Z","timestamp":1498315118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42553-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319425528","9783319425535"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42553-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}