{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:30:01Z","timestamp":1742931001661,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819723867"},{"type":"electronic","value":"9789819723874"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-2387-4_10","type":"book-chapter","created":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T18:02:02Z","timestamp":1714240922000},"page":"145-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Coordinate Descent for\u00a0k-Means with\u00a0Differential Privacy"],"prefix":"10.1007","author":[{"given":"Yuchen","family":"Xie","sequence":"first","affiliation":[]},{"given":"Yi-Jun","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Zeng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,28]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., et al.: Deep learning with differential privacy. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 308\u2013318 (2016)","DOI":"10.1145\/2976749.2978318"},{"key":"10_CR2","unstructured":"Balcan, M.F., Dick, T., Liang, Y., Mou, W., Zhang, H.: Differentially private clustering in high-dimensional Euclidean spaces. In: International Conference on Machine Learning, pp. 322\u2013331. PMLR (2017)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Blum, A., Dwork, C., McSherry, F., Nissim, K.: Practical privacy: the SULQ framework. In: Proceedings of the Twenty-Fourth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 128\u2013138 (2005)","DOI":"10.1145\/1065167.1065184"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Cormode, G., Jha, S., Kulkarni, T., Li, N., Srivastava, D., Wang, T.: Privacy at scale: local differential privacy in practice. In: Proceedings of the 2018 International Conference on Management of Data, pp. 1655\u20131658 (2018)","DOI":"10.1145\/3183713.3197390"},{"key":"10_CR5","unstructured":"Dennis, D.K., Li, T., Smith, V.: Heterogeneity for the win: one-shot federated clustering. In: International Conference on Machine Learning, pp. 2611\u20132620. PMLR (2021)"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) Automata, Languages and Programming. ICALP 2006. LNCS, vol. 4052pp. 1\u201312. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_1","DOI":"10.1007\/11787006_1"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Dwork, C.: A firm foundation for private data analysis. Commun. ACM 54(1), 86\u201395 (2011)","DOI":"10.1145\/1866739.1866758"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Dwork, C., Roth, A., et al.: The algorithmic foundations of differential privacy. Found. Trends\u00ae Theor. Comput. Sci. 9(3\u20134), 211\u2013407 (2014)","DOI":"10.1561\/0400000042"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Gupta, A., Ligett, K., McSherry, F., Roth, A., Talwar, K.: Differentially private combinatorial optimization. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1106\u20131125. SIAM (2010)","DOI":"10.1137\/1.9781611973075.90"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.88.018702","volume":"88","author":"D Horn","year":"2001","unstructured":"Horn, D., Gottlieb, A.: Algorithm for data clustering in pattern recognition problems based on quantum mechanics. Phys. Rev. Lett. 88(1), 018702 (2001)","journal-title":"Phys. Rev. Lett."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Li, N., Li, T., Venkatasubramanian, S.: t-closeness: privacy beyond k-anonymity and l-diversity. In: 2007 IEEE 23rd International Conference on Data Engineering, pp. 106\u2013115. IEEE (2006)","DOI":"10.1109\/ICDE.2007.367856"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013137 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"10_CR13","first-page":"1541","volume":"18","author":"Z Lu","year":"2020","unstructured":"Lu, Z., Shen, H.: Differentially private $$k$$-means clustering with convergence guarantee. IEEE Trans. Depend. Secure Comput. 18(4), 1541\u20131552 (2020)","journal-title":"IEEE Trans. Depend. Secure Comput."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), pp. 94\u2013103. IEEE (2007)","DOI":"10.1109\/FOCS.2007.66"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Mironov, I.: R\u00e9nyi differential privacy. In: 2017 IEEE 30th Computer Security Foundations Symposium (CSF), pp. 263\u2013275. IEEE (2017)","DOI":"10.1109\/CSF.2017.11"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Mohan, P., Thakurta, A., Shi, E., Song, D., Culler, D.: Gupt: privacy preserving data analysis made easy. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, pp. 349\u2013360 (2012)","DOI":"10.1145\/2213836.2213876"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Nie, F., Li, Z., Wang, R., Li, X.: An effective and efficient algorithm for K-means clustering with new formulation. IEEE Trans. Knowl. Data Eng. 35(4), 3433\u20133443 (2023)","DOI":"10.1109\/TKDE.2022.3155450"},{"issue":"5","key":"10_CR18","first-page":"2371","volume":"44","author":"F Nie","year":"2021","unstructured":"Nie, F., Xue, J., Wu, D., Wang, R., Li, H., Li, X.: Coordinate descent method for $$k$$-means. IEEE Trans. Pattern Anal. Mach. Intell. 44(5), 2371\u20132385 (2021)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10_CR19","unstructured":"Park, M., Foulds, J., Choudhary, K., Welling, M.: Dp-em: differentially private expectation maximization. In: Artificial Intelligence and Statistics, pp. 896\u2013904. PMLR (2017)"},{"issue":"1","key":"10_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TPAMI.2022.3150981","volume":"45","author":"S Pei","year":"2022","unstructured":"Pei, S., Chen, H., Nie, F., Wang, R., Li, X.: Centerless clustering. IEEE Trans. Pattern Anal. Mach. Intell. 45(1), 167\u2013181 (2022)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"10_CR21","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1109\/TDEI.2013.6518945","volume":"20","author":"X Peng","year":"2013","unstructured":"Peng, X., Zhou, C., Hepburn, D.M., Judd, M.D., Siew, W.H.: Application of k-means method to pattern recognition in on-line cable partial discharge monitoring. IEEE Trans. Dielectr. Electr. Insul. 20(3), 754\u2013761 (2013)","journal-title":"IEEE Trans. Dielectr. Electr. Insul."},{"issue":"6","key":"10_CR22","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1109\/LSP.2013.2258912","volume":"20","author":"SK Sahoo","year":"2013","unstructured":"Sahoo, S.K., Makur, A.: Dictionary training for sparse representation as generalization of k-means clustering. IEEE Signal Process. Lett. 20(6), 587\u2013590 (2013)","journal-title":"IEEE Signal Process. Lett."},{"issue":"9","key":"10_CR23","doi-asserted-by":"publisher","first-page":"1770","DOI":"10.1109\/TKDE.2018.2805356","volume":"30","author":"H Shin","year":"2018","unstructured":"Shin, H., Kim, S., Shin, J., Xiao, X.: Privacy enhanced matrix factorization for recommendation with local differential privacy. IEEE Trans. Knowl. Data Eng. 30(9), 1770\u20131782 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"10_CR24","first-page":"7964","volume":"22","author":"U Stemmer","year":"2021","unstructured":"Stemmer, U.: Locally private k-means clustering. J. Mach. Learn. Res. 22(1), 7964\u20137993 (2021)","journal-title":"J. Mach. Learn. Res."},{"key":"10_CR25","unstructured":"Stemmer, U., Kaplan, H.: Differentially private k-means with constant multiplicative error. Adv. Neural Inf. Process. Syst. 31 (2018)"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Su, D., Cao, J., Li, N., Bertino, E., Lyu, M., Jin, H.: Differentially private K-means clustering and a hybrid approach to private optimization. ACM Trans. Privacy Secur. 20(4), 1\u201333 (2017)","DOI":"10.1145\/3133201"},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"2796","DOI":"10.1109\/TIP.2022.3141612","volume":"31","author":"R Wang","year":"2022","unstructured":"Wang, R., Lu, J., Lu, Y., Nie, F., Li, X.: Discrete and parameter-free multiple kernel $$k$$-means. IEEE Trans. Image Process. 31, 2796\u20132808 (2022)","journal-title":"IEEE Trans. Image Process."},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Wu, J.: Advances in K-Means Clustering: A Data Mining Thinking. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29807-3","DOI":"10.1007\/978-3-642-29807-3"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982), pp. 160\u2013164. IEEE (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, J., Xiao, X., Yang, Y., Zhang, Z., Winslett, M.: Privgene: differentially private model fitting using genetic algorithms. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 665\u2013676 (2013)","DOI":"10.1145\/2463676.2465330"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-2387-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T18:04:23Z","timestamp":1714241063000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-2387-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819723867","9789819723874"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-2387-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"28 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","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":"6 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.apweb-waim2023.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}