{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,15]],"date-time":"2022-12-15T19:57:13Z","timestamp":1671134233683},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,10,5]],"date-time":"2014-10-05T00:00:00Z","timestamp":1412467200000},"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":["Knowl Inf Syst"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10115-014-0788-1","type":"journal-article","created":{"date-parts":[[2014,10,4]],"date-time":"2014-10-04T08:31:48Z","timestamp":1412411508000},"page":"571-588","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the anonymizability of graphs"],"prefix":"10.1007","volume":"45","author":[{"given":"Charu C.","family":"Aggarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,5]]},"reference":[{"key":"788_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Li Y, Yu P (2011) On the hardness of graph anonymization, ICDM conference","DOI":"10.1109\/ICDM.2011.112"},{"key":"788_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-70992-5","volume-title":"Privacy-preserving data mining: models and algorithms,","author":"CC Aggarwal","year":"2008","unstructured":"Aggarwal CC, Yu PS (2008) Privacy-preserving data mining: models and algorithms, Springer, Berlin"},{"key":"788_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (2000) Privacy-preserving data mining. ACM SIGMOD conference","DOI":"10.1145\/342009.335438"},{"key":"788_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal D, Aggarwal CC (2001) On the design and quantification of privacy preserving data mining algorithms. ACM PODS conference","DOI":"10.1145\/375551.375602"},{"key":"788_CR5","unstructured":"Ahuja R, Orlin J, Magnanti T (1992) Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs, NJ, USA"},{"key":"788_CR6","doi-asserted-by":"crossref","unstructured":"Backstrom L, Dwork C, Kleinberg J (2007)Wherefore Art Thou R3579X? Anonymized social networks, hidden patterns, and structural steganography. WWW conference","DOI":"10.1145\/1242572.1242598"},{"key":"788_CR7","unstructured":"Bayardo RJ, Agrawal R (2005) Data privacy through optimal k-anonymization. ICDE conference"},{"key":"788_CR8","doi-asserted-by":"crossref","unstructured":"Cormode G, Srivastava D, Yu T, Zhang Q (2008) Anonymizing bipartite graph data using safe groupings. VLDB conference","DOI":"10.14778\/1453856.1453947"},{"key":"788_CR9","doi-asserted-by":"crossref","unstructured":"Evfimievski A, Srikant R, Agrawal R, Gehrke J (2002) Privacy preserving mining of association rules. ACM KDD conference","DOI":"10.1145\/775047.775080"},{"key":"788_CR10","doi-asserted-by":"crossref","unstructured":"Fung B, Wang K, Yu PS (2007) Anonymizing classification data for privacy preservation. IEEE TKDE, pp 711\u2013725","DOI":"10.1109\/TKDE.2007.1015"},{"key":"788_CR11","unstructured":"Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of NP-completeness, Freeman"},{"key":"788_CR12","doi-asserted-by":"crossref","unstructured":"Hay M, Miklau G, Jensen D, Towsley D, Weis P (2008) Resisting structural re-identification in social networks, VLDB conference","DOI":"10.14778\/1453856.1453873"},{"key":"788_CR13","volume-title":"Anonymizing social networks. Technical report 07\u201319","author":"M Hay","year":"2007","unstructured":"Hay M, Miklau G, Jensen D, Weis P, Srivastava S (2007) Anonymizing social networks. Technical report 07\u201319. University of Massachusetts, Amherst"},{"key":"788_CR14","doi-asserted-by":"crossref","unstructured":"Kifer D, Gehrke J (2006) Injecting utility into anonymized datasets. SIGMOD conference, pp 217\u2013228","DOI":"10.1145\/1142473.1142499"},{"key":"788_CR15","doi-asserted-by":"crossref","unstructured":"LeFevre K, DeWitt D, Ramakrishnan R (2006) Mondrian multidimensional k-anonymity. ICDE conference","DOI":"10.1109\/ICDE.2006.101"},{"key":"788_CR16","doi-asserted-by":"crossref","unstructured":"Liu K, Terzi E (2008) Towards identity anonymization on graphs. ACM SIGMOD conference","DOI":"10.1145\/1376616.1376629"},{"key":"788_CR17","doi-asserted-by":"crossref","unstructured":"Machanavajjhala A A, Gehrke J, Kifer D, Venkitasubramaniam M (2006) l-Diversity: privacy beyond k-anonymity. ICDE conference","DOI":"10.1109\/ICDE.2006.1"},{"issue":"6","key":"788_CR18","first-page":"1010","volume":"13","author":"P Samarati","year":"2001","unstructured":"Samarati P (2001) Protecting respondents identities in microdata release. IEEE TKDE 13(6):1010\u20131027","journal-title":"IEEE TKDE"},{"key":"788_CR19","first-page":"311","volume":"25","author":"T Tassa","year":"2013","unstructured":"Tassa T, Cohen D (2013) Anonymization of centralized and distributed social networks by sequential clustering. IEEE TKDE 25:311\u2013324","journal-title":"IEEE TKDE"},{"key":"788_CR20","doi-asserted-by":"crossref","unstructured":"Vuokko N, Terzi E (2010) Reconstructing randomized social networks, SDM Conf.,","DOI":"10.1137\/1.9781611972801.5"},{"key":"788_CR21","doi-asserted-by":"crossref","unstructured":"Wu L, Ying X, Wu X (2010) Reconstruction from randomized graph via low rank approximation, SDM Conf.,","DOI":"10.1137\/1.9781611972801.6"},{"key":"788_CR22","doi-asserted-by":"crossref","unstructured":"Ying X, Wu X (2008) Randomizing social networks: a spectrum preserving approach. SDM conference","DOI":"10.1137\/1.9781611972788.67"},{"key":"788_CR23","doi-asserted-by":"crossref","unstructured":"Ying X, Pan K, Wu X, Guo L (2009) Comparisons of randomization and $$k$$ k -degree anonymization schemes for privacy-preserving social network publishing. ACM KDD Conference","DOI":"10.1145\/1731011.1731021"},{"key":"788_CR24","doi-asserted-by":"crossref","unstructured":"Zhou B, Pei J (2008) Preserving privacy in social networks against neighborhood attacks. ICDE conference","DOI":"10.1109\/ICDE.2008.4497459"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0788-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-014-0788-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0788-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T21:19:03Z","timestamp":1565903943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-014-0788-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,5]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["788"],"URL":"https:\/\/doi.org\/10.1007\/s10115-014-0788-1","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,5]]}}}