{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T21:16:19Z","timestamp":1730236579516,"version":"3.28.0"},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1109\/iccse49874.2020.9201656","type":"proceedings-article","created":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T23:34:45Z","timestamp":1600817685000},"page":"638-641","source":"Crossref","is-referenced-by-count":3,"title":["Study of High-Dimensional Data Analysis based on Clustering Algorithm"],"prefix":"10.1109","author":[{"given":"Ping","family":"Zong","sequence":"first","affiliation":[]},{"given":"Junyan","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Qin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-013-9398-7"},{"key":"ref3","first-page":"62","article-title":"The Reaearch about Clustering Algorithm of K-Means[J]","volume":"21","author":"aiwu","year":"2011","journal-title":"Computer Technology and Development"},{"key":"ref6","first-page":"2721","article-title":"Optimization to K-means initial Cluster Centers[J]","volume":"32","author":"tong","year":"2011","journal-title":"Computer Engineering and Design"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.5120\/7629-0698"},{"key":"ref8","first-page":"150","article-title":"Improved K-means Initial Clustering Center Selection Algorithm[J]","volume":"46","author":"han","year":"2010","journal-title":"Computer Engineering and Applications"},{"key":"ref7","first-page":"147","article-title":"Optimization Study on Initial Center of K-means Algorithm[J]","volume":"44","author":"lai","year":"2008","journal-title":"Computer Engineering and Applications"},{"key":"ref2","first-page":"41","article-title":"Review on Clustering Algorithms[J]","volume":"6","author":"xinquan","year":"2017","journal-title":"Integration Technology"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISSNIP.2013.6529823"},{"key":"ref9","first-page":"65","article-title":"K-means Clustering Algorithm with Meliorated Initial Center[J]","volume":"33","author":"yuan","year":"2007","journal-title":"Computer Engineering"}],"event":{"name":"2020 15th International Conference on Computer Science & Education (ICCSE)","start":{"date-parts":[[2020,8,18]]},"location":"Delft, Netherlands","end":{"date-parts":[[2020,8,22]]}},"container-title":["2020 15th International Conference on Computer Science &amp; Education (ICCSE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9199030\/9201611\/09201656.pdf?arnumber=9201656","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:19:38Z","timestamp":1656375578000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9201656\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/iccse49874.2020.9201656","relation":{},"subject":[],"published":{"date-parts":[[2020,8]]}}}