{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:03:50Z","timestamp":1742987030557,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319143781"},{"type":"electronic","value":"9783319143798"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14379-8_5","type":"book-chapter","created":{"date-parts":[[2015,2,12]],"date-time":"2015-02-12T11:30:22Z","timestamp":1423740622000},"page":"77-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Anonymizing Social Network Data for Maximal Frequent-Sharing Pattern Mining"],"prefix":"10.1007","author":[{"given":"Benjamin C. M.","family":"Fung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan\u2019an","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junqiang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,13]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal D, Aggarwal CC (2001) On the design and quantification of privacy preserving data mining algorithms. In: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems, pp 247\u2013255","DOI":"10.1145\/375551.375602"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (2000) Privacy-preserving data mining. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 439\u2013450","DOI":"10.1145\/335191.335438"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Backstrom L, Dwork C, Kleinberg J (2007) Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In: Proceedings of the 16th international conference on world wide web, pp 181\u2013190","DOI":"10.1145\/1242572.1242598"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Bonchi F, Gionis A, Tassa T (2011) Identity obfuscation in graphs through the information theoretic lens. In: Proceedings of the 27th IEEE international conference on data engineering (ICDE), pp 924\u2013935","DOI":"10.1109\/ICDE.2011.5767905"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Burdick D, Calimlim M, Gehrke J (2001) Mafia: a maximal frequent itemset algorithm for transactional databases. In: Proceedings of the 17th international conference on data engineering, pp 443\u2013452","DOI":"10.1109\/ICDE.2001.914857"},{"key":"5_CR6","unstructured":"Campan A, Truta TM (2008) A clustering approach for data and structural anonymity in social networks. In: Proceedings of the 2nd ACM SIGKDD international workshop on privacy, security, and trust in KDD workshop, pp 1\u201310"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Cheng J, Wai-Chee Fu A, Liu J (2010) K-isomorphism: privacy preserving network publication against structural attacks. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 459\u2013470","DOI":"10.1145\/1807167.1807218"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the internet topology. In: Proceedings of the conference on applications, technologies, architectures, and protocols for computer communication, pp 251\u2013262","DOI":"10.1145\/316194.316229"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Fukuzaki M, Seki M, Kashima H, Sese J (2010) Finding itemset-sharing patterns in a large itemset-associated graph. In Proceedings of the 14th Pacific-Asia conference on advances in knowledge discovery and data mining, pp 147\u2013159","DOI":"10.1007\/978-3-642-13672-6_15"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Fung BCM, Jin Y, Li J (2013). Preserving privacy and frequent sharing patterns for social network data publishing. In: Proceedings of the 5th IEEE\/ACM international conference on social networks analysis and mining (ASONAM), Niagara Falls, Canada, pp 479\u2013485","DOI":"10.1145\/2492517.2492603"},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/1749603.1749605","volume":"42","author":"BCM Fung","year":"2010","unstructured":"Fung BCM, Wang K, Chen R, Yu PS (2010) Privacy-preserving data publishing: a survey of recent developments. ACM Comput Surv 42(4):14:1\u201314:53","journal-title":"ACM Comput Surv"},{"key":"5_CR12","volume-title":"Data mining and knowledge discovery","author":"BCM Fung","year":"2010","unstructured":"Fung BCM, Wang K, Wai-Chee Fu A, Yu PS (2010) Introduction to privacy-preserving data publishing: concepts and techniques. Data mining and knowledge discovery. Chapman & Hall\/CRC, Boca Raton"},{"key":"5_CR13","volume-title":"Computers and intractability; a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability; a guide to the theory of NP-completeness. W. H. Freeman and Company, New York"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Hanhij\u00e4rvi S, Garriga GC, Puolam\u00e4ki K (2009) Randomization techniques for graphs. In: Proceedings of the 9th SIAM international conference on data mining (SDM), pp 780\u2013791","DOI":"10.1137\/1.9781611972795.67"},{"issue":"1","key":"5_CR15","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, Weis P (2008) Resisting structural re-identification in anonymized social networks. Proc VLDB Endow 1(1):102\u2013114","journal-title":"Proc VLDB Endow"},{"key":"5_CR16","unstructured":"Hay M, Miklau G, Jensen D, Weis P, Srivastava S (2007) Anonymizing social networks. Technical Report 07\u201319, Computer Science Department, University of Massachusetts Amherst"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Korolova A, Motwani R, Nabar SU, Xu Y (2008) Link privacy in social networks. In: Proceedings of the 17th ACM Conference on information and knowledge management, pp 289\u2013298","DOI":"10.1145\/1458082.1458123"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data (TKDD), vol 1","DOI":"10.1145\/1217299.1217301"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Wu XYL, Wu X (2010) Reconstruction from randomized graph via low rank approximation. In: Proceedings of the 10th SIAM international conference on data mining, pp 60\u201371","DOI":"10.1137\/1.9781611972801.6"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Liu K, Terzi E (2008) Towards identity anonymization graphs. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 93\u2013106","DOI":"10.1145\/1376616.1376629"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Machanavajjhala A, Kifer D, Gehrke J, Venkitasubramaniam M (2007) L-diversity: privacy beyond k-anonymity. ACM Trans Knowl Discov Data (TKDD), vol 1","DOI":"10.1145\/1217299.1217302"},{"issue":"4","key":"5_CR22","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s00778-010-0214-6","volume":"20","author":"N Mohammed","year":"2011","unstructured":"Mohammed N, Fung BCM, Debbabi M (2011) Anonymity meets game theory: secure data integration with malicious participants. Very Large Data Bases J (VLDBJ) 20(4):567\u2013-588","journal-title":"Very Large Data Bases J (VLDBJ)"},{"issue":"4","key":"5_CR23","first-page":"18:1","volume":"4","author":"N Mohammed","year":"2010","unstructured":"Mohammed N, Fung BCM, Hung PCK, Lee C-K (2010) Centralized and distributed anonymization for high-dimensional healthcare data. ACM Trans Knowl Discov Data (TKDD) 4(4):18:1\u201318:33","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Narayanan A, Shmatikov V (2009) De-anonymizing social networks. In: Proceedings of the IEEE symposium on security and privacy (S&P)","DOI":"10.1109\/SP.2009.22"},{"issue":"6","key":"5_CR25","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1109\/69.971193","volume":"13","author":"P Samarati","year":"2001","unstructured":"Samarati P (2001) Protecting respondents privacy in microdata release. IEEE Trans Knowl Data Eng 13(6):1010\u20131027","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"5_CR26","unstructured":"Pierangela S, Latanya S (1998) Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. Technical report, SRI International"},{"issue":"5","key":"5_CR27","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney L (2002) k-anonymity: a model for protecting privacy. Int J Uncertain Fuzziness Knowl-based Syst 10(5):557\u2013570","journal-title":"Int J Uncertain Fuzziness Knowl-based Syst"},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10115-006-0035-5","volume":"11","author":"K Wang","year":"2007","unstructured":"Wang K, Fung BCM, Yu PS (2007) Handicapping attacker\u2019s confidence. Knowl Inf Syst 11:345\u2013368","journal-title":"Knowl Inf Syst"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Wu W, Xiao Y, Wang W, He Z, Wang Z (2010) K-symmetry model for identity anonymization in social networks. In: Proceedings of the 13th international conference on extending database technology (EDBT)","DOI":"10.1145\/1739041.1739058"},{"key":"5_CR30","volume-title":"A survey of algorithms for privacy-preservation of graphs and social networks, chapter managing and mining graph data","author":"X Wu","year":"2009","unstructured":"Wu X, Ying X, Liu K, Chen L (2009) A survey of algorithms for privacy-preservation of graphs and social networks, chapter managing and mining graph data. Kluwer Academic Publishers, The Netherlands"},{"key":"5_CR31","unstructured":"Yan X, Han J (2002) gSpan: graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE international conference on data mining (ICDM), pp 721\u2013724"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Ying X, Wu X (2008) Randomizing social networks: a spectrum preserving approach. In: Proceedings of the 8th SIAM international conference on data mining (ICDM), pp 739\u2013750","DOI":"10.1137\/1.9781611972788.67"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Ying X, Wu X (2009) Graph generation with prescribed feature constraints. In: Proceedings of the 9th SIAM international conference on data mining, pp 966\u2013977","DOI":"10.1137\/1.9781611972795.83"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Zhang L, Zhang W (2009) Edge anonymity in social network graphs. In: Proceedings of the 2009 international conference on computational science and engineering, pp 1\u20138","DOI":"10.1109\/CSE.2009.310"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Zheleva E, Getoor L (2007) Preserving the privacy of sensitive relationships in graph data. In: Proceedings of the 1st ACM SIGKDD international workshop on privacy, security, and trust, pp 153\u2013171","DOI":"10.1007\/978-3-540-78478-4_9"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Zhou B, Pei J (2008) Preserving privacy in social networks against neighborhood attacks. In: Proceedings of the 2008 IEEE 24th international conference on data engineering, pp 506\u2013515","DOI":"10.1109\/ICDE.2008.4497459"},{"issue":"1","key":"5_CR37","doi-asserted-by":"publisher","first-page":"946","DOI":"10.14778\/1687627.1687734","volume":"2","author":"L Zou","year":"2009","unstructured":"Zou L, Chen L, Tamer \u00d6zsu M (2009) K-automorphism: a general framework for privacy preserving network publication. Proc VLDB Endow 2(1):946\u2013957","journal-title":"Proc VLDB Endow"}],"container-title":["Lecture Notes in Social Networks","Recommendation and Search in Social Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14379-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T07:22:31Z","timestamp":1676013751000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-14379-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319143781","9783319143798"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14379-8_5","relation":{},"ISSN":["2190-5428","2190-5436"],"issn-type":[{"type":"print","value":"2190-5428"},{"type":"electronic","value":"2190-5436"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}