{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:16:25Z","timestamp":1758266185299,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031059322"},{"type":"electronic","value":"9783031059339"}],"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-031-05933-9_16","type":"book-chapter","created":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T13:04:50Z","timestamp":1652101490000},"page":"194-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["dK-Personalization: Publishing Network Statistics with Personalized Differential Privacy"],"prefix":"10.1007","author":[{"given":"Masooma","family":"Iftikhar","sequence":"first","affiliation":[]},{"given":"Qing","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,10]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Alaggan, M., Gambs, S., Kermarrec, A.-M.: Heterogeneous differential privacy. J. Priv. Confidentiality 7(2), 127\u2013158 (2016)","DOI":"10.29012\/jpc.v7i2.652"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Day, W.Y., Li, N., Lyu, M.: Publishing graph degree distribution with node differential privacy. In: SIGMOD, pp. 123\u2013138 (2016)","DOI":"10.1145\/2882903.2926745"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Ding, X., Zhang, X., Bao, Z., Jin, H.: Privacy-preserving triangle counting in large graphs. In: CIKM, pp. 1283\u20131292 (2018)","DOI":"10.1145\/3269206.3271736"},{"issue":"2","key":"16_CR4","first-page":"195","volume":"11","author":"J Domingo-Ferrer","year":"2005","unstructured":"Domingo-Ferrer, J., Torra, V.: Ordinal, continuous and heterogeneous k-anonymity through microaggregation. KDD 11(2), 195\u2013212 (2005)","journal-title":"KDD"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265\u2013284. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_14"},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/2676726.2677005","volume":"50","author":"H Ebadi","year":"2015","unstructured":"Ebadi, H., Sands, D., Schneider, G.: Differential privacy: now it\u2019s getting personal. POPL 50(1), 69\u201381 (2015)","journal-title":"POPL"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-030-75765-6_29","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M Iftikhar","year":"2021","unstructured":"Iftikhar, M., Wang, Q.: dK-projection: publishing graph joint degree distribution with node differential privacy. In: Karlapalem, K., et al. (eds.) PAKDD 2021. LNCS (LNAI), vol. 12713, pp. 358\u2013370. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75765-6_29"},{"key":"16_CR8","unstructured":"Iftikhar, M., Wang, Q., Lin, Y.: Publishing differentially private datasets via stable microaggregation. In: EDBT, pp. 662\u2013665 (2019)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-47436-2_15","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M Iftikhar","year":"2020","unstructured":"Iftikhar, M., Wang, Q., Lin, Yu.: dK-microaggregation: anonymizing graphs with differential privacy guarantees. 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. 12085, pp. 191\u2013203. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-47436-2_15"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Jorgensen, Z., Yu, T., Cormode, G.: Conservative or liberal? Personalized differential privacy. In: ICDE, pp. 1023\u20131034. IEEE (2015)","DOI":"10.1109\/ICDE.2015.7113353"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Jorgensen, Z., Yu, T., Cormode, G.: Publishing attributed social graphs with formal privacy guarantees. In: SIGMOD, pp. 107\u2013122 (2016)","DOI":"10.1145\/2882903.2915215"},{"issue":"3","key":"16_CR12","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1137\/090756090","volume":"40","author":"SP Kasiviswanathan","year":"2011","unstructured":"Kasiviswanathan, S.P., Lee, H.K., Nissim, K., Raskhodnikova, S., Smith, A.: What can we learn privately? SICOMP 40(3), 793\u2013826 (2011)","journal-title":"SICOMP"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Koufogiannis, F., Han, S., Pappas, G.J.: Gradual release of sensitive data under differential privacy. J. Priv. Confidentiality 7(2), 23\u201352 (2016)","DOI":"10.29012\/jpc.v7i2.649"},{"issue":"3","key":"16_CR14","first-page":"1027","volume":"5","author":"F Koufogiannis","year":"2017","unstructured":"Koufogiannis, F., Pappas, G.J.: Diffusing private data over networks. TCNS 5(3), 1027\u20131037 (2017)","journal-title":"TCNS"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.: What is twitter, a social network or a news media? In: WWW, pp. 591\u2013600 (2010)","DOI":"10.1145\/1772690.1772751"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/978-3-319-57454-7_48","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H Li","year":"2017","unstructured":"Li, H., Xiong, L., Ji, Z., Jiang, X.: Partitioning-Based Mechanisms Under Personalized Differential Privacy. In: Kim, J., Shim, K., Cao, L., Lee, J.-G., Lin, X., Moon, Y.-S. (eds.) PAKDD 2017. LNCS (LNAI), vol. 10234, pp. 615\u2013627. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57454-7_48"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Li, N., Qardaji, W., Su, D.: On sampling, anonymization, and differential privacy or, k-anonymization meets differential privacy. In: ASIACCS, pp. 32\u201333 (2012)","DOI":"10.1145\/2414456.2414474"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Lin, B.R., Wang, Y., Rane, S.: On the benefits of sampling in privacy preserving statistical analysis on distributed databases. CoRR, abs\/1304.4613 (2013)","DOI":"10.1109\/WIFS.2012.6412626"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Mahadevan, P., Hubble, C., Krioukov, D., Huffaker, B., Vahdat, A.: Orbis: rescaling degree correlations to generate annotated internet topologies. In: SIGCOMM, vol. 37, pp. 325\u2013336 (2007)","DOI":"10.1145\/1282427.1282417"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Mahadevan, P., Krioukov, D., Fall, K., Vahdat, A.: Systematic topology analysis and generation using degree correlations. In: SIGCOMM, pp. 135\u2013146 (2006)","DOI":"10.1145\/1151659.1159930"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"McSherry, F.D.: Privacy integrated queries: an extensible platform for privacy-preserving data analysis. In: SIGMOD, pp. 19\u201330 (2009)","DOI":"10.1145\/1559845.1559850"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Sala, A., Zhao, X., Wilson, C., Zheng, H., Zhao, B.Y.: Sharing graphs using differentially private graph models. In: SIGCOMM, pp. 81\u201398 (2011)","DOI":"10.1145\/2068816.2068825"},{"issue":"2","key":"16_CR23","first-page":"127","volume":"6","author":"Y Wang","year":"2013","unstructured":"Wang, Y., Wu, X.: Preserving differential privacy in degree-correlation based graph generation. TDP 6(2), 127\u2013145 (2013)","journal-title":"TDP"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-319-40253-6_9","volume-title":"Information Security and Privacy","author":"S Yan","year":"2016","unstructured":"Yan, S., Pan, S., Zhao, Y., Zhu, W.-T.: Towards privacy-preserving data mining in online social networks: distance-grained and item-grained differential privacy. In: Liu, J.K., Steinfeld, R. (eds.) ACISP 2016. LNCS, vol. 9722, pp. 141\u2013157. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40253-6_9"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-05933-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T01:07:35Z","timestamp":1654132055000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-05933-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031059322","9783031059339"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-05933-9_16","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":"10 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","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":"16 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/pakdd.net\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"558","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":"121","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":"22% - 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.75","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":"6.45","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)"}}]}}