{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T14:25:16Z","timestamp":1769696716970,"version":"3.49.0"},"reference-count":36,"publisher":"Tech Science Press","issue":"2","license":[{"start":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T00:00:00Z","timestamp":1740268800000},"content-version":"vor","delay-in-days":53,"URL":"https:\/\/doi.org\/10.32604\/TSP-CROSSMARKPOLICY"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["CMC"],"published-print":{"date-parts":[[2025]]},"DOI":"10.32604\/cmc.2024.059201","type":"journal-article","created":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T02:24:36Z","timestamp":1734920676000},"page":"3131-3159","update-policy":"https:\/\/doi.org\/10.32604\/tsp-crossmarkpolicy","source":"Crossref","is-referenced-by-count":2,"title":["A Dynamic Social Network Graph Anonymity Scheme with Community Structure Protection"],"prefix":"10.32604","volume":"82","author":[{"given":"Yuanjing","family":"Hao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingmeng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"17807","published-online":{"date-parts":[[2025]]},"reference":[{"key":"ref1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s13278-011-0038-4","article-title":"New forms of social and professional digital relationships: The case of Facebook","volume":"2","author":"Ferri","year":"2012","journal-title":"Soc. Netw. Anal. Min."},{"key":"ref2","first-page":"1","article-title":"Private graph data release: A survey","volume":"55","author":"Li","year":"2023","journal-title":"ACM Comput. Surv."},{"key":"ref3","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/978-3-030-57878-7_6","volume":"12147","author":"Hoang","year":"2020","journal-title":"Applied Cryptography and Network Security"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2019.112968","article-title":"Combined fuzzy clustering and firefly algorithm for privacy preserving in social networks","volume":"141","author":"Langari","year":"2020, Art. no. 112968","journal-title":"Expert. Syst. Appl."},{"key":"ref5","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1109\/TNSM.2020.2982555","article-title":"Privacy-preserving approach PBCN in social network with differential privacy","volume":"17","author":"Huang","year":"2020","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"ref6","doi-asserted-by":"crossref","first-page":"4164","DOI":"10.1109\/TKDE.2021.3128946","article-title":"Publishing graphs under node differential privacy","volume":"35","author":"Jian","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1016\/j.cose.2022.102967","article-title":"GC-NLDP: A graph clustering algorithm with local differential privacy","volume":"124","author":"Fu","year":"2023, Art. no. 102967","journal-title":"Comput. Secur."},{"key":"ref8","first-page":"1","article-title":"Time-aware anonymization of knowledge graphs","volume":"26","author":"Hoang","year":"2022","journal-title":"ACM Trans. Priv. Secur."},{"key":"ref9","series-title":"37th IEEE Int. Conf. Data Eng. (ICDE)","first-page":"2021","article-title":"Privacy-preserving sequential publishing of knowledge graphs","author":"Hoang","year":"2021"},{"key":"ref10","first-page":"1400","author":"Zhang","year":"2020","journal-title":"20th IEEE Int. Conf. Data Min. (ICDM)"},{"key":"ref11","series-title":"38th IEEE Int. Conf. Data Eng. (ICDE)","first-page":"1982","article-title":"Efficient learning-based community-preserving graph generation","author":"Xiang","year":"2022"},{"key":"ref12","article-title":"A novel robust memetic algorithm for dynamic community structures detection in complex networks","volume":"27","author":"Ranjkesh","year":"2024","journal-title":"World Wide Web (WWW)"},{"key":"ref13","series-title":"IEEE Symp. Comput.","first-page":"1","article-title":"TKDA: An improved method for k-degree anonymity in social graphs","author":"Xiang","year":"2022","journal-title":"Commun. (ISCC)"},{"key":"ref14","article-title":"Towards publishing directed social network data with k-degree anonymization","volume":"34","author":"Lin","year":"2022","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"ref15","article-title":"k-anonymization of social network data using neural network and SVM: K-neurosvm","volume":"72","author":"Kaur","year":"2023, Art. no. 103382","journal-title":"J. Inf. Secur. Appl."},{"key":"ref16","first-page":"459","author":"Cheng","year":"2010","journal-title":"Proc. ACM SIGMOD Int. Conf. Manage. Data (SIGMOD)"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1016\/j.jnca.2021.103214","article-title":"Graph partition based privacy-preserving scheme in social networks","volume":"195","author":"Zhang","year":"2021, Art. no. 103214","journal-title":"J. Netw. Comput. Appl."},{"key":"ref18","volume":"2022","author":"Ren","year":"2022, Art. no. 7187528","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"ref19","doi-asserted-by":"crossref","first-page":"946","DOI":"10.14778\/1687627.1687734","article-title":"K-automorphism: A general framework for privacy preserving network publication","volume":"2","author":"Zou","year":"2009","journal-title":"Proc. VLDB Endow."},{"key":"ref20","doi-asserted-by":"crossref","first-page":"108371","DOI":"10.1109\/ACCESS.2019.2933151","article-title":"Large-scale dynamic social network directed graph K-in&out-degree anonymity algorithm for protecting community structure","volume":"7","author":"Zhang","year":"2019","journal-title":"IEEE Access"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"9102","DOI":"10.1109\/TKDE.2022.3221333","volume":"35","author":"Ren","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref22","article-title":"No more privacy concern: A privacy-chain based holomorphic encryption scheme and statistical method for privacy preservation of user\u2019s private and sensitive data","volume":"234","author":"Kumar","year":"2023, Art. no. 121071","journal-title":"Expert. Syst. Appl."},{"key":"ref23","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","article-title":"k-anonymity: A model for protecting privacy","volume":"10","author":"Sweeney","year":"2002","journal-title":"Int. J. Uncertain. Fuzziness Knowl. Based Syst."},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2022.127315","article-title":"Dynamic community detection based on the matthew effect","volume":"597","author":"Sun","year":"2022, Art. no. 127315","journal-title":"Physica A"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","article-title":"A fast and high quality multilevel scheme for partitioning irregular graphs","volume":"20","author":"Karypis","year":"1998","journal-title":"SIAM J. Sci. Comput."},{"key":"ref26","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/j.eswa.2019.01.059","article-title":"TSRAM: A time-saving k-degree anonymization method in social network","volume":"125","author":"Kiabod","year":"2019","journal-title":"Expert. Syst. Appl."},{"key":"ref27","doi-asserted-by":"crossref","DOI":"10.1145\/1217299.1217301","article-title":"Graph evolution: Densification and shrinking diameters","volume":"1","author":"Leskovec","year":"2007","journal-title":"ACM Trans. Knowl. Discov. Data."},{"key":"ref28","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.jtbi.2010.11.033","article-title":"What\u2019s in a crowd? analysis of face-to-face behavioral networks","volume":"271","author":"Isella","year":"2011","journal-title":"J. Theor. Biol."},{"key":"ref29","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1145\/3018661.3018731","author":"Paranjape","year":"2017","journal-title":"Proc. Tenth ACM Int. Conf. Web Search Data Min. (WSDM)"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1002\/asi.21015","article-title":"Patterns and dynamics of users\u2019 behavior and interaction: Network analysis of an online community","volume":"60","author":"Panzarasa","year":"2009","journal-title":"J. Assoc. Inf. Sci. Technol."},{"key":"ref31","doi-asserted-by":"crossref","DOI":"10.1088\/1742-5468\/2005\/09\/P09008","article-title":"Comparing community structure identification","volume":"2005","author":"Danon","year":"2005, Art. no. P09008","journal-title":"J. Stat. Mech."},{"key":"ref32","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01908075","article-title":"Comparing partitions","volume":"2","author":"Hubert","year":"1985","journal-title":"J. Classif."},{"key":"ref33","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","article-title":"Objective criteria for the evaluation of clustering methods","volume":"66","author":"Rand","year":"1971","journal-title":"J. Am. Stat. Assoc."},{"key":"ref34","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115148","article-title":"A fast graph modification method for social network anonymization","volume":"180","author":"Kiabod","year":"2021, Art. no. 115148","journal-title":"Expert. Syst. Appl."},{"key":"ref35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3168389","article-title":"Technical privacy metrics: A systematic survey","volume":"51","author":"Wagner","year":"2018","journal-title":"ACM Comput. Surv."},{"key":"ref36","doi-asserted-by":"crossref","DOI":"10.1007\/s11704-023-2759-8","article-title":"MLDA: A multi-level k-degree anonymity scheme on directed social network graphs","volume":"18","author":"Hao","year":"2024, Art. no. 182814","journal-title":"Front. Comput. Sci."}],"container-title":["Computers, Materials & Continua"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/cdn.techscience.cn\/files\/cmc\/2025\/TSP_CMC-82-2\/TSP_CMC_59201\/TSP_CMC_59201.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T06:11:34Z","timestamp":1763100694000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.techscience.com\/cmc\/v82n2\/59493"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":36,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025]]},"published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.32604\/cmc.2024.059201","relation":{},"ISSN":["1546-2226"],"issn-type":[{"value":"1546-2226","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"2024-09-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-11-26","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-17","order":2,"name":"published","label":"Published Online","group":{"name":"publication_history","label":"Publication History"}}]}}