{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T09:13:17Z","timestamp":1725613997719},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642238802"},{"type":"electronic","value":"9783642238819"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23881-9_58","type":"book-chapter","created":{"date-parts":[[2011,9,24]],"date-time":"2011-09-24T04:51:47Z","timestamp":1316839907000},"page":"444-449","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Sequential Clustering Algorithm"],"prefix":"10.1007","author":[{"given":"Yingxia","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingming","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"58_CR1","doi-asserted-by":"crossref","unstructured":"Jain, A.K.: Data Clustering: 50 Years beyond K-Means. Pattern Recognition Letters (2009)","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"58_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences","author":"D. Gesfield","year":"1997","unstructured":"Gesfield, D.: Algorithms on strings, trees, and sequences. Cambridge University Press, Cambridge (1997)"},{"key":"58_CR3","unstructured":"Kahveci, T., Singh, A.K.: An efficient index structure for string databases. In: Proc.Of the 27th Int\u2019l Conf. On Vear Large Data Bases, VLDB, pp. 351\u2013360 (2001)"},{"key":"58_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"1","author":"E. Ukkonen","year":"1992","unstructured":"Ukkonen, E.: Approximate string matching with q-gram and maximal matching. Theory Computer Science\u00a01, 191\u2013211 (1992)","journal-title":"Theory Computer Science"},{"key":"58_CR5","unstructured":"Steinbach, M., Karypis, G., Kumar, V. : A Comparison of Document Clustering Techniques. In: KDD Workshop on Text Mining (2000)"},{"key":"58_CR6","unstructured":"Dai, D.-B., Tang, S.-L., Xiong, Y.: Research on sequence data similarity query. PhD thesis. Fudan University (2009)"},{"key":"58_CR7","doi-asserted-by":"crossref","unstructured":"Dai, D.-B., Tang, S.-L., Xiong, Y.: Clustering Algorithms Based on Global and Local Similarity. Journal of Software Sequence \u00a021(4) (2010)","DOI":"10.3724\/SP.J.1001.2010.03609"},{"issue":"11","key":"58_CR8","doi-asserted-by":"publisher","first-page":"2557","DOI":"10.1016\/j.patcog.2009.03.011","volume":"42","author":"R. Kashef","year":"2009","unstructured":"Kashef, R., Kamel, M.S.: Enhanced bisecting k-means clustering using intermediate cooperation. Pattern Recognition\u00a042(11), 2557\u20132569 (2009)","journal-title":"Pattern Recognition"},{"key":"58_CR9","unstructured":"Datasets: http:\/\/fimi.ua.ac.be\/data\/"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23881-9_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T09:46:27Z","timestamp":1560678387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23881-9_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642238802","9783642238819"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23881-9_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}