{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T08:35:50Z","timestamp":1773304550040,"version":"3.50.1"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502047"],"award-info":[{"award-number":["61502047"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006093","name":"Patient-Centered Outcomes Research Institute","doi-asserted-by":"publisher","award":["ME-1310-07058"],"award-info":[{"award-number":["ME-1310-07058"]}],"id":[{"id":"10.13039\/100006093","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Institute of Health","award":["R01GM114612"],"award-info":[{"award-number":["R01GM114612"]}]},{"name":"National Institute of Health","award":["R01GM118609"],"award-info":[{"award-number":["R01GM118609"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2018,8,1]]},"DOI":"10.1109\/tkde.2018.2793862","type":"journal-article","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T19:09:10Z","timestamp":1516043350000},"page":"1411-1425","source":"Crossref","is-referenced-by-count":32,"title":["A Two-Phase Algorithm for Differentially Private Frequent Subgraph Mining"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6556-2264","authenticated-orcid":false,"given":"Xiang","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Sen","family":"Su","sequence":"additional","affiliation":[]},{"given":"Shengzhi","family":"Xu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7354-0428","authenticated-orcid":false,"given":"Li","family":"Xiong","sequence":"additional","affiliation":[]},{"given":"Ke","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Mingxing","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","year":"2018"},{"key":"ref30","year":"2018"},{"key":"ref10","first-page":"303","article-title":"SecGraph: A uniform and open-source evaluation system for graph data anonymization and\n de-anonymization","author":"ji","year":"2015","journal-title":"Proc 24th USENIX Conf Security Symp"},{"key":"ref11","first-page":"265","article-title":"Calibrating noise to sensitivity in\n private data analysis","author":"dwork","year":"2006","journal-title":"Cryptography"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2014.12.005"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2399310"},{"key":"ref15","first-page":"475","article-title":"Differentially private\n synthesization of multi-dimensional data using copula functions","author":"li","year":"2014","journal-title":"Proc Int Conf Extending Database Technol"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623723"},{"key":"ref17","article-title":"On the privacy properties of variants on the sparse vector technique","author":"chen","year":"2015","journal-title":"CoRR"},{"key":"ref18","first-page":"269","article-title":"A two-phase algorithm for msining sequential patterns with differential privacy","author":"bonomi","year":"2013","journal-title":"Proc 2nd IEEE Int Conf Ind Info"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2015.08.005"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.1"},{"key":"ref27","first-page":"487","article-title":"Fast algorithms for mining association rules in large databases","author":"agrawal","year":"1994","journal-title":"Proc 20th Int Conf Very Large Data Bases"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.66"},{"key":"ref29","year":"2018"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487601"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14778\/2428536.2428539"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350251"},{"key":"ref2","first-page":"1","article-title":"Differential privacy","author":"dwork","year":"2006","journal-title":"Proc Int Colloq Automata Lang Program"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113354"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835869"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.14778\/3402707.3402749","article-title":"Private analysis of graph structure","author":"karwa","year":"2011","journal-title":"Proc VLDB Endowment"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/2732296.2732300"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465304"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498243"},{"key":"ref23","first-page":"731","article-title":"Private release of graph statistics using ladder functions","author":"zhang","year":"2015","journal-title":"Proc ACM SIGMOD Int Conf Manage Data"},{"key":"ref26","author":"gary","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.33"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8405649\/08259370.pdf?arnumber=8259370","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T10:30:02Z","timestamp":1643193002000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8259370\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,1]]},"references-count":31,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2793862","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,1]]}}}