{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:03:44Z","timestamp":1725829424164},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319243689"},{"type":"electronic","value":"9783319243696"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24369-6_13","type":"book-chapter","created":{"date-parts":[[2015,9,10]],"date-time":"2015-09-10T18:46:37Z","timestamp":1441910797000},"page":"154-165","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Self Organizing Maps with Delay Actualization"],"prefix":"10.1007","author":[{"given":"Luk\u00e1\u0161","family":"Voj\u00e1\u010dek","sequence":"first","affiliation":[]},{"given":"Pavla","family":"Dr\u00e1\u017edilov\u00e1","sequence":"additional","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Dvorsk\u00fd","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,30]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-49257-7_15","volume-title":"Database Theory - ICDT\u201999","author":"K Beyer","year":"1998","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is \u201cnearest neighbor\u201d meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 217\u2013235. Springer, Heidelberg (1998)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Gropp, W., Lusk, E., Skjellum, A.: Using MPI: portable parallel programming with the message-passing inferace. MIT Press (1999)","DOI":"10.7551\/mitpress\/7056.001.0001"},{"key":"13_CR3","series-title":"Springer Series in Information Sciences","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-88163-3","volume-title":"Self-Organization and Associative Memory","author":"T Kohonen","year":"1989","unstructured":"Kohonen, T.: Self-Organization and Associative Memory. Springer Series in Information Sciences, vol. 8, 3rd edn. Springer, Heidelberg (1989)","edition":"3"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Kohonen, T.: Self Organizing Maps, 3rd edn. Springer-Verlag (2001)","DOI":"10.1007\/978-3-642-56927-2"},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1009817804059","volume":"3","author":"R Lawrence","year":"1999","unstructured":"Lawrence, R., Almasi, G., Rushmeier, H.: A scalable parallel algorithm for self-organizing maps with applications to sparse data mining problems. Data Mining and Knowledge Discovery 3(2), 171\u2013195 (1999)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.14311\/NNW.2013.23.010","volume":"23","author":"J Martinovi\u010d","year":"2013","unstructured":"Martinovi\u010d, J., Slaninov\u00e1, K., Voj\u00e1\u010dek, L., Dra\u017edilov\u00e1, P., Dvorsk\u00fd, J., Vondr\u00e1k, I.: Effective Clustering Algorithm for High-Dimensional Sparse Data based on SOM. Neural Network World 23(2), 131\u2013147 (2013)","journal-title":"Neural Network World"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Slaninov\u00e1, K., Martinovi\u010d, J., Novos\u00e1d, T., Dr\u00e1\u017edilov\u00e1, P., Voj\u00e1\u010dek, L., Sn\u00e1\u0161el, V.: Web site community analysis based on suffix tree and clustering algorithm. In: Proceedings - 2011 IEEE\/WIC\/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2011, pp. 110\u2013113 (2011)","DOI":"10.1109\/WI-IAT.2011.85"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Voj\u00e1\u010dek, L., Dvorsk\u00fd, J., Slaninov\u00e1, K., Martinovi\u010d, J.: Scalable parallel som learning for web user profiles. In: International Conference on Intelligent Systems Design and Applications, ISDA, pp. 283\u2013288 (2014)","DOI":"10.1109\/ISDA.2013.6920750"},{"issue":"6\u20137","key":"13_CR9","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/S0167-8191(05)80069-9","volume":"17","author":"CH Wu","year":"1991","unstructured":"Wu, C.H., Hodges, R.E., Wang, C.J.: Parallelizing the self-organizing feature map on multiprocessor systems. Parallel Computing 17(6\u20137), 821\u2013832 (1991)","journal-title":"Parallel Computing"}],"container-title":["Lecture Notes in Computer Science","Computer Information Systems and Industrial Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24369-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T20:06:01Z","timestamp":1568664361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24369-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319243689","9783319243696"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24369-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"30 October 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}