{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:27:33Z","timestamp":1743074853004,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030742508"},{"type":"electronic","value":"9783030742515"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-74251-5_35","type":"book-chapter","created":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T15:20:40Z","timestamp":1618240840000},"page":"439-451","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Privacy Preserving Distributed K-Means for Non-IID Data"],"prefix":"10.1007","author":[{"given":"Andr\u00e9","family":"Brand\u00e3o","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2077-7223","authenticated-orcid":false,"given":"Ricardo","family":"Mendes","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5805-1351","authenticated-orcid":false,"given":"Jo\u00e3o P.","family":"Vilela","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,13]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Bonawitz, K., et al.: Practical secure aggregation for privacy-preserving machine learning. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 1175\u20131191 (2017)","DOI":"10.1145\/3133956.3133982"},{"issue":"1","key":"35_CR2","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.eswa.2012.07.021","volume":"40","author":"ME Celebi","year":"2013","unstructured":"Celebi, M.E., Kingravi, H.A., Vela, P.A.: A comparative study of efficient initialization methods for the k-means clustering algorithm. Expert Syst. Appl. 40(1), 200\u2013210 (2013)","journal-title":"Expert Syst. Appl."},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Clifton, C., Tassa, T.: On syntactic anonymity and differential privacy. In: 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW), pp. 88\u201393. IEEE (2013)","DOI":"10.1109\/ICDEW.2013.6547433"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Farrand, T., Mireshghallah, F., Singh, S., Trask, A.: Neither private nor fair: impact of data imbalance on utility and fairness in differential privacy. In: Proceedings of the 2020 Workshop on Privacy-Preserving Machine Learning in Practice, pp. 15\u201319 (2020)","DOI":"10.1145\/3411501.3419419"},{"key":"35_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-37682-5_1","volume-title":"Information Security and Cryptology \u2013 ICISC 2012","author":"T Graepel","year":"2013","unstructured":"Graepel, T., Lauter, K., Naehrig, M.: ML confidential: machine learning on encrypted data. In: Kwon, T., Lee, M.-K., Kwon, D. (eds.) ICISC 2012. LNCS, vol. 7839, pp. 1\u201321. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37682-5_1"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-04212-7_17","volume-title":"Neural Information Processing","author":"X Hu","year":"2018","unstructured":"Hu, X., et al.: Privacy-preserving K-means clustering upon negative databases. In: Cheng, L., Leung, A.C.S., Ozawa, S. (eds.) ICONIP 2018. LNCS, vol. 11304, pp. 191\u2013204. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04212-7_17"},{"issue":"1","key":"35_CR7","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193\u2013218 (1985)","journal-title":"J. Classif."},{"issue":"5","key":"35_CR8","doi-asserted-by":"publisher","first-page":"2406","DOI":"10.1109\/TITS.2015.2405759","volume":"16","author":"A Jahangiri","year":"2015","unstructured":"Jahangiri, A., Rakha, H.A.: Applying machine learning techniques to transportation mode recognition using mobile phone sensor data. IEEE Trans. Intell. Transp. Syst. 16(5), 2406\u20132417 (2015)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"35_CR9","unstructured":"Januzaj, E., Kriegel, H.P., Pfeifle, M.: Towards effective and efficient distributed clustering. In: Workshop on Clustering Large Data Sets (ICDM2003), Vol. 60 (2003)"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.ins.2019.12.051","volume":"518","author":"ZL Jiang","year":"2020","unstructured":"Jiang, Z.L., et al.: Efficient two-party privacy-preserving collaborative k-means clustering protocol supporting both storage and computation outsourcing. Inf. Sci. 518, 168\u2013180 (2020)","journal-title":"Inf. Sci."},{"key":"35_CR11","unstructured":"Liu, B., et al.: Follow my recommendations: a personalized privacy assistant for mobile app permissions. In: Twelfth Symposium on Usable Privacy and Security (SOUPS 2016), pp. 27\u201341 (2016)"},{"issue":"2","key":"35_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"},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1007\/978-3-030-16148-4_47","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Z Lu","year":"2019","unstructured":"Lu, Z., Shen, H.: A convergent differentially private k-means clustering algorithm. In: Yang, Q., Zhou, Z.-H., Gong, Z., Zhang, M.-L., Huang, S.-J. (eds.) PAKDD 2019. LNCS (LNAI), vol. 11439, pp. 612\u2013624. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16148-4_47"},{"key":"35_CR14","unstructured":"McMahan, B., Moore, E., Ramage, D., Hampson, S., Arcas, B.A.: Communication-efficient learning of deep networks from decentralized data. In: International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, vol. 54, pp. 1273\u20131282. PMLR (2017)"},{"issue":"2","key":"35_CR15","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0167-9473(97)00053-4","volume":"27","author":"W Navidi","year":"1998","unstructured":"Navidi, W., Murphy Jr., W.S., Hereman, W.: Statistical methods in surveying by trilateration. Comput. Stat. Data Anal. 27(2), 209\u2013227 (1998)","journal-title":"Comput. Stat. Data Anal."},{"key":"35_CR16","unstructured":"Palacio-Ni\u00f1o, J., Berzal, F.: Evaluation metrics for unsupervised learning algorithms. arXiv preprint arXiv:1905.05667 (2019)"},{"key":"35_CR17","doi-asserted-by":"publisher","unstructured":"Sarker, I.H., Hoque, M.M., Uddin, M.K., Alsanoosy, T.: Mobile data science and intelligent apps: concepts, AI-based modeling and research directions. Mob. Netw. Appl. 1\u201319 (2020). https:\/\/doi.org\/10.1007\/s11036-020-01650-z","DOI":"10.1007\/s11036-020-01650-z"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Schellekens, V., Chatalic, A., Houssiau, F., De Montjoye, Y.A., Jacques, L., Gribonval, R.: Differentially private compressive k-means. In: ICASSP 2019\u20132019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 7933\u20137937. IEEE (2019)","DOI":"10.1109\/ICASSP.2019.8682829"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Sculley, D.: Web-scale k-means clustering. In: Proceedings of the 19th International Conference on World Wide Web. p. 1177\u20131178. WWW 2010, Association for Computing Machinery (2010)","DOI":"10.1145\/1772690.1772862"},{"key":"35_CR20","unstructured":"Microsoft SEAL (release 3.5), Microsoft Research, Redmond, WA (2020)"},{"key":"35_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-030-47426-3_27","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"A Soliman","year":"2020","unstructured":"Soliman, A., Girdzijauskas, S., Bouguelia, M.-R., Pashami, S., Nowaczyk, S.: Decentralized and adaptive K-means clustering for non-IID data using hyperLogLog counters. In: Lauw, H.W., Wong, R.C.-W., Ntoulas, A., Lim, E.-P., Ng, S.-K., Pan, S.J. (eds.) PAKDD 2020. LNCS (LNAI), vol. 12084, pp. 343\u2013355. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-47426-3_27"},{"key":"35_CR22","doi-asserted-by":"crossref","unstructured":"Su, D., Cao, J., Li, N., Bertino, E., Jin, H.: Differentially private k-means clustering. In: Proceedings of the Sixth ACM Conference on Data and Application Security and Privacy, pp. 26\u201337. ACM (2016)","DOI":"10.1145\/2857705.2857708"},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Thiagarajan, A., et al.: Vtrack: accurate, energy-aware road traffic delay estimation using mobile phones. In: Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems, SenSys 2009, pp. 85\u201398. Association for Computing Machinery (2009)","DOI":"10.1145\/1644038.1644048"},{"key":"35_CR24","unstructured":"Triebe, O.J., Rajagopal, R.: Federated K-Means: clustering algorithm and proof of concept (2020)"},{"key":"35_CR25","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 206\u2013215. KDD 2003 (2003)","DOI":"10.1145\/956750.956776"},{"issue":"4","key":"35_CR26","doi-asserted-by":"publisher","first-page":"2066","DOI":"10.1109\/TII.2017.2695487","volume":"13","author":"K Xing","year":"2017","unstructured":"Xing, K., Hu, C., Yu, J., Cheng, X., Zhang, F.: Mutual privacy preserving $$ k $$-means clustering in social participatory sensing. IEEE Trans. Ind. Inform. 13(4), 2066\u20132076 (2017)","journal-title":"IEEE Trans. Ind. Inform."},{"issue":"3","key":"35_CR27","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TNN.2005.845141","volume":"16","author":"R Xu","year":"2005","unstructured":"Xu, R., Wunsch, D.: Survey of clustering algorithms. IEEE Trans. Neural Netw. 16(3), 645\u2013678 (2005)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"11","key":"35_CR28","doi-asserted-by":"publisher","first-page":"310","DOI":"10.3390\/electronics7110310","volume":"7","author":"H Yin","year":"2018","unstructured":"Yin, H., Zhang, J., Xiong, Y., Huang, X., Deng, T.: PPK-means: achieving privacy-preserving clustering over encrypted multi-dimensional cloud data. Electronics 7(11), 310 (2018)","journal-title":"Electronics"},{"issue":"2","key":"35_CR29","first-page":"226","volume":"2","author":"C Yuan","year":"2019","unstructured":"Yuan, C., Yang, H.: Research on k-value selection method of k-means clustering algorithm. J. Multi. Sci. J. 2(2), 226\u2013235 (2019)","journal-title":"J. Multi. Sci. J."},{"issue":"2","key":"35_CR30","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1109\/TCC.2017.2656895","volume":"7","author":"J Yuan","year":"2019","unstructured":"Yuan, J., Tian, Y.: Practical privacy-preserving mapreduce based k-means clustering over large-scale dataset. IEEE Trans. Cloud Comput. 7(2), 568\u2013579 (2019)","journal-title":"IEEE Trans. Cloud Comput."},{"key":"35_CR31","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.ymssp.2017.06.022","volume":"100","author":"W Zhang","year":"2018","unstructured":"Zhang, W., Li, C., Peng, G., Chen, Y., Zhang, Z.: A deep convolutional neural network with new training methods for bearing fault diagnosis under noisy environment and different working load. Mech. Syst. Signal Process. 100, 439\u2013453 (2018)","journal-title":"Mech. Syst. Signal Process."}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis XIX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-74251-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,25]],"date-time":"2021-04-25T00:37:05Z","timestamp":1619311025000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-74251-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030742508","9783030742515"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-74251-5_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"13 April 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IDA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Intelligent Data Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ida2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ida2021.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"113","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}