{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T05:33:20Z","timestamp":1725946400385},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319745206"},{"type":"electronic","value":"9783319745213"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-74521-3_1","type":"book-chapter","created":{"date-parts":[[2018,1,21]],"date-time":"2018-01-21T21:54:37Z","timestamp":1516571677000},"page":"1-12","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Improved MST Clustering Algorithm Based on Membrane Computing"],"prefix":"10.1007","author":[{"given":"Ping","family":"Gong","sequence":"first","affiliation":[]},{"given":"Xiyu","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,23]]},"reference":[{"key":"1_CR1","unstructured":"Han, J., Pei, J., Kamber, M.: Data Mining: Concepts and Techniques. Elsevier (2011)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Fredman, M., Willard, D.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. In: Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pp. 719\u2013725 (1990)","DOI":"10.1109\/FSCS.1990.89594"},{"key":"1_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2014.10.012","volume":"295","author":"C Zhong","year":"2015","unstructured":"Zhong, C., Malinen, M., Miao, D., et al.: A fast minimum spanning tree algorithm based on k-means. Inf. Sci. 295, 1\u201317 (2015)","journal-title":"Inf. Sci."},{"issue":"3","key":"1_CR4","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1016\/j.patcog.2009.07.010","volume":"43","author":"C Zhong","year":"2010","unstructured":"Zhong, C., Miao, D., Wang, R.: A graph-theoretical clustering method based on two rounds of minimum spanning trees. Pattern Recogn. 43(3), 752\u2013766 (2010)","journal-title":"Pattern Recogn."},{"issue":"1","key":"1_CR5","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"G P\u0103un","year":"2000","unstructured":"P\u0103un, G.: Computing with membranes. J. Comput. Syst. Sci. 61(1), 108\u2013143 (2000)","journal-title":"J. Comput. Syst. Sci."},{"issue":"7","key":"1_CR6","doi-asserted-by":"crossref","first-page":"1425","DOI":"10.1007\/s00500-013-1155-y","volume":"18","author":"J Xue","year":"2014","unstructured":"Xue, J., Liu, X.: Lattice based communication P systems with applications in cluster analysis. Soft. Comput. 18(7), 1425\u20131440 (2014)","journal-title":"Soft. Comput."},{"key":"1_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-11467-0","volume-title":"The Oxford Handbook of Membrane Computing","author":"G Paun","year":"2010","unstructured":"Paun, G., Rozenberg, G., Salomaa, A.: The Oxford Handbook of Membrane Computing. Oxford University Press Inc., New York (2010)"},{"issue":"1","key":"1_CR8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.jcss.2006.10.001","volume":"73","author":"P Sos\u00edk","year":"2007","unstructured":"Sos\u00edk, P., Rodr\u00edguez-Pat\u00f3n, A.: Membrane computing and complexity theory: A characterization of PSPACE. J. Comput. Syst. Sci. 73(1), 137\u2013152 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"208","DOI":"10.3724\/SP.J.1016.2010.00208","volume":"33","author":"GX Zhang","year":"2010","unstructured":"Zhang, G.X., Pan, L.Q.: A survey of membrane computing as a new branch of natural computing. Chin. J. Comput. 33, 208\u2013214 (2010)","journal-title":"Chin. J. Comput."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Grygorash, O., Zhou, Y., Jorgensen, Z.: Minimum spanning tree based clustering algorithms. In: 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2006), pp. 73\u201381. IEEE (2006)","DOI":"10.1109\/ICTAI.2006.83"}],"container-title":["Lecture Notes in Computer Science","Human Centered Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74521-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,21]],"date-time":"2018-01-21T21:54:53Z","timestamp":1516571693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-74521-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319745206","9783319745213"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74521-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}