{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:11:14Z","timestamp":1775283074654,"version":"3.50.1"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2008,2,1]],"date-time":"2008-02-01T00:00:00Z","timestamp":1201824000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["IST-015964 AEOLUSIST-001907 DELIS"],"award-info":[{"award-number":["IST-015964 AEOLUSIST-001907 DELIS"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003407","name":"Ministero dell'Istruzione, dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["RBIN047MH9"],"award-info":[{"award-number":["RBIN047MH9"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Web"],"published-print":{"date-parts":[[2008,2]]},"abstract":"<jats:p>We propose link-based techniques for automatic detection of Web spam, a term referring to pages which use deceptive techniques to obtain undeservedly high scores in search engines. The use of Web spam is widespread and difficult to solve, mostly due to the large size of the Web which means that, in practice, many algorithms are infeasible.<\/jats:p>\n          <jats:p>We perform a statistical analysis of a large collection of Web pages. In particular, we compute statistics of the links in the vicinity of every Web page applying rank propagation and probabilistic counting over the entire Web graph in a scalable way. These statistical features are used to build Web spam classifiers which only consider the link structure of the Web, regardless of page contents. We then present a study of the performance of each of the classifiers alone, as well as their combined performance, by testing them over a large collection of Web link spam. After tenfold cross-validation, our best classifiers have a performance comparable to that of state-of-the-art spam classifiers that use content attributes, but are orthogonal to content-based methods.<\/jats:p>","DOI":"10.1145\/1326561.1326563","type":"journal-article","created":{"date-parts":[[2008,3,12]],"date-time":"2008-03-12T22:35:44Z","timestamp":1205361344000},"page":"1-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":71,"title":["Link analysis for Web spam detection"],"prefix":"10.1145","volume":"2","author":[{"given":"Luca","family":"Becchetti","sequence":"first","affiliation":[{"name":"Universit\u00e0 di Roma La Sapienza"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Castillo","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Barcelona"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debora","family":"Donato","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Barcelona"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Baeza-YATES","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Barcelona"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Roma La Sapienza"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,3,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148254"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148225"},{"key":"e_1_2_1_4_1","volume-title":"1st International Workshop on Adversarial Information Retrieval on the Web.","author":"Baeza-Yates R.","unstructured":"Baeza-Yates , R. , Castillo , C. , and L\u00f3pez , V . 2005. Pagerank increase under different collusion topologies . In 1st International Workshop on Adversarial Information Retrieval on the Web. Baeza-Yates, R., Castillo, C., and L\u00f3pez, V. 2005. Pagerank increase under different collusion topologies. In 1st International Workshop on Adversarial Information Retrieval on the Web."},{"key":"e_1_2_1_5_1","volume-title":"Modern Information Retrieval","author":"Baeza-Yates R.","unstructured":"Baeza-Yates , R. and Ribeiro-Neto , B. 1999. Modern Information Retrieval . Addison Wesley . Baeza-Yates, R. and Ribeiro-Neto, B. 1999. Modern Information Retrieval. Addison Wesley."},{"key":"e_1_2_1_6_1","volume-title":"2nd International Workshop on Adversarial Information Retrieval on the Web (AIRWeb)","author":"Becchetti L.","unstructured":"Becchetti , L. , Castillo , C. , Donato , D. , Leonardi , S. , and Baeza-Yates , R . 2006a. Link-based characterization and detection of Web Spam . In 2nd International Workshop on Adversarial Information Retrieval on the Web (AIRWeb) . Seattle, WA. Becchetti, L., Castillo, C., Donato, D., Leonardi, S., and Baeza-Yates, R. 2006a. Link-based characterization and detection of Web Spam. In 2nd International Workshop on Adversarial Information Retrieval on the Web (AIRWeb). Seattle, WA."},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the Workshop on Web Mining and Web Usage Analysis (WebKDD). ACM Press.","author":"Becchetti L.","unstructured":"Becchetti , L. , Castillo , C. , Donato , D. , Leonardi , S. , and Baeza-Yates , R . 2006b. Using rank propagation and probabilistic counting for link-based spam detection . In Proceedings of the Workshop on Web Mining and Web Usage Analysis (WebKDD). ACM Press. Becchetti, L., Castillo, C., Donato, D., Leonardi, S., and Baeza-Yates, R. 2006b. Using rank propagation and probabilistic counting for link-based spam detection. In Proceedings of the Workshop on Web Mining and Web Usage Analysis (WebKDD). ACM Press."},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 1st International Workshop on Adversarial Information Retrieval on the Web","author":"Bencz\u00far A. A.","unstructured":"Bencz\u00far , A. A. , Csalog\u00e1ny , K. , Sarl\u00f3s , T. , and Uher , M . 2005. Spamrank: Fully automatic link spam detection . In Proceedings of the 1st International Workshop on Adversarial Information Retrieval on the Web . Chiba, Japan. Bencz\u00far, A. A., Csalog\u00e1ny, K., Sarl\u00f3s, T., and Uher, M. 2005. Spamrank: Fully automatic link spam detection. In Proceedings of the 1st International Workshop on Adversarial Information Retrieval on the Web. Chiba, Japan."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.587"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018054314350"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1189702.1189703"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1189702.1189703"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277814"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1534"},{"key":"e_1_2_1_16_1","unstructured":"Costa L. Rodrigues F. A. Travieso G. and Villas. 2005. Characterization of complex networks: A survey of measurements. URL: http:\/\/arxiv.org\/abs\/cond-mat\/0505185.  Costa L. Rodrigues F. A. Travieso G. and Villas. 2005. Characterization of complex networks: A survey of measurements. URL: http:\/\/arxiv.org\/abs\/cond-mat\/0505185."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135793"},{"key":"e_1_2_1_18_1","volume-title":"Artificial Intelligence for Web Search","author":"Davison B. D.","unstructured":"Davison , B. D. 2000a. Recognizing nepotistic links on the Web . In Artificial Intelligence for Web Search . AAAI Press , TX , 23--28. Davison, B. D. 2000a. Recognizing nepotistic links on the Web. In Artificial Intelligence for Web Search. AAAI Press, TX, 23--28."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345597"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109635"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11564096_14"},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of 11th Annual European Symposium on Algorithms. Lecture Notes in Computer Science","volume":"2832","author":"Durand M.","unstructured":"Durand , M. and Flajolet , P . 2003. Loglog counting of large cardinalities (extended abstract) . In Proceedings of 11th Annual European Symposium on Algorithms. Lecture Notes in Computer Science , vol. 2832 . Springer, 605--617. Durand, M. and Flajolet, P. 2003. Loglog counting of large cardinalities (extended abstract). In Proceedings of 11th Annual European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 2832. Springer, 605--617."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988714"},{"key":"e_1_2_1_24_1","volume-title":"31st International Colloquium on Automata, Languages and Programming.","author":"Feigenbaum J.","unstructured":"Feigenbaum , J. , Kannan , S. , Gregor , M. A. , Suri , S. , and Zhang , J . 2004. On graph problems in a semi-streaming model. In 31st International Colloquium on Automata, Languages and Programming. Feigenbaum, J., Kannan, S., Gregor, M. A., Suri, S., and Zhang, J. 2004. On graph problems in a semi-streaming model. In 31st International Colloquium on Automata, Languages and Programming."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1017074.1017077"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 31st International Conference on Very Large Data Bases (VLDB'05)","author":"Gibson D.","unstructured":"Gibson , D. , Kumar , R. , and Tomkins , A . 2005. Discovering large dense subgraphs in massive graphs . In Proceedings of the 31st International Conference on Very Large Data Bases (VLDB'05) . 721--732. Gibson, D., Kumar, R., and Tomkins, A. 2005. Discovering large dense subgraphs in massive graphs. In Proceedings of the 31st International Conference on Very Large Data Bases (VLDB'05). 721--732."},{"key":"e_1_2_1_28_1","unstructured":"Gomes L. H. Almeida R. B. Bettencourt L. M. A. Almeida V. and Almeida J. M. 2005. Comparative graph theoretical characterization of networks of spam and legitimate email. URL: http:\/\/www.ceas.cc\/papers-2005\/131.pdf.  Gomes L. H. Almeida R. B. Bettencourt L. M. A. Almeida V. and Almeida J. M. 2005. Comparative graph theoretical characterization of networks of spam and legitimate email. URL: http:\/\/www.ceas.cc\/papers-2005\/131.pdf."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1047671.1047715"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062745.1062789"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1097\/00002030-198912000-00005"},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the 32nd International Conference on Very Large Data Bases. ACM, 439--450","author":"Gy\u00f6ngyi Z.","unstructured":"Gy\u00f6ngyi , Z. , Berkhin , P. , Garcia-Molina , H. , and Pedersen , J . 2006. Link spam detection based on mass estimation . In Proceedings of the 32nd International Conference on Very Large Data Bases. ACM, 439--450 . Gy\u00f6ngyi, Z., Berkhin, P., Garcia-Molina, H., and Pedersen, J. 2006. Link spam detection based on mass estimation. In Proceedings of the 32nd International Conference on Very Large Data Bases. ACM, 439--450."},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 1st International Workshop on Adversarial Information Retrieval on the Web.","author":"Gy\u00f6ngyi Z.","unstructured":"Gy\u00f6ngyi , Z. and Garcia-Molina , H . 2005. Web spam taxonomy . In Proceedings of the 1st International Workshop on Adversarial Information Retrieval on the Web. Gy\u00f6ngyi, Z. and Garcia-Molina, H. 2005. Web spam taxonomy. In Proceedings of the 1st International Workshop on Adversarial Information Retrieval on the Web."},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the 30th International Conference on Very Large Data Bases (VLDB). Morgan Kaufmann, 576--587","author":"Gy\u00f6ngyi Z.","unstructured":"Gy\u00f6ngyi , Z. , Garcia-Molina , H. , and Pedersen , J . 2004. Combating Web spam with TrustRank . In Proceedings of the 30th International Conference on Very Large Data Bases (VLDB). Morgan Kaufmann, 576--587 . Gy\u00f6ngyi, Z., Garcia-Molina, H., and Pedersen, J. 2004. Combating Web spam with TrustRank. In Proceedings of the 30th International Conference on Very Large Data Bases (VLDB). Morgan Kaufmann, 576--587."},{"key":"e_1_2_1_35_1","volume-title":"Efficient computation of pagerank. Tech. rep","author":"Haveliwala T.","unstructured":"Haveliwala , T. 1999. Efficient computation of pagerank. Tech. rep ., Stanford University . Haveliwala, T. 1999. Efficient computation of pagerank. Tech. rep., Stanford University."},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Henzinger M. R. Raghavan P. and Rajagopalan S. 1999. Computing on data streams. In Dimacs Series in Discrete Mathematics and Theoretical Computer Science 107--118.   Henzinger M. R. Raghavan P. and Rajagopalan S. 1999. Computing on data streams. In Dimacs Series in Discrete Mathematics and Theoretical Computer Science 107--118.","DOI":"10.1090\/dimacs\/050\/05"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of the 15th International Conference on Very Large Data Bases (VLDB'89)","author":"Lipton R. J.","unstructured":"Lipton , R. J. and Naughton , J. F . 1989. Estimating the size of generalized transitive closures . In Proceedings of the 15th International Conference on Very Large Data Bases (VLDB'89) . Morgan Kaufmann Publishers Inc., 165--171. Lipton, R. J. and Naughton, J. F. 1989. Estimating the size of generalized transitive closures. In Proceedings of the 15th International Conference on Very Large Data Bases (VLDB'89). Morgan Kaufmann Publishers Inc., 165--171."},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the International Conference on Machine Learning.","author":"Lu Q.","unstructured":"Lu , Q. and Getoor , L . 2003. Link-based classification . In Proceedings of the International Conference on Machine Learning. Lu, Q. and Getoor, L. 2003. Link-based classification. In Proceedings of the International Conference on Machine Learning."},{"key":"e_1_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Mitzenmacher M. and Upfal E. 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press.   Mitzenmacher M. and Upfal E. 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press.","DOI":"10.1017\/CBO9780511813603"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/359619.359627"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135794"},{"key":"e_1_2_1_43_1","unstructured":"Page L. Brin S. Motwani R. and Winograd T. 1998. The PageRank citation ranking: bringing order to the Web. Tech. rep. Stanford Digital Library Technologies Project.  Page L. Brin S. Motwani R. and Winograd T. 1998. The PageRank citation ranking: bringing order to the Web. Tech. rep. Stanford Digital Library Technologies Project."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775059"},{"key":"e_1_2_1_45_1","unstructured":"Perkins A. 2001. The classification of search engine spam. http:\/\/www.silverdisc.co.uk\/articles\/spam-classification\/.  Perkins A. 2001. The classification of search engine spam. http:\/\/www.silverdisc.co.uk\/articles\/spam-classification\/."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183650"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.51"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/384192.384193"},{"key":"e_1_2_1_49_1","volume-title":"Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann.","author":"Witten I. H.","year":"1999","unstructured":"Witten , I. H. and Frank , E . 1999 . Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann. Witten, I. H. and Frank, E. 1999. Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062745.1062762"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44594-3"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150510"}],"container-title":["ACM Transactions on the Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1326561.1326563","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1326561.1326563","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:25Z","timestamp":1750254985000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1326561.1326563"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["10.1145\/1326561.1326563"],"URL":"https:\/\/doi.org\/10.1145\/1326561.1326563","relation":{},"ISSN":["1559-1131","1559-114X"],"issn-type":[{"value":"1559-1131","type":"print"},{"value":"1559-114X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2]]},"assertion":[{"value":"2007-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2007-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-03-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}