{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T17:53:18Z","timestamp":1762624398265,"version":"3.37.3"},"reference-count":82,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["2018YFB0904900","2018YFB0904905"],"award-info":[{"award-number":["2018YFB0904900","2018YFB0904905"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61802039","61772091","61772098","61802035"],"award-info":[{"award-number":["61802039","61772091","61772098","61802035"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007957","name":"Science and Technology Research Program of Chongqing Municipal Education Commission","doi-asserted-by":"publisher","award":["KJQN201800630"],"award-info":[{"award-number":["KJQN201800630"]}],"id":[{"id":"10.13039\/501100007957","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Innovative Talents Program","award":["BYJS201811"],"award-info":[{"award-number":["BYJS201811"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2995568","type":"journal-article","created":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T20:49:58Z","timestamp":1589921398000},"page":"94575-94593","source":"Crossref","is-referenced-by-count":9,"title":["Multi-View Low-Rank Coding-Based Network Data De-Anonymization"],"prefix":"10.1109","volume":"8","author":[{"given":"Xingping","family":"Xian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8166-2089","authenticated-orcid":false,"given":"Tao","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaojie","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4088-5395","authenticated-orcid":false,"given":"Wei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanbing","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nan","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2011.6033446"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2462023"},{"key":"ref71","article-title":"The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"lin","year":"2010","journal-title":"ArXiv 1009 5055"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/117\/38002"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.03.011"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736720"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2700836"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13257-0_14"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1016\/S0375-9601(99)00757-4"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.046110"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105800"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2565898"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.5"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.6"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660324"},{"key":"ref36","first-page":"303","article-title":"SecGraph: A uniform and open-source evaluation system for graph data anonymization and de-anonymization","author":"ji","year":"2015","journal-title":"Proc 24th USENIX Secur Symp (USENIX Security)"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2577036"},{"key":"ref34","first-page":"663","article-title":"Robust subspace segmentation by low-rank representation","author":"liu","year":"2010","journal-title":"Proc 27th Int Conf Mach Learn (ICML)"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2017.02.007"},{"key":"ref62","first-page":"1673","article-title":"Convex multi-view subspace learning","author":"white","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref61","first-page":"1413","article-title":"Co-regularized multi-view spectral clustering","author":"kumar","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref28","article-title":"Towards plausible graph anonymization","author":"zhang","year":"2017","journal-title":"arXiv 1711 05441"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32597-7_46"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20591"},{"key":"ref64","first-page":"910","article-title":"Checking for k-anonymity violation by views","author":"yao","year":"2005","journal-title":"Proc Int Conf On Very Large Data Bases"},{"key":"ref65","first-page":"1","article-title":"Anonymizing social networks","author":"hay","year":"2007"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.02.008"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-4139-7_9"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"ref68","doi-asserted-by":"crossref","first-page":"2325","DOI":"10.1073\/pnas.1424644112","article-title":"Toward link predictability of complex networks","volume":"112","author":"l\u00fc","year":"2015","journal-title":"Proc Nat Acad Sci USA"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.09.024"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11267"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961194"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1731011.1731021"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660278"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3209542.3209552"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2633620"},{"key":"ref23","article-title":"Quantifying privacy vulnerability to socialbot attacks: An adaptive non-submodular model","author":"li","year":"2018","journal-title":"IEEE Trans Emerg Topics Comput"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133972"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242598"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.14778\/2732296.2732300"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623642"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-010-0353-5"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2784430"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2529591"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/2894760"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2009.22"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3139550.3139562"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/3068777.3068781"},{"key":"ref52","first-page":"689","article-title":"De-anonymizing users across heterogeneous social computing platforms","author":"korayem","year":"2013","journal-title":"Proc AAAI Conf on Weblogs and Social Media"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2017.2721444"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-010-0311-2"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1749603.1749605"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2016.2533668"},{"key":"ref13","first-page":"1","article-title":"A survey of graph-modification techniques for privacy-preserving on networks","volume":"47","author":"casas-roma","year":"2016","journal-title":"Artif Intell Rev"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247610"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-013-0240-6"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0033"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807218"},{"key":"ref81","first-page":"539","article-title":"Learning to discover social circles in ego networks","author":"leskovec","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CSE.2009.310"},{"key":"ref18","first-page":"153","article-title":"Preserving the privacy of sensitive relationships in graph data","author":"zheleva","year":"2007","journal-title":"Proc Int Workshop Privacy Secur Trust (KDD)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.232"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2803818"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2015.12.073"},{"key":"ref6","first-page":"1","article-title":"The browsemaps: Collaborative filtering at linkedin","author":"wu","year":"2014","journal-title":"Proc 6th Workshop Recommender Systems Social Web"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2017.11.006"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2015.2406877"},{"key":"ref49","first-page":"127","article-title":"Preserving differential privacy in degree-correlation based graph generation","volume":"6","author":"wang","year":"2013","journal-title":"Trans Data Privacy"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2014.2346813"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2013.128"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972788.67"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687734"},{"article-title":"Privacy preserving in social networks against sensitive edge disclosure","year":"2008","author":"lian","key":"ref48"},{"key":"ref47","first-page":"1","article-title":"Preserving link privacy in social network based systems","volume":"abs 1208 6189","author":"mittal","year":"2013","journal-title":"CoRR"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2697856"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1002\/sec.840"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687714"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s41650-017-0014-x"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09096307.pdf?arnumber=9096307","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:52:08Z","timestamp":1639770728000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9096307\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":82,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2995568","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}