{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:10:34Z","timestamp":1743001834364,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030953904"},{"type":"electronic","value":"9783030953911"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-95391-1_25","type":"book-chapter","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T09:04:54Z","timestamp":1645520694000},"page":"397-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Spectral Clustering Algorithm Based on Differential Privacy Preservation"],"prefix":"10.1007","author":[{"given":"Yuyang","family":"Cui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaming","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongting","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yonggang","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"152076","DOI":"10.1109\/ACCESS.2019.2947261","volume":"7","author":"W Xiang","year":"2019","unstructured":"Xiang, W., Wang, H., Shi, M., Wang, A., Xia, K.: DNA Motif finding method without protection can leak user privacy. IEEE Access 7, 152076\u2013152087 (2019)","journal-title":"IEEE Access"},{"key":"25_CR2","doi-asserted-by":"publisher","unstructured":"Achieving Privacy Preservation when Sharing Data for Clustering. Springer, Berlin Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30073-1_6","DOI":"10.1007\/978-3-540-30073-1_6"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Nayahi, J., Kavitha, V.: Privacy and utility preserving data clustering for data anonymization and distribution on Hadoop. Future Gen. Comput. Syst. 74(SEP.), 393\u2013408 (2016)","DOI":"10.1016\/j.future.2016.10.022"},{"key":"25_CR4","unstructured":"Practical privacy: the SuLQ framework. In: Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 13\u201315, 2005, ACM, Baltimore, Maryland, USA (2005)"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1866739.1866758","volume":"54","author":"C Dwork","year":"2011","unstructured":"Dwork, C.: A firm foundation for private data analysis. Commun. ACM 54(1), 86\u201395 (2011)","journal-title":"Commun. ACM"},{"key":"25_CR6","unstructured":"Yanming, F.U., Zhenduo, L.I.: Research on k-means++ clustering algorithm based on laplace mechanism for differential privacy protection. Netinfo Sec. (2019)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.neucom.2020.10.051","volume":"424","author":"T Ni","year":"2021","unstructured":"Ni, T., Qiao, M., Chen, Z., Zhang, S., Zhong, H.: Utility-efficient differentially private K-means clustering based on cluster merging. Neurocomputing 424, 205\u2013214 (2021)","journal-title":"Neurocomputing"},{"issue":"S2","key":"25_CR8","first-page":"2907","volume":"22","author":"W Xiang","year":"2018","unstructured":"Xiang, W., Wei, Y., Mao, Y., Wang, L.: A differential privacy DNA motif finding method based on closed frequent patterns. Clust. Comput. 22(S2), 2907\u20132919 (2018)","journal-title":"Clust. Comput."},{"issue":"4","key":"25_CR9","first-page":"830","volume":"37","author":"WM Wu","year":"2015","unstructured":"Wu, W.M., Huang, H.K.: Research on DP-DBScan clustering algorithm based on differential privacy preservation. Comput. Eng. Sci. 37(4), 830\u2013834 (2015)","journal-title":"Comput. Eng. Sci."},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Wu, X., Zhang, Y., Wang, A., et al.: MNSSp3: Medical big data privacy protection platform based on Internet of things. Neural Comput. Appl. 4 (2020)","DOI":"10.1007\/s00521-020-04873-z"},{"issue":"8","key":"25_CR11","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1109\/TC.2021.3060484","volume":"70","author":"T Wang","year":"2021","unstructured":"Wang, T., Yucheng, L., Wang, J., Dai, H.-N., Zheng, X., Jia, W.: EIHDP: edge-intelligent hierarchical dynamic pricing based on cloud-edge-client collaboration for IoT systems. IEEE Trans. Comput. 70(8), 1285\u20131298 (2021)","journal-title":"IEEE Trans. Comput."},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.ins.2019.08.064","volume":"508","author":"W Youke","year":"2020","unstructured":"Youke, W., Huang, H., Ningyun, W., Yue Wang, M., Bhuiyan, Z.A., Wang, T.: An incentive-based protection and recovery strategy for secure big data in social networks. Inf. Sci. 508, 79\u201391 (2020)","journal-title":"Inf. Sci."},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.future.2021.09.015","volume":"127","author":"W Xiang","year":"2022","unstructured":"Xiang, W., Zhang, Y., Shi, M., Li, P., Li, R., Xiong, N.N.: An adaptive federated learning scheme with differential privacy reserving. Futur. Gener. Comput. Syst. 127, 362\u2013372 (2022). https:\/\/doi.org\/10.1016\/j.future.2021.09.015","journal-title":"Futur. Gener. Comput. Syst."},{"key":"25_CR14","doi-asserted-by":"publisher","unstructured":"Wang, T., Liu, Y., Zheng, X., Dai, H.-N., Jia, W., Xie, M.: Edge-based communication optimization for distributed federated learning. In: IEEE Transactions on Network Science and Engineering (2021). https:\/\/doi.org\/10.1109\/TNSE.2021.3083263","DOI":"10.1109\/TNSE.2021.3083263"},{"issue":"5","key":"25_CR15","first-page":"3","volume":"36","author":"Y Fan","year":"2019","unstructured":"Fan, Y., Xiang, Z., Li, M.: Application of spectral clustering algorithm in chemical reagent library preparation optimization. Comput. Appl. Chem. 36(5), 3 (2019)","journal-title":"Comput. Appl. Chem."},{"issue":"3","key":"25_CR16","first-page":"8","volume":"41","author":"L Guo","year":"2018","unstructured":"Guo, L., Yang, J., Song, N.Q.: Application of spectral clustering algorithm in the diagnostic assessment of different attribute hierarchical structures. Psychol. Sci. 41(3), 8 (2018)","journal-title":"Psychol. Sci."},{"key":"25_CR17","unstructured":"Xiaoyao, Z., Dongmei, C., Yuqing, L., et al.: A spectral clustering algorithm based on differential privacy preservation. Comput. Appl. 38(10), 5"},{"key":"25_CR18","unstructured":"Hu, B.: Research on clustering algorithm for differential privacy protection. Nanjing University of Posts and Telecommunications (2019)"},{"issue":"3","key":"25_CR19","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1049\/iet-ifs.2019.0255","volume":"14","author":"J Li","year":"2020","unstructured":"Li, J., Wei, J., Ye, M., Liu, W., Xuexian, H.: Privacy\u2010preserving constrained spectral clustering algorithm for large\u2010scale data sets. IET Inf. Secur. 14(3), 321\u2013331 (2020). https:\/\/doi.org\/10.1049\/iet-ifs.2019.0255","journal-title":"IET Inf. Secur."},{"key":"25_CR20","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.) Automata, Languages and Programming, pp. 1\u201312. Springer, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_1"},{"issue":"002","key":"25_CR21","first-page":"346","volume":"057","author":"JX Liu","year":"2020","unstructured":"Liu, J.X., Meng, S.F.: A review of privacy-preserving research on machine learning. Comput. Res. Dev. 057(002), 346\u2013362 (2020)","journal-title":"Comput. Res. Dev."},{"issue":"8","key":"25_CR22","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Patt. Anal. Mach. Intell. 22(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell."},{"issue":"11","key":"25_CR23","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1109\/34.244673","volume":"15","author":"Z Wu","year":"1993","unstructured":"Wu, Z., Leahy, R.: An optimal graph theoretic approach to data clustering: theory and its application to image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 15(11), 1101\u20131113 (1993)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Hagen, L, Kahng, A.B.: New spectral methods for ratio cut partitioning and clustering. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 11(9), 1074\u20131085 (1992)","DOI":"10.1109\/43.159993"},{"issue":"5","key":"25_CR25","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1109\/34.857006","volume":"22","author":"S Sarkar","year":"2000","unstructured":"Sarkar, S., Soundararajan, P.: Supervised learning of large perceptual organization: graph spectral partitioning and learning automata. IEEE Trans. Patt. Anal. Mach. Intell. 22(5), 504\u2013525 (2000)","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell."},{"key":"25_CR26","unstructured":"Ding, C., He, X., Zha, H., et al.: Spectral Min-Max Cut for Graph Partitioning and Data Clustering (2001)"},{"key":"25_CR27","unstructured":"Meila, M., Xu, L.: Multiway Cuts and Spectral Clustering. U .Washingt on Tech Report (2003)"},{"issue":"7","key":"25_CR28","first-page":"14","volume":"35","author":"XY Cai","year":"2008","unstructured":"Cai, X.Y., Dai, G.Z., Yang, L.B.: Survey on spectral clustering algorithms. Comput. Sci. 35(7), 14\u201318 (2008)","journal-title":"Comput. Sci."},{"key":"25_CR29","unstructured":"Bai, L., Zhao, X., Kong, Y., et al.: A review of spectral clustering algorithms. Comput. Eng. Appl. 57(14), 12"},{"issue":"05","key":"25_CR30","first-page":"5","volume":"4","author":"ZD Zhao","year":"2019","unstructured":"Zhao, Z.D., Chang, X.L., Wang, Y.X.: A review of privacy protection in machine learning. J. Inf. Secur. 4(05), 5\u201317 (2019)","journal-title":"J. Inf. Secur."},{"key":"25_CR31","unstructured":"Privacy in Pharmacogenetics: An End-to-End Case Study of Personalized Warfarin Dosing. USENIX Association (2014)"},{"key":"25_CR32","unstructured":"Model inversion attacks that exploit confidence information and basic countermeasures. In: The 22nd ACM SIGSAC Conference. ACM (2015)"},{"key":"25_CR33","unstructured":"Stealing machine learning models via prediction APIs. In: 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10\u201312, 2016 (2016)"},{"key":"25_CR34","unstructured":"Information Theoretic Measures for Clusterings Comparison: Variants, Properties, Normalization and Correction for Chance. JMLR.org (2010)"},{"key":"25_CR35","volume-title":"UCI Machine Learning Repository","author":"D Dua","year":"2019","unstructured":"Dua, D., Graff, C.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA (2019)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95391-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T09:09:21Z","timestamp":1645520961000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95391-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030953904","9783030953911"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95391-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2021\/index.html","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":"403","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":"145","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":"36% - 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.12","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":"2.27","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}