{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:21:54Z","timestamp":1742912514464,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031200953"},{"type":"electronic","value":"9783031200960"}],"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-3-031-20096-0_42","type":"book-chapter","created":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T15:04:11Z","timestamp":1673535851000},"page":"560-567","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Kmeans Algorithm Based on\u00a0Privacy Protection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1291-7217","authenticated-orcid":false,"given":"Caixin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1025-3955","authenticated-orcid":false,"given":"Lili","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongyong","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,13]]},"reference":[{"issue":"7","key":"42_CR1","doi-asserted-by":"publisher","first-page":"5276","DOI":"10.1007\/s11227-019-02906-6","volume":"76","author":"S Li","year":"2020","unstructured":"Li, S., Shen, H., Sang, Y., et al.: An efficient method for privacy-preserving trajectory data publishing based on data partitioning. J. Supercomput. 76(7), 5276\u20135300 (2020)","journal-title":"J. Supercomput."},{"issue":"3","key":"42_CR2","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s00607-020-00860-3","volume":"103","author":"P Zhang","year":"2020","unstructured":"Zhang, P., Durresi, M., Durresi, A.: Internet network location privacy protection with multi-access edge computing. Computing 103(3), 473\u2013490 (2020). https:\/\/doi.org\/10.1007\/s00607-020-00860-3","journal-title":"Computing"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Thomas, L., et al.: A framework for data privacy and security accountability in data breach communications. Comput. Secur. 116, 102657 (2022)","DOI":"10.1016\/j.cose.2022.102657"},{"key":"42_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C Dwork","year":"2006","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 1\u201312. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_1"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Yongge, S., et al.: Hybrid data mining method of telecom customer based on improved Kmeans and XGBoost. J. Phys. Conf. Ser. 2010(1), 012060 (2021)","DOI":"10.1088\/1742-6596\/2010\/1\/012060"},{"key":"42_CR6","unstructured":"Lin, T., Zhao, X., Sang, Y.: K-means clustering algorithm for nearest neighbor optimization. Computer Sci. 46(S5), 216\u2013219 (2019)"},{"key":"42_CR7","unstructured":"Wang, T., Gao, J.: An improved k-means algorithm based on kurtosis test. In: Proceedings of 2019 3rd International Conference on Artificial Intelligence, pp. 214\u2013248. Automation and Control Technologies, New York (2019)"},{"key":"42_CR8","unstructured":"Zhang, Y., et al.: Improved K-means algorithm combining density parameters and center substitution and new clustering effectiveness index. Computer Sci. 49(01), 121\u2013132 (2022)"},{"key":"42_CR9","unstructured":"Zhou, H.: Number of mixed data clusters and initial class center determination algorithm and implementation. Shanxi University, Shanxi (2020)"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Fr\u00c3nti, P.: K-means properties on six clustering benchmark datasets. Appl. Intell. 116 , 4743\u20134759 (2018)","DOI":"10.1007\/s10489-018-1238-7"}],"container-title":["Lecture Notes in Computer Science","Machine Learning for Cyber Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20096-0_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T15:13:32Z","timestamp":1673536412000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20096-0_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031200953","9783031200960"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20096-0_42","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":"13 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ML4CS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning for Cyber Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ml4cs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ml4cs2022\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}