{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:34Z","timestamp":1740099094947,"version":"3.37.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319993829"},{"type":"electronic","value":"9783319993836"}],"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-99383-6_29","type":"book-chapter","created":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T20:34:37Z","timestamp":1534970077000},"page":"234-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["E2CM: An Evolutionary Version of Evidential C-Means Clustering Algorithm"],"prefix":"10.1007","author":[{"given":"Zhi-gang","family":"Su","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong-yu","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pei-hong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,23]]},"reference":[{"issue":"4","key":"29_CR1","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1016\/j.csda.2010.09.021","volume":"56","author":"V Antoine","year":"2012","unstructured":"Antoine, V., Quost, B., Masson, M.-H., Denoeux, T.: CECM: constrained evidential C-Means algorithm. Comput. Stat. Data Anal. 56(4), 894\u2013914 (2012)","journal-title":"Comput. Stat. Data Anal."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Denoeux, T., Kanjanatarakul, O.: Evidential clustering: a review. In: 5th International Symposium on Integrated Uncertainty in Knowledge Modelling and Decision Making (IUKM), Da Nang, 2 December 2016, pp. 24\u201335 (2016)","DOI":"10.1007\/978-3-319-49046-5_3"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.knosys.2015.08.007","volume":"88","author":"T Denoeux","year":"2015","unstructured":"Denoeux, T., Kanjanatarakul, O., Sriboonchitta, S.: EK-NNclus: a clustering procedure based on the evidential K-nearest neighbor rule. Knowl. Based Syst. 88, 57\u201369 (2015)","journal-title":"Knowl. Based Syst."},{"issue":"5","key":"29_CR4","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/21.376493","volume":"25","author":"T Denoeux","year":"1995","unstructured":"Denoeux, T.: A k-nearest neighbor classification rule based on Dempster-Shafer theory. IEEE Trans. Syst. Man Cybern. 25(5), 804\u2013813 (1995)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1109\/TSMCB.2002.806496","volume":"34","author":"T Denoeux","year":"2004","unstructured":"Denoeux, T., Masson, M.-H.: EVCLUS: evidential clustering of proximity data. IEEE Trans. Syst. Man Cybern. Part B 34, 95\u2013109 (2004)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"issue":"1","key":"29_CR6","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga, D., Basturk, B.: On the performance of Artificial Bee Colony (ABC) algorithm. Appl. Soft Comput. 8(1), 687\u2013697 (2008)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"29_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.patrec.2011.10.011","volume":"33","author":"Z-G Liu","year":"2012","unstructured":"Liu, Z.-G., Dezert, J., Mercier, G., Pan, Q.: Belief C-Means: an extension of fuzzy C-Means algorithm in belief functions framework. Pattern Recogn. Lett. 33(3), 291\u2013300 (2012)","journal-title":"Pattern Recogn. Lett."},{"issue":"1","key":"29_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.knosys.2014.11.013","volume":"74","author":"Z-G Liu","year":"2015","unstructured":"Liu, Z.-G., Pan, Q., Dezert, J., Mercier, G.: Credal C-Means clustering method based on belief functions. Knowl. Based Syst. 74(1), 119\u2013132 (2015)","journal-title":"Knowl. Based Syst."},{"issue":"4","key":"29_CR9","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1016\/j.patcog.2007.08.014","volume":"41","author":"M-H Masson","year":"2008","unstructured":"Masson, M.-H., Denoeux, T.: ECM: an evidential version of the fuzzy C-Means algorithm. Pattern Recogn. 41(4), 1384\u20131397 (2008)","journal-title":"Pattern Recogn."},{"issue":"11","key":"29_CR10","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1016\/j.patrec.2009.04.008","volume":"30","author":"M-H Masson","year":"2009","unstructured":"Masson, M.-H., Denoeux, T.: RECM: relational evidential C-Means algorithm. Pattern Recogn. Lett. 30(11), 1015\u20131026 (2009)","journal-title":"Pattern Recogn. Lett."},{"key":"29_CR11","doi-asserted-by":"crossref","DOI":"10.1515\/9780691214696","volume-title":"A Mathematical Theory of Evidence","author":"G Shafer","year":"1976","unstructured":"Shafer, G.: A Mathematical Theory of Evidence. Princeton University Press, Princeton (1976)"},{"issue":"11","key":"29_CR12","doi-asserted-by":"publisher","first-page":"3421","DOI":"10.1016\/j.asoc.2012.06.019","volume":"12","author":"Z-G Su","year":"2012","unstructured":"Su, Z.-G., Wang, P.-H., Shen, J.: Automatic fuzzy partition approach using Variable string length Artificial Bee Colony (VABC) algorithm. Appl. Soft Comput. 12(11), 3421\u20133441 (2012)","journal-title":"Appl. Soft Comput."}],"container-title":["Lecture Notes in Computer Science","Belief Functions: Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99383-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T01:04:54Z","timestamp":1661821494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99383-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319993829","9783319993836"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99383-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}