{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T12:25:24Z","timestamp":1764332724559,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,27]],"date-time":"2018-10-27T00:00:00Z","timestamp":1540598400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100011002","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["60573065, 60903176"],"award-info":[{"award-number":["60573065, 60903176"]}],"id":[{"id":"10.13039\/501100011002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2017BF016"],"award-info":[{"award-number":["ZR2017BF016"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012905","name":"Department of Science and Technology of Shandong Province","doi-asserted-by":"publisher","award":["2014GGX101039"],"award-info":[{"award-number":["2014GGX101039"]}],"id":[{"id":"10.13039\/100012905","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,10,27]]},"DOI":"10.1145\/3291801.3291825","type":"proceedings-article","created":{"date-parts":[[2019,1,14]],"date-time":"2019-01-14T13:15:25Z","timestamp":1547471725000},"page":"100-106","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A Clustering Algorithm for Automatically Determining the Number of Clusters Based on Coefficient of Variation"],"prefix":"10.1145","author":[{"given":"Tengteng","family":"Liu","sequence":"first","affiliation":[{"name":"School of Information Science and Engineering, University of Jinan, Jinan, China"}]},{"given":"Shouning","family":"Qu","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, University of Jinan, Shandong Provincial Key Laboratory of Network Based Intelligent Computing, Jinan, China"}]},{"given":"Kun","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, University of Jinan, Jinan, China"}]}],"member":"320","published-online":{"date-parts":[[2018,10,27]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"289","article-title":"Locality sensitive k-means clustering","volume":"34","author":"Liu Chien-Liang","year":"2018","unstructured":"Chien-Liang Liu , Wen-Hoar Hsaio , and Tao-Hsing Chang . 2018 . Locality sensitive k-means clustering . J. Inf. Sci. Eng. 34 , 1 (2018), 289 -- 305 . Chien-Liang Liu, Wen-Hoar Hsaio, and Tao-Hsing Chang. 2018. Locality sensitive k-means clustering. J. Inf. Sci. Eng. 34, 1 (2018), 289--305.","journal-title":"J. Inf. Sci. Eng."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.08.032"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.02.072"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.20532\/cit.2017.1003605"},{"key":"e_1_3_2_1_5_1","volume-title":"An effective and efficient hierarchical k-means clustering algorithm. IJDSN. 13, 8","author":"Qi Jian-Peng","year":"2017","unstructured":"Jian-Peng Qi , Yan-Wei Yu , Li-Hong Wang , Jing-Lei Liu , and Ying-Jie Wang . 2017. An effective and efficient hierarchical k-means clustering algorithm. IJDSN. 13, 8 ( 2017 ). Jian-Peng Qi, Yan-Wei Yu, Li-Hong Wang, Jing-Lei Liu, and Ying-Jie Wang. 2017. An effective and efficient hierarchical k-means clustering algorithm. IJDSN. 13, 8 (2017)."},{"key":"e_1_3_2_1_6_1","unstructured":"David Arthur and Sergei Vassilvitskii. 2007. K-means++: the advantages of careful seeding. SODA 1027--1035.   David Arthur and Sergei Vassilvitskii. 2007. K-means++: the advantages of careful seeding. SODA 1027--1035."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/01969727408546059"},{"key":"e_1_3_2_1_8_1","volume-title":"John Wiley and Sons","author":"Hart R.O.","year":"1973","unstructured":"Duda, R.O. and P.E. Hart . 1973. Pattern classification and scene analysis. A Wiley Interscience Publication , John Wiley and Sons , Inc , 1973 . Duda, R.O. and P.E. Hart. 1973. Pattern classification and scene analysis. A Wiley Interscience Publication, John Wiley and Sons, Inc, 1973."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"e_1_3_2_1_10_1","first-page":"573","article-title":"Optimization study on k value of spatial clustering","volume":"03","author":"Li Yong-Sen","year":"2006","unstructured":"Yong-Sen Li , Shan-Lin Yang , Xi-Jun Ma , 2006 . Optimization study on k value of spatial clustering . Journal of System Simulation. 03 (2006), 573 -- 576 . Yong-Sen Li, Shan-Lin Yang, Xi-Jun Ma, et al. 2006. Optimization study on k value of spatial clustering. Journal of System Simulation. 03 (2006), 573--576.","journal-title":"Journal of System Simulation."},{"key":"e_1_3_2_1_11_1","first-page":"77","article-title":"Research on the number of clusters in k-means algorithm","volume":"25","author":"Han Ling-Bo","year":"2012","unstructured":"Ling-Bo Han . 2012 . Research on the number of clusters in k-means algorithm . Journal of Sichuan University of Science & Engineering(Natural Science Edition). 25 , 02 (2012), 77 -- 80 . Ling-Bo Han. 2012. Research on the number of clusters in k-means algorithm. Journal of Sichuan University of Science & Engineering(Natural Science Edition). 25, 02 (2012), 77--80.","journal-title":"Journal of Sichuan University of Science & Engineering(Natural Science Edition)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.17706\/jcp.13.6.588-595"},{"key":"e_1_3_2_1_13_1","first-page":"41","article-title":"A dynamic clustering algorithm of k-means based on multi-branches tree for k-values","volume":"27","author":"Bao Li-Ming","year":"2017","unstructured":"Li-Ming Bao and Gang Huang . 2017 . A dynamic clustering algorithm of k-means based on multi-branches tree for k-values . Computer Technology and Development. 27 , 06 (2017), 41 -- 45 +50. Li-Ming Bao and Gang Huang. 2017. A dynamic clustering algorithm of k-means based on multi-branches tree for k-values. Computer Technology and Development. 27, 06 (2017), 41--45+50.","journal-title":"Computer Technology and Development."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Chayan Bala Tripti Basu and Abhijit Dasgupta. 2015. Automatic detection of k with suitable seed values for classic k-means algorithm using DE. ICACCI 759--765.  Chayan Bala Tripti Basu and Abhijit Dasgupta. 2015. Automatic detection of k with suitable seed values for classic k-means algorithm using DE. ICACCI 759--765.","DOI":"10.1109\/ICACCI.2015.7275702"},{"key":"e_1_3_2_1_15_1","volume-title":"Maeder","author":"Mehar Arshad Muhammad","year":"2013","unstructured":"Arshad Muhammad Mehar , Kenan M. Matawie , and Anthony J . Maeder . 2013 . Determining an optimal value of K in k-means clustering. BIBM , 51--55. Arshad Muhammad Mehar, Kenan M. Matawie, and Anthony J. Maeder. 2013. Determining an optimal value of K in k-means clustering. BIBM, 51--55."}],"event":{"name":"ICBDR 2018: 2018 The 2nd International Conference on Big Data Research","sponsor":["Shandong Univ. Shandong University","University of Queensland University of Queensland","Dalian Maritime University"],"location":"Weihai China","acronym":"ICBDR 2018"},"container-title":["Proceedings of the 2nd International Conference on Big Data Research"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3291801.3291825","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3291801.3291825","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:06Z","timestamp":1750208526000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3291801.3291825"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,27]]},"references-count":15,"alternative-id":["10.1145\/3291801.3291825","10.1145\/3291801"],"URL":"https:\/\/doi.org\/10.1145\/3291801.3291825","relation":{},"subject":[],"published":{"date-parts":[[2018,10,27]]},"assertion":[{"value":"2018-10-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}