{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:09:02Z","timestamp":1743106142218,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030267629"},{"type":"electronic","value":"9783030267636"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26763-6_38","type":"book-chapter","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T23:18:04Z","timestamp":1564442284000},"page":"388-399","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Privacy Preservation Based on Key Attribute and Structure Generalization of Social Network for Medical Data Publication"],"prefix":"10.1007","author":[{"given":"Jie","family":"Su","sequence":"first","affiliation":[]},{"given":"Yi","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Yuehui","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"issue":"3","key":"38_CR1","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1136\/amiajnl-2012-001027","volume":"20","author":"N Mohammed","year":"2013","unstructured":"Mohammed, N., Jiang, X., Chen, R., et al.: Privacy-preserving heterogeneous health data sharing. J. Am. Med. Inform. Assoc. 20(3), 462\u2013469 (2013)","journal-title":"J. Am. Med. Inform. Assoc."},{"key":"38_CR2","first-page":"265","volume":"52","author":"X Meng","year":"2015","unstructured":"Meng, X., Zhang, X.: Big data privacy management. J. Comput. Res. Dev. 52, 265\u2013281 (2015)","journal-title":"J. Comput. Res. Dev."},{"issue":"5","key":"38_CR3","first-page":"1392","volume":"44","author":"Z-Y Luo","year":"2014","unstructured":"Luo, Z.-Y., You, B., Xu, J.-Z., Liang, Y.: Automatic recognition model of intrusive intention based on three layers attack graph. J. Jilin Univ. 44(5), 1392\u20131397 (2014)","journal-title":"J. Jilin Univ."},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Campan, A., Traian, M.: A clustering approach for data and structural anonymity in social networks. In: Privacy, Security, and Trust in KDD Workshop (PinKDD), pp. 33\u201354 (2008)","DOI":"10.1007\/978-3-642-01718-6_4"},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-78478-4_9","volume-title":"Privacy, Security, and Trust in KDD","author":"E Zheleva","year":"2008","unstructured":"Zheleva, E., Getoor, L.: Preserving the privacy of sensitive relationships in graph data. In: Bonchi, F., Ferrari, E., Malin, B., Saygin, Y. (eds.) PInKDD 2007. LNCS, vol. 4890, pp. 153\u2013171. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78478-4_9"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Li, Y., Yu, P.S.: On the hardness of graph anonymization, pp. 1002\u20131007 (2011)","DOI":"10.1109\/ICDM.2011.112"},{"key":"38_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-01718-6_4","volume-title":"Social Network Data Analytics","author":"A Campan","year":"2008","unstructured":"Campan, A., Truta, T.M.: Data and structural k -anonymity in social networks. In: Aggarwal, C. (ed.) Social Network Data Analytics. LNCS, vol. 5456, pp. 33\u201354. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-642-01718-6_4"},{"issue":"4","key":"38_CR8","doi-asserted-by":"publisher","first-page":"2623","DOI":"10.1145\/1749603.1749605","volume":"42","author":"BCM Fung","year":"2010","unstructured":"Fung, B.C.M., Wang, K., Chen, R., et al.: Privacy-preserving data publishing: a survey of recent developments. ACM Comput. Surv. 42(4), 2623\u20132627 (2010)","journal-title":"ACM Comput. Surv."},{"key":"38_CR9","unstructured":"Standards for privacy of individually identifiable health information. Final Rule, 45 CFR parts 160 and 164. http:\/\/www.hhs.gov\/ocr\/privacy\/hipaa\/administrative\/privacyrule\/adminsimpregtext.pdf. Accessed 20 Feb 2012"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 93\u2013106. ACM (2008)","DOI":"10.1145\/1376616.1376629"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Cheng, J., Fu, A.W., Liu, J.: K-isomorphism: privacy preserving network publication against structural attacks. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, pp. 459\u2013470. ACM (2016)","DOI":"10.1145\/1807167.1807218"},{"issue":"6","key":"38_CR12","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s00778-010-0210-x","volume":"19","author":"M Hay","year":"2010","unstructured":"Hay, M., Miklau, G., Jensen, D., et al.: Resisting structural re-identification in anonymized social networks. VLDB J. 19(6), 97\u2013823 (2010)","journal-title":"VLDB J."},{"key":"38_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-71703-4_18","volume-title":"Advances in Databases: Concepts, Systems and Applications","author":"J-W Byun","year":"2007","unstructured":"Byun, J.-W., Kamra, A., Bertino, E., Li, N.: Efficient k-anonymization using clustering techniques. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 188\u2013200. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71703-4_18"},{"key":"38_CR14","volume-title":"Data Mining: Concepts and Techniques","author":"J Han","year":"1999","unstructured":"Han, J., Pei, J., Kamber, M.: Data Mining: Concepts and Techniques. Elsevier, Amsterdam (1999)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26763-6_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,16]],"date-time":"2021-04-16T09:45:04Z","timestamp":1618566304000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26763-6_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030267629","9783030267636"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26763-6_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanchang","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2019\/index.htm","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":"ICIC Website","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"609","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":"217","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.43","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}