{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T23:17:00Z","timestamp":1762039020585,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,2,26]],"date-time":"2021-02-26T00:00:00Z","timestamp":1614297600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the Natural Science Foundation of Beijing","award":["No. L192027"],"award-info":[{"award-number":["No. L192027"]}]},{"name":"the National Key Research and Development Program","award":["No.2018YFB1004401"],"award-info":[{"award-number":["No.2018YFB1004401"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,2,26]]},"DOI":"10.1145\/3457682.3457695","type":"proceedings-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T21:53:38Z","timestamp":1624312418000},"page":"86-92","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["An Improved K-means Algorithm Based on Multiple Clustering and Density"],"prefix":"10.1145","author":[{"given":"Yulong","family":"Ling","sequence":"first","affiliation":[{"name":"Northwestern Polytechnical University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Northwestern Polytechnical University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3383972.3384019"},{"issue":"02","key":"e_1_3_2_1_3_1","first-page":"42","article-title":"Congestion control method based on K-means clustering in VANET[J]. Computer Engineering and Design, 2020, v.41;","volume":"398","author":"Li Guoqin","unstructured":"Guoqin Li , Youwei Sun , Yongping Chai . Congestion control method based on K-means clustering in VANET[J]. Computer Engineering and Design, 2020, v.41; No . 398 ( 02 ): 42 - 46 . Guoqin Li,Youwei Sun,Yongping Chai. Congestion control method based on K-means clustering in VANET[J]. Computer Engineering and Design, 2020, v.41;No.398(02):42-46.","journal-title":"No"},{"key":"e_1_3_2_1_4_1","first-page":"9007","volume-title":"Wuhan","author":"S. Lu","year":"2018","unstructured":"S. Lu , \" Clustering Method of Raw Meal Composition Based on PCA and k-means,\" 2018 37th Chinese Control Conference (CCC) , Wuhan , 2018 , pp. 9007 - 9010 , doi: 10.23919\/ChiCC.2018.8482823. S. Lu , \"Clustering Method of Raw Meal Composition Based on PCA and k-means,\" 2018 37th Chinese Control Conference (CCC), Wuhan, 2018, pp. 9007-9010, doi: 10.23919\/ChiCC.2018.8482823."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5120\/14433-2579"},{"key":"e_1_3_2_1_6_1","first-page":"11897","article-title":"Clustering Approach Based on Mini Batch k-means for Intrusion Detection System over Big Data[J]","volume":"2018","author":"Peng K","unstructured":"Peng K , Leung V C M , Huang Q . Clustering Approach Based on Mini Batch k-means for Intrusion Detection System over Big Data[J] . IEEE Access , 2018 : 11897 - 11906 . Peng K , Leung V C M , Huang Q . Clustering Approach Based on Mini Batch k-means for Intrusion Detection System over Big Data[J]. IEEE Access, 2018:11897-11906.","journal-title":"IEEE Access"},{"key":"e_1_3_2_1_7_1","first-page":"1","article-title":"A fast minimum spanning tree algorithm based on K-means[J]","volume":"295","author":"Zhong C","year":"2015","unstructured":"Zhong C , Malinen M , Miao D , A fast minimum spanning tree algorithm based on K-means[J] . Information ences , 2015 , 295 : 1 - 17 . Zhong C , Malinen M , Miao D , A fast minimum spanning tree algorithm based on K-means[J]. Information ences, 2015, 295:1-17.","journal-title":"Information ences"},{"key":"e_1_3_2_1_8_1","volume-title":"Random Projection for k-means Clustering[C]\/\/ International Conference on Artificial Intelligence & Soft Computing","author":"Sieranoja Sami","year":"2018","unstructured":"Sami Sieranoja , Pasi Fr\u00e4nti . Random Projection for k-means Clustering[C]\/\/ International Conference on Artificial Intelligence & Soft Computing . Springer , Cham , 2018 . Sami Sieranoja, Pasi Fr\u00e4nti. Random Projection for k-means Clustering[C]\/\/ International Conference on Artificial Intelligence & Soft Computing. Springer, Cham, 2018."},{"volume-title":"Applied Intelligence","year":"2018","key":"e_1_3_2_1_9_1","unstructured":"Pasi, Fr?nti, Sami , K-means properties on six clustering benchmark datasets[J] . Applied Intelligence , 2018 . Pasi, Fr?nti, Sami, K-means properties on six clustering benchmark datasets[J]. Applied Intelligence, 2018."},{"key":"e_1_3_2_1_10_1","volume-title":"MSD-k-means: A Novel Algorithm for Efficient Detection of Global and Local Outliers[J]","author":"Wei","year":"2019","unstructured":"Wei Y, Jang-Jaccard J, Sabrina F , MSD-k-means: A Novel Algorithm for Efficient Detection of Global and Local Outliers[J] . 2019 . Wei Y, Jang-Jaccard J, Sabrina F, MSD-k-means: A Novel Algorithm for Efficient Detection of Global and Local Outliers[J]. 2019."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2007.01.001"},{"key":"e_1_3_2_1_12_1","first-page":"150","article-title":"Improved k-means initial clustering center selection algorithm.","volume":"46","author":"Han Lingbo","year":"2010","unstructured":"Lingbo Han , Qiang Wang , Improved k-means initial clustering center selection algorithm. Computer Engineering and Applications , 2010 , 46 )17(: 150 - 152 . Lingbo Han,Qiang Wang , Improved k-means initial clustering center selection algorithm.Computer Engineering and Applications, 2010, 46)17(:150-152.","journal-title":"Computer Engineering and Applications"},{"issue":"08","key":"e_1_3_2_1_13_1","first-page":"2721","article-title":"Optimization to k-means initial cluster centers[J]","volume":"2011","author":"Tong Xuejiao","unstructured":"Xuejiao Tong , Fanrong Meng , Zhixiao Wang . Optimization to k-means initial cluster centers[J] . Computer Engineering and Design , 2011 ( 08 ): 2721 - 2723 . Xuejiao Tong,Fanrong Meng,Zhixiao Wang. Optimization to k-means initial cluster centers[J]. Computer Engineering and Design, 2011(08):2721-2723.","journal-title":"Computer Engineering and Design"},{"issue":"003","key":"e_1_3_2_1_14_1","first-page":"888","article-title":"K-means clustering algorithm based on optimal initial centers related to pattern distribution of samples in space[J]","volume":"29","author":"Xie Juanying","year":"2012","unstructured":"Juanying Xie , Wenjuan Guo , Weixin Xie , K-means clustering algorithm based on optimal initial centers related to pattern distribution of samples in space[J] . Application Research of Computers , 2012 , 29 ( 003 ): 888 - 892 . Juanying Xie,Wenjuan Guo,Weixin Xie, K-means clustering algorithm based on optimal initial centers related to pattern distribution of samples in space[J]. Application Research of Computers, 2012, 29(003):888-892.","journal-title":"Application Research of Computers"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1087.2011.00432"},{"key":"e_1_3_2_1_16_1","unstructured":"Sujie Zhang. Algorithm research of optimal cluster number and initial cluster center[J].Application Research of Computers 2017(06).  Sujie Zhang. Algorithm research of optimal cluster number and initial cluster center[J].Application Research of Computers 2017(06)."}],"event":{"name":"ICMLC 2021: 2021 13th International Conference on Machine Learning and Computing","acronym":"ICMLC 2021","location":"Shenzhen China"},"container-title":["2021 13th International Conference on Machine Learning and Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3457682.3457695","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3457682.3457695","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:08Z","timestamp":1750195688000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3457682.3457695"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,26]]},"references-count":16,"alternative-id":["10.1145\/3457682.3457695","10.1145\/3457682"],"URL":"https:\/\/doi.org\/10.1145\/3457682.3457695","relation":{},"subject":[],"published":{"date-parts":[[2021,2,26]]},"assertion":[{"value":"2021-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}