{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:20:46Z","timestamp":1729660846694,"version":"3.28.0"},"reference-count":40,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/infcom.2011.5935303","type":"proceedings-article","created":{"date-parts":[[2011,7,7]],"date-time":"2011-07-07T14:59:10Z","timestamp":1310050750000},"page":"811-819","source":"Crossref","is-referenced-by-count":0,"title":["Agnostic topology-based spam avoidance in large-scale web crawls"],"prefix":"10.1109","author":[{"given":"Clint","family":"Sparkman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsin-Tsang","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitri","family":"Loguinov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Datasets for Research on Web Spam Detection","year":"2008","key":"ref39"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27780-4_30"},{"key":"ref33","first-page":"67","article-title":"ODISSEA: A Peer-to-Peer Architecture for Scalable Web Search and Information Retrieval","author":"suel","year":"2003","journal-title":"Proc WebDB"},{"journal-title":"SpamAssassin Domain Blacklist","year":"2008","author":"stearns","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994750"},{"key":"ref30","article-title":"Finding What People Want: Experiences with the Web Crawler","author":"pinkerton","year":"1994","journal-title":"Proc WWW"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135792"},{"key":"ref36","article-title":"Predicting Fame and Fortune: PageRank or Indegree","author":"upstill","year":"2003","journal-title":"Proc 8th Australasian Document Computing Symposium"},{"journal-title":"WebBase Archive","year":"2008","key":"ref35"},{"journal-title":"We Knew the Web was Big","year":"2008","key":"ref34"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1149121.1149124"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/S0164-1212(01)00091-7"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863992"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(94)90151-1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988714"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148187"},{"year":"0","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1147\/sj.431.0064"},{"key":"ref17","article-title":"Web Spam Taxonomy","author":"gy\u00f6ngyi","year":"2005","journal-title":"Proc AIRWeb"},{"key":"ref18","first-page":"576","article-title":"Combating Web Spam with TrustRank","author":"gy\u00f6ngyi","year":"2004","journal-title":"Proc VLDB"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1026711.1026760"},{"key":"ref28","article-title":"High-Performance Web Crawling","author":"najork","year":"2001","journal-title":"Technical Report 173"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/spe.587"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(94)90149-X"},{"key":"ref3","article-title":"Spamrank - Fully Automatic Link Spam Detection","author":"benczur","year":"2005","journal-title":"Proc AIRWeb"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281124"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/371920.371965"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/584792.584882"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.2307\/2290471"},{"key":"ref2","article-title":"Using Rank Propagation and Probabilistic Counting for Link-Based Spam Detection","author":"becchetti","year":"2006","journal-title":"Proc WebKDD"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031248"},{"key":"ref1","article-title":"Link-based Characterization and Detection of Web Spam","author":"becchetti","year":"2006","journal-title":"Proc AIRWeb"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00063-3"},{"key":"ref22","article-title":"High Performance Large Scale Web Spider Architecture","author":"koht-arsa","year":"2002","journal-title":"Proc IEEE ISCIT"},{"journal-title":"Internet Archive","year":"0","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367556"},{"journal-title":"Web Dataset","year":"2008","key":"ref23"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/4236.707687","article-title":"Toward a Qualitative Search Engine","volume":"2","author":"li","year":"1998","journal-title":"IEEE Internet Computing"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/382979.383041"}],"event":{"name":"IEEE INFOCOM 2011 - IEEE Conference on Computer Communications","start":{"date-parts":[[2011,4,10]]},"location":"Shanghai, China","end":{"date-parts":[[2011,4,15]]}},"container-title":["2011 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5888673\/5934870\/05935303.pdf?arnumber=5935303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T02:56:21Z","timestamp":1497927381000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5935303\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/infcom.2011.5935303","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}