{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T22:08:55Z","timestamp":1726006135130},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030031008"},{"type":"electronic","value":"9783030031015"}],"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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-03101-5_19","type":"book-chapter","created":{"date-parts":[[2019,1,12]],"date-time":"2019-01-12T06:03:03Z","timestamp":1547272983000},"page":"224-239","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Hierarchical k-Anonymous Technique of Graphlet Structural Perception in Social Network Publishing"],"prefix":"10.1007","author":[{"given":"Dongran","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaxing","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li-e","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianxian","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,13]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"102","DOI":"10.14778\/1453856.1453873","volume":"1","author":"M Hay","year":"2008","unstructured":"Hay, M., Miklau, G., Jensen, D., Towsley, D.: Resisting structural re-identification in anonymized social networks. Proc. VLDB Endow. 1(1), 102\u2013114 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-01718-6_4","volume-title":"Privacy, Security, and Trust in KDD","author":"A Campan","year":"2009","unstructured":"Campan, A., Truta, T.M.: Data and structural k-anonymity in social networks. In: Bonchi, F., Ferrari, E., Jiang, W., Malin, B. (eds.) PInKDD 2008. LNCS, vol. 5456, pp. 33\u201354. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01718-6_4"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1109\/TKDE.2011.232","volume":"25","author":"T Tassa","year":"2012","unstructured":"Tassa, T., Cohen, D.: Anonymization of centralized and distributed social networks by sequential clustering. IEEE Trans. Knowl. Data Eng. 25(2), 311\u2013324 (2012)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"19_CR4","first-page":"766","volume":"2","author":"G Cormode","year":"2009","unstructured":"Cormode, G., Srivastava, D., Bhagat, S., Krishnamurthy, B.: Class-based graph anonymization for social network data. PVLDB 2(1), 766\u2013777 (2009)","journal-title":"PVLDB"},{"issue":"1","key":"19_CR5","first-page":"833","volume":"1","author":"G Cormode","year":"2008","unstructured":"Cormode, G., Srivastava, D., Yu, T., Zhang, Q.: Anonymizing bipartite graph data using safe groupings. PVLDB 1(1), 833\u2013844 (2008)","journal-title":"PVLDB"},{"key":"19_CR6","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"},{"doi-asserted-by":"crossref","unstructured":"Liu, K., Terzi, E.: Towards identity anonymization on graphs. In: SIGMOD Conference, pp. 93\u2013106 (2008)","key":"19_CR7","DOI":"10.1145\/1376616.1376629"},{"doi-asserted-by":"crossref","unstructured":"Zhou, B., Pei, J.: Preserving privacy in social networks against neighborhood attacks. In: ICDE, pp. 506\u2013515 (2008)","key":"19_CR8","DOI":"10.1109\/ICDE.2008.4497459"},{"doi-asserted-by":"crossref","unstructured":"Thompson, B., Yao, D.: The union-split algorithm and cluster-based anonymization of social networks. In: ASIACCS, pp. 218\u2013227 (2009)","key":"19_CR9","DOI":"10.1145\/1533057.1533088"},{"issue":"1","key":"19_CR10","first-page":"946","volume":"2","author":"L Zou","year":"2009","unstructured":"Zou, L., Chen, L., \u00d6zsu, M.T.: K-automorphism: a general framework for privacy preserving network publication. PVLDB 2(1), 946\u2013957 (2009)","journal-title":"PVLDB"},{"doi-asserted-by":"crossref","unstructured":"Wu, W., Xiao, Y., Wang, W., He, Z., Wang, Z.: k-symmetry model for identity anonymization in social networks. In: EDBT, pp. 111\u2013122 (2010)","key":"19_CR11","DOI":"10.1145\/1739041.1739058"},{"unstructured":"Hay, M., Miklau, G., Jensen, D., Weis, P., Srivastava, S.: Anonymizing social networks. University of Massachusetts, Technical report 07-19 (2007)","key":"19_CR12"},{"doi-asserted-by":"crossref","unstructured":"Ying, X., Pan, K., Wu, X., Guo, L.: Comparisons of randomization and k-degree anonymization schemes for privacy preserving social network publishing. In: SNA-KDD, pp. 1\u201310 (2009)","key":"19_CR13","DOI":"10.1145\/1731011.1731021"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10115-016-0947-7","volume":"50","author":"J Casas-Roma","year":"2017","unstructured":"Casas-Roma, J., Herrera-Joancomart\u00ed, J., Torra, V.: k-degree anonymity and edge selection: improving data utility in large networks. Knowl. Inf. Syst. 50, 447 (2017)","journal-title":"Knowl. Inf. Syst."},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N Alon","year":"1997","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17(3), 209\u2013223 (1997)","journal-title":"Algorithmica"},{"issue":"4","key":"19_CR16","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/316194.316229","volume":"29","author":"Michalis Faloutsos","year":"1999","unstructured":"Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationship of the internet topology. In: ACM SIGCOMM. ACM Press, Cambridge (1999)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"unstructured":"Wang, H.: Research on anonymous method of effectively preserving the community structure for social network data publication. Guangxi Normal University, Guilin (2016)","key":"19_CR17"},{"doi-asserted-by":"crossref","unstructured":"Task, C., Clifton, C.: A guide to differential privacy theory in social network analysis. In: IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 411\u2013417. IEEE (2013)","key":"19_CR18","DOI":"10.1109\/ASONAM.2012.73"},{"issue":"6295","key":"19_CR19","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"AR Benson","year":"2016","unstructured":"Benson, A.R., Gleich, D.F., Leskovec, J.: Higher-order organization of complex networks. Science 353(6295), 163\u2013166 (2016)","journal-title":"Science"},{"key":"19_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications, vol. 8. Cambridge University Press, Cambridge (1994)"},{"issue":"6","key":"19_CR21","doi-asserted-by":"publisher","first-page":"3290","DOI":"10.1109\/TIT.2016.2555904","volume":"62","author":"A Li","year":"2016","unstructured":"Li, A., Pan, Y.: Structural information and dynamical complexity of networks. IEEE Trans. Inf. Theory 62(6), 3290\u20133339 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"unstructured":"http:\/\/linqs.umiacs.umd.edu\/projects\/\/projects\/lbc\/index.html","key":"19_CR22"}],"container-title":["Lecture Notes in Computer Science","Mobile, Secure, and Programmable Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03101-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T02:41:49Z","timestamp":1573699309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03101-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030031008","9783030031015"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03101-5_19","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":"13 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MSPN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mobile, Secure, and Programmable Networking","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mspn2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.adda-association.org\/mspn\/Home.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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"52","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"27","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"52% - 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"}},{"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"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}