{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:46:28Z","timestamp":1743147988990,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819947515"},{"type":"electronic","value":"9789819947522"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-4752-2_18","type":"book-chapter","created":{"date-parts":[[2023,7,30]],"date-time":"2023-07-30T16:02:10Z","timestamp":1690732930000},"page":"213-225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cluster Equality Validity Index and Efficient Clustering Optimization Strategy"],"prefix":"10.1007","author":[{"given":"Zebin","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingqiang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"KunHong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,31]]},"reference":[{"issue":"8","key":"18_CR1","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.3390\/electronics9081295","volume":"9","author":"M Ahmed","year":"2020","unstructured":"Ahmed, M., Seraj, R., Islam, S.M.S.: The k-means algorithm: a comprehensive survey and performance evaluation. Electronics 9(8), 1295 (2020)","journal-title":"Electronics"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1201\/9781315373515-23","volume-title":"Data Clustering: Algorithms and Applications","author":"H Xiong","year":"2018","unstructured":"Xiong, H., Li, Z.: Clustering Validation Measures. In: Aggarwal, C.C., Reddy, C.K. (eds.) Data Clustering: Algorithms and Applications, pp. 571\u2013606. Chapman and Hall\/CRC (2018)"},{"issue":"3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1111\/coin.12100","volume":"33","author":"A Amelio","year":"2017","unstructured":"Amelio, A., Pizzuti, C.: Correction for closeness: adjusting normalized mutual information measure for clustering comparison. Comput. Intell. 33(3), 579\u2013601 (2017)","journal-title":"Comput. Intell."},{"issue":"336","key":"18_CR4","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand, W.M.: Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66(336), 846\u2013850 (1971)","journal-title":"J. Am. Stat. Assoc."},{"key":"18_CR5","first-page":"2837","volume":"11","author":"NX Vinh","year":"2010","unstructured":"Vinh, N.X., Epps, J., Bailey, J.: Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance. J. Mach. Learn. Res. 11, 2837\u20132854 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"18_CR6","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1109\/TSMC.1987.4309069","volume":"17","author":"TO Kvalseth","year":"1987","unstructured":"Kvalseth, T.O.: Entropy and correlation: some comments. IEEE Trans. Syst. Man Cybern. 17(3), 517\u2013519 (1987)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"1","key":"18_CR7","first-page":"2734","volume":"5","author":"E Rend\u00f3n","year":"2011","unstructured":"Rend\u00f3n, E., Abundez, I., Arizmendi, A., et al.: Internal versus external cluster validity indexes. Int. J. Comput. Commun. 5(1), 2734 (2011)","journal-title":"Int. J. Comput. Commun."},{"issue":"8","key":"18_CR8","doi-asserted-by":"publisher","first-page":"2173","DOI":"10.1109\/TKDE.2016.2551240","volume":"28","author":"M Rezaei","year":"2016","unstructured":"Rezaei, M., Fr\u00e4nti, P.: Set matching measures for external cluster validity. IEEE Trans. Knowl. Data Eng. 28(8), 2173\u20132186 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"18_CR9","first-page":"26","volume":"1","author":"AC Fabregas","year":"2017","unstructured":"Fabregas, A.C., Gerardo, B.D., Tanguilig, B.T., III.: Enhanced initial centroids for k-means algorithm. Int. J. Inf. Technol. Comput. Sci. 1, 26\u201333 (2017)","journal-title":"Int. J. Inf. Technol. Comput. Sci."},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.knosys.2018.01.031","volume":"145","author":"G Zhang","year":"2018","unstructured":"Zhang, G., Zhang, C., Zhang, H.: Improved K-means algorithm based on density Canopy. Knowl.-Based Syst. 145, 289\u2013297 (2018)","journal-title":"Knowl.-Based Syst."},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1007\/978-3-319-91253-0_63","volume-title":"Artificial Intelligence and Soft Computing: 17th International Conference, ICAISC 2018, Zakopane, Poland, June 3-7, 2018, Proceedings, Part I","author":"S Sieranoja","year":"2018","unstructured":"Sieranoja, S., Fr\u00e4nti, P.: Random projection for k-means clustering. In: Rutkowski, L., Scherer, R., Korytkowski, M., Pedrycz, W., Tadeusiewicz, R., Zurada, J.M. (eds.) Artificial Intelligence and Soft Computing: 17th International Conference, ICAISC 2018, Zakopane, Poland, June 3-7, 2018, Proceedings, Part I, pp. 680\u2013689. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91253-0_63"},{"key":"18_CR12","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017)"},{"key":"18_CR13","volume-title":"Dynamic local search algorithm for the clustering problem","author":"I K\u00e4rkk\u00e4inen","year":"2002","unstructured":"K\u00e4rkk\u00e4inen, I., Fr\u00e4nti, P.: Dynamic local search algorithm for the clustering problem. University of Joensuu, Joensuu, Finland (2002)"},{"issue":"5","key":"18_CR14","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/j.patcog.2005.09.012","volume":"39","author":"P Fr\u00e4nti","year":"2006","unstructured":"Fr\u00e4nti, P., Virmajoki, O.: Iterative shrinking method for clustering problems. Pattern Recogn. 39(5), 761\u2013775 (2006)","journal-title":"Pattern Recogn."},{"key":"18_CR15","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: The advantages of careful seeding Stanford (2006)"},{"key":"18_CR16","first-page":"768","volume":"21","author":"EW Forgy","year":"1965","unstructured":"Forgy, E.W.: Cluster analysis of multivariate data: efficiency versus interpretability of classifications. Biometrics 21, 768\u2013769 (1965)","journal-title":"Biometrics"},{"key":"18_CR17","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3462549","author":"MK Gupta","year":"2019","unstructured":"Gupta, M.K., Chandra, P.: P-k-means: k-means using partition based cluster initialization method. SSRN Electron. J. (2019). https:\/\/doi.org\/10.2139\/ssrn.3462549","journal-title":"SSRN Electron. J."},{"issue":"3","key":"18_CR18","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/j.camwa.2009.04.017","volume":"58","author":"F Cao","year":"2009","unstructured":"Cao, F., Liang, J., Jiang, G.: An initialization method for the K-Means algorithm using neighborhood model. Comput. Math. Appl. 58(3), 474\u2013483 (2009)","journal-title":"Comput. Math. Appl."},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/j.patcog.2018.02.015","volume":"79","author":"H Ismkhan","year":"2018","unstructured":"Ismkhan, H.: Ik-means+: an iterative clustering algorithm based on an enhanced version of the k-means. Pattern Recogn. 79, 402\u2013413 (2018)","journal-title":"Pattern Recogn."}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Technology and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-4752-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T23:08:48Z","timestamp":1690931328000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-4752-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819947515","9789819947522"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-4752-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"31 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zhengzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2023a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2023\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}