{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T09:22:59Z","timestamp":1775899379506,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":35,"publisher":"Springer Singapore","isbn-type":[{"value":"9789811507571","type":"print"},{"value":"9789811507588","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-981-15-0758-8_17","type":"book-chapter","created":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T17:47:53Z","timestamp":1571852873000},"page":"223-237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Greedily Remove k Links to Hide Important Individuals in Social Network"],"prefix":"10.1007","author":[{"given":"Jie","family":"Ji","sequence":"first","affiliation":[]},{"given":"Guohua","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Chenjian","family":"Duan","sequence":"additional","affiliation":[]},{"given":"Yizhi","family":"Ren","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3399-5281","authenticated-orcid":false,"given":"Zhen","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,24]]},"reference":[{"issue":"5439","key":"17_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/bs.3830100205","volume":"10","author":"MA Beauchamp","year":"1965","unstructured":"Beauchamp, M.A.: An improved index of centrality. Behav. Sci. 10(2), 161\u2013163 (1965)","journal-title":"Behav. Sci."},{"key":"17_CR3","unstructured":"Bergamini, E., Borassi, M., Crescenzi, P., Marino, A., Meyerhenke, H.: Computing top-k closeness centrality faster in unweighted graphs. In: ALENEX, pp. 68\u201380. SIAM (2016)"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-68409-1_4","volume-title":"Networks, Topology and Dynamics","author":"B Berno","year":"2009","unstructured":"Berno, B.: Network formation with closeness incentives. In: Naimzada, A.K., Stefani, S., Torriero, A. (eds.) Networks, Topology and Dynamics, vol. 613, pp. 95\u2013109. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-68409-1_4"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Bisenius, P., Bergamin, E., Angriman, E., Meyerhenke, H.: Computing top-k closeness centrality in fully-dynamic graphs. In: ALENEX, pp. 21\u201335. SIAM (2018)","DOI":"10.1137\/1.9781611975055.3"},{"key":"17_CR6","unstructured":"Borassi, M., Crescenzi, P., Marino, A.: Fast and simple computation of top-k closeness centralities. arXiv preprint arXiv:1507.01490 (2015)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Chan, S.Y., Leung, I.X., Li\u00f2, P.: Fast centrality approximation in modular networks. In: CNIKM, pp. 31\u201338. ACM (2009)","DOI":"10.1145\/1651274.1651282"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Cohen, E., Delling, D., Pajor, T., Werneck, R.F.: Computing classic closeness centrality, at scale. In: COSN, pp. 37\u201350. ACM (2014)","DOI":"10.1145\/2660460.2660465"},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/2953882","volume":"11","author":"P Crescenzi","year":"2016","unstructured":"Crescenzi, P., Dangelo, G., Severini, L., Velaj, Y.: Greedily improving our own closeness centrality in a network. TKDD 11(1), 9 (2016)","journal-title":"TKDD"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"ERDdS, P., R&wi, A.: On random graphs i. Publ. Math. Debrecen 6, 290\u2013297 (1959)","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry, pp. 35\u201341 (1977)","DOI":"10.2307\/3033543"},{"issue":"04","key":"17_CR12","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1142\/S0219525903001067","volume":"6","author":"PM Gleiser","year":"2003","unstructured":"Gleiser, P.M., Danon, L.: Community structure in jazz. Adv. Complex Syst. 6(04), 565\u2013573 (2003)","journal-title":"Adv. Complex Syst."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Kas, M., Carley, K.M., Carley, L.R.: Incremental closeness centrality for dynamically changing social networks. In: ASONAM, pp. 1250\u20131258. ACM (2013)","DOI":"10.1145\/2492517.2500270"},{"issue":"3","key":"17_CR14","first-page":"43","volume":"24","author":"VE Krebs","year":"2002","unstructured":"Krebs, V.E.: Mapping networks of terrorist cells. Connections 24(3), 43\u201352 (2002)","journal-title":"Connections"},{"issue":"8","key":"17_CR15","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.ipl.2014.03.006","volume":"114","author":"E Merrer Le","year":"2014","unstructured":"Le Merrer, E., Le Scouarnec, N., Tr\u00e9dan, G.: Heuristical top-k: fast estimation of centralities in complex networks. Inf. Process. Lett. 114(8), 432\u2013436 (2014)","journal-title":"Inf. Process. Lett."},{"issue":"3\u20134","key":"17_CR16","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0378-4371(00)00311-3","volume":"285","author":"M Marchiori","year":"2000","unstructured":"Marchiori, M., Latora, V.: Harmony in the small-world. Phys. A Stat. Mech. Appl. 285(3\u20134), 539\u2013546 (2000)","journal-title":"Phys. A Stat. Mech. Appl."},{"issue":"1","key":"17_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-i. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-540-69311-6_21","volume-title":"Frontiers in Algorithmics","author":"K Okamoto","year":"2008","unstructured":"Okamoto, K., Chen, W., Li, X.-Y.: Ranking of closeness centrality for large-scale social networks. In: Preparata, F.P., Wu, X., Yin, J. (eds.) FAW 2008. LNCS, vol. 5059, pp. 186\u2013195. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69311-6_21"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Olsen, P.W., Labouseur, A.G., Hwang, J.H.: Efficient top-k closeness centrality search. In: ICDE, pp. 196\u2013207. IEEE (2014)","DOI":"10.1109\/ICDE.2014.6816651"},{"key":"17_CR20","unstructured":"Ressler, S.: Social network analysis as an approach to combat terrorism: past,present, and future research. Homel. Secur. Aff. 2(2) (2006)"},{"key":"17_CR21","unstructured":"Rochat, Y.: Closeness centrality extended to unconnected graphs: the harmonic centrality index. Technical report (2009)"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Rozemberczki, B., Davies, R., Sarkar, R., Sutton, C.: Gemsec: graph embedding with self clustering (2018)","DOI":"10.1145\/3341161.3342890"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Santos, E.E., Korah, J., Murugappan, V., Subramanian, S.: Efficient anytime anywhere algorithms for closeness centrality in large and dynamic graphs. In: IPDPSW, pp. 1821\u20131830. IEEE (2016)","DOI":"10.1109\/IPDPSW.2016.215"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Sariyuce, A.E., Kaya, K., Saule, E., Catalyurek, U.V.: Incremental algorithms for network management and analysis based on closeness centrality. arXiv preprint arXiv:1303.0422 (2013)","DOI":"10.1109\/BigData.2013.6691611"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Saxena, A., Gera, R., Iyengar, S.: A faster method to estimate closeness centrality ranking. arXiv preprint arXiv:1706.02083 (2017)","DOI":"10.1145\/3110025.3110064"},{"issue":"1","key":"17_CR26","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/00223980.1954.9712925","volume":"38","author":"ME Shaw","year":"1954","unstructured":"Shaw, M.E.: Group structure and the behavior of individuals in small groups. J. Psychol. 38(1), 139\u2013149 (1954)","journal-title":"J. Psychol."},{"key":"17_CR27","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.socnet.2011.05.006","volume":"34","author":"Y Takhteyev","year":"2012","unstructured":"Takhteyev, Y., Gruzd, A., Wellman, B.: Geography of twitter networks. Soc. Netw. 34, 73\u201381 (2012)","journal-title":"Soc. Netw."},{"issue":"3","key":"17_CR28","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/s00168-008-0258-3","volume":"43","author":"AL Wal Ter","year":"2009","unstructured":"Ter Wal, A.L., Boschma, R.A.: Applying social network analysis in economic geography: framing some key analytic issues. Ann. Reg. Sci. 43(3), 739\u2013756 (2009)","journal-title":"Ann. Reg. Sci."},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"Tong, H., Prakash, B.A., Eliassi-Rad, T., Faloutsos, M., Faloutsos, C.: Gelling, and melting, large graphs by edge manipulation. In: CIKM, pp. 245\u2013254. ACM (2012)","DOI":"10.1145\/2396761.2396795"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Ufimtsev, V., Bhowmick, S.: An extremely fast algorithm for identifying high closeness centrality vertices in large-scale networks. In: IAAA, pp. 53\u201356. IEEE Press (2014)","DOI":"10.1109\/IPDPSW.2013.171"},{"issue":"5","key":"17_CR31","first-page":"39","volume":"5","author":"DEJ Wang","year":"2006","unstructured":"Wang, D.E.J.: Fast approximation of centrality. Gr. Algorithms Appl. 5(5), 39 (2006)","journal-title":"Gr. Algorithms Appl."},{"issue":"2","key":"17_CR32","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1038\/s41562-017-0290-3","volume":"2","author":"M Waniek","year":"2018","unstructured":"Waniek, M., Michalak, T.P., Wooldridge, M.J., Rahwan, T.: Hiding individuals and communities in a social network. Nat. Hum. Behav. 2(2), 139 (2018)","journal-title":"Nat. Hum. Behav."},{"issue":"6684","key":"17_CR33","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u201csmall-world\u201d networks. Nature 393(6684), 440 (1998)","journal-title":"Nature"},{"key":"17_CR34","doi-asserted-by":"crossref","unstructured":"Yen, C.C., Yeh, M.Y., Chen, M.S.: An efficient approach to updating closeness centrality and average path length in dynamic networks. In: ICDM, pp. 867\u2013876. IEEE (2013)","DOI":"10.1109\/ICDM.2013.135"},{"issue":"2","key":"17_CR35","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/1540276.1540279","volume":"10","author":"B Zhou","year":"2008","unstructured":"Zhou, B., Pei, J., Luk, W.: A brief survey on anonymization techniques for privacy preserving publishing of social network data. ACM Sigkdd Explor. Newsl. 10(2), 12\u201322 (2008)","journal-title":"ACM Sigkdd Explor. Newsl."}],"container-title":["Communications in Computer and Information Science","Security and Privacy in Social Networks and Big Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-0758-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T01:01:54Z","timestamp":1695344514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-0758-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9789811507571","9789811507588"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-0758-8_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SocialSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Security and Privacy in Social Networks and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"socialsec0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/socialsec2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"http:\/\/nsclab.org\/socialsec2019\/","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}