{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:15Z","timestamp":1750220655449,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T00:00:00Z","timestamp":1603065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,19]]},"DOI":"10.1145\/3340531.3412004","type":"proceedings-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T07:01:44Z","timestamp":1603090904000},"page":"775-784","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Trapping Malicious Crawlers in Social Networks"],"prefix":"10.1145","author":[{"given":"Shiju","family":"Li","sequence":"first","affiliation":[{"name":"Florida Institute of Technology, Melbourne, FL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chul-Ho","family":"Lee","sequence":"additional","affiliation":[{"name":"Florida Institute of Technology, Melbourne, FL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Do Young","family":"Eun","sequence":"additional","affiliation":[{"name":"North Carolina State University, Raleigh, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,10,19]]},"reference":[{"volume-title":"Network Science","author":"Barab\u00e1si A.-L.","unstructured":"A.-L. Barab\u00e1si . 2016. Network Science . Cambridge University Press . A.-L. Barab\u00e1si. 2016. Network Science. Cambridge University Press.","key":"e_1_3_2_2_1_1"},{"volume-title":"Proceedings of IEEE\/ACM ASONAM. 249--254","author":"Bonneau J.","unstructured":"J. Bonneau , J. Anderson , and G. Danezis . 2009. Prying data out of a social network . In Proceedings of IEEE\/ACM ASONAM. 249--254 . J. Bonneau, J. Anderson, and G. Danezis. 2009. Prying data out of a social network. In Proceedings of IEEE\/ACM ASONAM. 249--254.","key":"e_1_3_2_2_2_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_3_1","DOI":"10.1007\/978-1-4757-3124-8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_4_1","DOI":"10.1145\/1609956.1609962"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_5_1","DOI":"10.1145\/1284680.1284681"},{"volume-title":"Proceedings of SIAM International Conference on Data Mining. 325--333","author":"Chan H.","unstructured":"H. Chan , L. Akoglu , and H. Tong . 2014. Make It or Break It: Manipulating Robustness in Large Networks . In Proceedings of SIAM International Conference on Data Mining. 325--333 . H. Chan, L. Akoglu, and H. Tong. 2014. Make It or Break It: Manipulating Robustness in Large Networks. In Proceedings of SIAM International Conference on Data Mining. 325--333.","key":"e_1_3_2_2_6_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_7_1","DOI":"10.1145\/2903148"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_8_1","DOI":"10.1109\/TKDE.2015.2453954"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_9_1","DOI":"10.14778\/3021924.3021940"},{"unstructured":"T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. 2009. Introduction to Algorithms .MIT press.  T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. 2009. Introduction to Algorithms .MIT press.","key":"e_1_3_2_2_10_1"},{"volume-title":"Proceedings of the 5th Workshop on the Economics of Information Security.","author":"Danezis G.","unstructured":"G. Danezis and B. Wittneben . 2006. The Economics of Mass Surveillance and the Questionable Value of Anonymous Communications . In Proceedings of the 5th Workshop on the Economics of Information Security. G. Danezis and B. Wittneben. 2006. The Economics of Mass Surveillance and the Questionable Value of Anonymous Communications. In Proceedings of the 5th Workshop on the Economics of Information Security.","key":"e_1_3_2_2_11_1"},{"volume-title":"Proceedings of IEEE INFOCOM. 1455--1466","author":"Ganesh A.","unstructured":"A. Ganesh , L. Massouli\u00e9 , and D. Towsley . 2005. The Effect of Network Topology on the Spread of Epidemics . In Proceedings of IEEE INFOCOM. 1455--1466 . A. Ganesh, L. Massouli\u00e9, and D. Towsley. 2005. The Effect of Network Topology on the Spread of Epidemics. In Proceedings of IEEE INFOCOM. 1455--1466.","key":"e_1_3_2_2_12_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_13_1","DOI":"10.5555\/1971122.1971127"},{"key":"e_1_3_2_2_14_1","volume-title":"Facebook: A case study of unbiased sampling of OSNs. In Proc","author":"Gjoka M.","year":"2010","unstructured":"M. Gjoka , M. Kurant , C. T. Butts , and A. Markopoulou . 2010 . Walking in Facebook: A case study of unbiased sampling of OSNs. In Proc . IEEE INFOCOM. 1--9. M. Gjoka, M. Kurant, C. T. Butts, and A. Markopoulou. 2010. Walking in Facebook: A case study of unbiased sampling of OSNs. In Proc. IEEE INFOCOM. 1--9."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_15_1","DOI":"10.1145\/2740908.2744713"},{"volume-title":"Proceedings of SIAM International Conference on Data Mining. 463--474","author":"He X.","unstructured":"X. He , G. Song , W. Chen , and Q. Jiang . 2012. Influence blocking maximization in social networks under the competitive linear threshold model . In Proceedings of SIAM International Conference on Data Mining. 463--474 . X. He, G. Song, W. Chen, and Q. Jiang. 2012. Influence blocking maximization in social networks under the competitive linear threshold model. In Proceedings of SIAM International Conference on Data Mining. 463--474.","key":"e_1_3_2_2_16_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_17_1","DOI":"10.1080\/01621459.1963.10500830"},{"volume-title":"Proceedings of International Conference on World Wide Web. 271--279","author":"Jeh G.","unstructured":"G. Jeh and J. Widom . 2003. Scaling personalized web search . In Proceedings of International Conference on World Wide Web. 271--279 . G. Jeh and J. Widom. 2003. Scaling personalized web search. In Proceedings of International Conference on World Wide Web. 271--279.","key":"e_1_3_2_2_18_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_19_1","DOI":"10.1145\/956750.956769"},{"volume-title":"Proceedings of ACM SIGKDD. 1226--1235","author":"Khalil E. B.","unstructured":"E. B. Khalil , B. Dilkina , and L. Song . 2014. Scalable Diffusion-Aware Optimization of Network Topology . In Proceedings of ACM SIGKDD. 1226--1235 . E. B. Khalil, B. Dilkina, and L. Song. 2014. Scalable Diffusion-Aware Optimization of Network Topology. In Proceedings of ACM SIGKDD. 1226--1235.","key":"e_1_3_2_2_20_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_21_1","DOI":"10.1145\/1514888.1514892"},{"volume-title":"Proc. IEEE ICDM. 399--408","author":"Kuhlman C. J.","unstructured":"C. J. Kuhlman , G. Tuli , S. Swarup , M. V. Marathe , and S. S. Ravi . 2013. Blocking simple and complex contagion by edge removal . In Proc. IEEE ICDM. 399--408 . C. J. Kuhlman, G. Tuli, S. Swarup, M. V. Marathe, and S. S. Ravi. 2013. Blocking simple and complex contagion by edge removal. In Proc. IEEE ICDM. 399--408.","key":"e_1_3_2_2_22_1"},{"key":"e_1_3_2_2_23_1","volume-title":"Proceedings of International Conference on World Wide Web. 1343--1350","author":"Kunegis J.","year":"2013","unstructured":"J. Kunegis . 2013 . KONECT -- The Koblenz Network Collection . In Proceedings of International Conference on World Wide Web. 1343--1350 . J. Kunegis. 2013. KONECT -- The Koblenz Network Collection. In Proceedings of International Conference on World Wide Web. 1343--1350."},{"unstructured":"Kaspersky Lab. [n. d.]. What is a honeypot? https:\/\/www.kaspersky.com\/resource-center\/threats\/what-is-a-honeypot.  Kaspersky Lab. [n. d.]. What is a honeypot? https:\/\/www.kaspersky.com\/resource-center\/threats\/what-is-a-honeypot.","key":"e_1_3_2_2_24_1"},{"volume-title":"Proceedings of ACM SIGMETRICS. 319--330","author":"Lee C.-H.","unstructured":"C.-H. Lee , X. Xu , and D. Y. Eun . 2012. Beyond random walk and Metropolis-Hastings samplers: Why you should not backtrack for unbiased graph sampling . In Proceedings of ACM SIGMETRICS. 319--330 . C.-H. Lee, X. Xu, and D. Y. Eun. 2012. Beyond random walk and Metropolis-Hastings samplers: Why you should not backtrack for unbiased graph sampling. In Proceedings of ACM SIGMETRICS. 319--330.","key":"e_1_3_2_2_25_1"},{"unstructured":"J. Leskovec and A. Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data.  J. Leskovec and A. Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data.","key":"e_1_3_2_2_26_1"},{"volume-title":"Proceedings of IEEE ICDE. 736--747","author":"Li R.","unstructured":"R. Li , J. X. Yu , X. Huang , and H. Cheng . 2014. Random-walk domination in large graphs . In Proceedings of IEEE ICDE. 736--747 . R. Li, J. X. Yu, X. Huang, and H. Cheng. 2014. Random-walk domination in large graphs. In Proceedings of IEEE ICDE. 736--747.","key":"e_1_3_2_2_27_1"},{"doi-asserted-by":"crossref","unstructured":"S. Li C.-H. Lee and D. Y. Eun. 2020. Trapping Malicious Crawlers in Social Networks. Technical Report.  S. Li C.-H. Lee and D. Y. Eun. 2020. Trapping Malicious Crawlers in Social Networks. Technical Report.","key":"e_1_3_2_2_28_1","DOI":"10.1145\/3340531.3412004"},{"volume-title":"Proceedings of International Conference on World Wide Web. 1145--1146","author":"Lindamood J.","unstructured":"J. Lindamood , R. Heatherly , M. Kantarcioglu , and B. Thuraisingham . 2009. Inferring Private Information using Social Network Data . In Proceedings of International Conference on World Wide Web. 1145--1146 . J. Lindamood, R. Heatherly, M. Kantarcioglu, and B. Thuraisingham. 2009. Inferring Private Information using Social Network Data. In Proceedings of International Conference on World Wide Web. 1145--1146.","key":"e_1_3_2_2_29_1"},{"volume-title":"Proceedings of IEEE ICDM. 901--906","author":"Mavroforakis C.","unstructured":"C. Mavroforakis , M. Mathioudakis , and A. Gionis . 2015. Absorbing random-walk centrality: Theory and algorithms . In Proceedings of IEEE ICDM. 901--906 . C. Mavroforakis, M. Mathioudakis, and A. Gionis. 2015. Absorbing random-walk centrality: Theory and algorithms. In Proceedings of IEEE ICDM. 901--906.","key":"e_1_3_2_2_30_1"},{"volume-title":"Proceedings of ACM SIGCOMM Conference on Internet Measurement. 29--42","author":"Mislove A.","unstructured":"A. Mislove , M. Marcon , K. P. Gummadi , P. Druschel , and B. Bhattacharjee . 2007. Measurement and analysis of online social networks . In Proceedings of ACM SIGCOMM Conference on Internet Measurement. 29--42 . A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. 2007. Measurement and analysis of online social networks. In Proceedings of ACM SIGCOMM Conference on Internet Measurement. 29--42.","key":"e_1_3_2_2_31_1"},{"doi-asserted-by":"crossref","unstructured":"G. L. Nemhauser L. A. Wolsey and M. L. Fisher. 1978. An analysis of approximations for maximizing submodular set functions--I. Mathematical programming Vol. 14 1 (1978) 265--294.  G. L. Nemhauser L. A. Wolsey and M. L. Fisher. 1978. An analysis of approximations for maximizing submodular set functions--I. Mathematical programming Vol. 14 1 (1978) 265--294.","key":"e_1_3_2_2_32_1","DOI":"10.1007\/BF01588971"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_33_1","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001"},{"key":"e_1_3_2_2_34_1","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman M. E. J.","year":"2004","unstructured":"M. E. J. Newman and M. Girvan . 2004 . Finding and evaluating community structure in networks . Phys. Rev. E , Vol. 69 (Feb 2004), 026113. Issue 2. M. E. J. Newman and M. Girvan. 2004. Finding and evaluating community structure in networks. Phys. Rev. E, Vol. 69 (Feb 2004), 026113. Issue 2.","journal-title":"Phys. Rev. E"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_35_1","DOI":"10.1109\/TKDE.2019.2904969"},{"doi-asserted-by":"crossref","unstructured":"J. R. Norris. 1997. Markov Chains. Cambridge University Press.  J. R. Norris. 1997. Markov Chains. Cambridge University Press.","key":"e_1_3_2_2_36_1","DOI":"10.1017\/CBO9780511810633"},{"volume-title":"Proceedings of Mensch & Computer 2014 -- Workshopband.","author":"Reuter C.","unstructured":"C. Reuter and S. Scholl . 2014. Technical Limitations for Designing Applications for Social Media . In Proceedings of Mensch & Computer 2014 -- Workshopband. C. Reuter and S. Scholl. 2014. Technical Limitations for Designing Applications for Social Media. In Proceedings of Mensch & Computer 2014 -- Workshopband.","key":"e_1_3_2_2_37_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_38_1","DOI":"10.1137\/1.9781611974010.64"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_39_1","DOI":"10.1103\/PhysRevE.84.061911"},{"unstructured":"Techopedia. [n. d.]. What is a Spider Trap? https:\/\/www.techopedia.com\/definition\/5197\/spider-trap.  Techopedia. [n. d.]. What is a Spider Trap? https:\/\/www.techopedia.com\/definition\/5197\/spider-trap.","key":"e_1_3_2_2_40_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_41_1","DOI":"10.1103\/PhysRevE.84.016101"},{"volume-title":"Proceedings of ACM CIKM. 1693--1702","author":"Vesdapunt N.","unstructured":"N. Vesdapunt and H. Garcia-Molina . 2016. Updating an Existing Social Graph Snapshot via a Limited API . In Proceedings of ACM CIKM. 1693--1702 . N. Vesdapunt and H. Garcia-Molina. 2016. Updating an Existing Social Graph Snapshot via a Limited API. In Proceedings of ACM CIKM. 1693--1702.","key":"e_1_3_2_2_42_1"},{"key":"e_1_3_2_2_43_1","volume-title":"Proceedings of USENIX Security Symposium. 223--238","author":"Viswanath B.","year":"2014","unstructured":"B. Viswanath 2014 . Towards detecting anomalous user behavior in online social networks . In Proceedings of USENIX Security Symposium. 223--238 . B. Viswanath et al. 2014. Towards detecting anomalous user behavior in online social networks. In Proceedings of USENIX Security Symposium. 223--238."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_44_1","DOI":"10.1145\/2700393"},{"doi-asserted-by":"crossref","unstructured":"S. Wasserman and K. Faust. 1994. Social Network Analysis: Methods and Applications .Cambridge University Press.  S. Wasserman and K. Faust. 1994. Social Network Analysis: Methods and Applications .Cambridge University Press.","key":"e_1_3_2_2_45_1","DOI":"10.1017\/CBO9780511815478"},{"volume-title":"Proceedings of ACM AISec. 91--101","author":"Xiao C.","unstructured":"C. Xiao , D. M. Freeman , and T. Hwa . 2015. Detecting clusters of fake accounts in online social networks . In Proceedings of ACM AISec. 91--101 . C. Xiao, D. M. Freeman, and T. Hwa. 2015. Detecting clusters of fake accounts in online social networks. In Proceedings of ACM AISec. 91--101.","key":"e_1_3_2_2_46_1"},{"volume-title":"Proceedings of IEEE ICDE Workshops. 525--530","author":"Xu W.","unstructured":"W. Xu , X. Zhou , and L. Li . 2008. Inferring privacy information via social relations . In Proceedings of IEEE ICDE Workshops. 525--530 . W. Xu, X. Zhou, and L. Li. 2008. Inferring privacy information via social relations. In Proceedings of IEEE ICDE Workshops. 525--530.","key":"e_1_3_2_2_47_1"},{"volume-title":"Proceedings of IEEE INFOCOM. 1--9.","author":"Xu X.","unstructured":"X. Xu , C.-H. Lee , and D. Y. Eun . 2017. Challenging the limits: Sampling online social networks with cost constraints . In Proceedings of IEEE INFOCOM. 1--9. X. Xu, C.-H. Lee, and D. Y. Eun. 2017. Challenging the limits: Sampling online social networks with cost constraints. In Proceedings of IEEE INFOCOM. 1--9.","key":"e_1_3_2_2_48_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_49_1","DOI":"10.1007\/s11280-013-0271-z"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_50_1","DOI":"10.4108\/icst.collaboratecom.2010.52"}],"event":{"sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"acronym":"CIKM '20","name":"CIKM '20: The 29th ACM International Conference on Information and Knowledge Management","location":"Virtual Event Ireland"},"container-title":["Proceedings of the 29th ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412004","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340531.3412004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:28Z","timestamp":1750197748000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,19]]},"references-count":50,"alternative-id":["10.1145\/3340531.3412004","10.1145\/3340531"],"URL":"https:\/\/doi.org\/10.1145\/3340531.3412004","relation":{},"subject":[],"published":{"date-parts":[[2020,10,19]]},"assertion":[{"value":"2020-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}