Know your neighbors: web spam detection using the web topology
The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Abstract
Web spam can significantly deteriorate the quality of search engine results. Thus there is a large incentive for commercial search engines to detect spam pages efficiently and accurately. In this paper we present a spam detection system that combines link-based and content-based features, and uses the topology of the Web graph by exploiting the link dependencies among the Web pages. We find that linked hosts tend to belong to the same class: either both are spam or both are non-spam. We demonstrate three methods of incorporating the Web graph topology into the predictions obtained by our base classifier: (i) clustering the host graph, and assigning the label of all hosts in the cluster by majority vote, (ii) propagating the predicted labels to neighboring hosts, and (iii) using the predicted labels of neighboring hosts as new features and retraining the classifier. The result is an accurate system for detecting Web spam, tested on a large and public dataset, using algorithms that can be applied in practice to large-scale Web data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1999) · Cited by 12,854
Baeza-Yates, R. A., & Ribeiro-Neto, B. A. (1999) · Cited by 12,609
Witten, I. H. (2008) · Cited by 9,143
Data mining: practical machine learning tools and techniques with Java implementations
Witten, I. H., & Frank, E. (2002) · ACM SIGMOD Record · doi:10.1145/507338.507355 · Cited by 5,137
Learning with Local and Global Consistency
Zhou, D., Bousquet, O., Lal, T. N., Weston, J., & Schölkopf, B. (2003) · neural information processing systems · Cited by 4,777
Multilevelk-way Partitioning Scheme for Irregular Graphs
Karypis, G., & Kumar, V. (1998) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1997.1404 · Cited by 1,675
Probabilistic counting algorithms for data base applications
Flajolet, P., & Nigel Martin, G. (1985) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(85)90041-8 · Cited by 1,269
The webgraph framework I: compression techniques
Boldi, P., & Vigna, S. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988752 · Cited by 1,201
Combating Web Spam with TrustRank
Gyöngyi, Z., Garcia-Molina, H., & Pedersen, J. (2004) · Proceedings 2004 VLDB Conference · doi:10.1016/b978-012088469-8.50052-8 · Cited by 1,085
Detecting spam web pages through content analysis
Ntoulas, A., Najork, M., Manasse, M., & Fetterly, D. (2006) · Proceedings of the 15th international conference on World Wide Web · doi:10.1145/1135777.1135794 · Cited by 608
UbiCrawler: a scalable fully distributed Web crawler
Boldi, P., Codenotti, B., Santini, M., & Vigna, S. (2004) · Software: Practice and Experience · doi:10.1002/spe.587 · Cited by 560
Arasu, A., Cho, J., Garcia-Molina, H., Paepcke, A., & Raghavan, S. (2001) · ACM Transactions on Internet Technology · doi:10.1145/383034.383035 · Cited by 505
Data Mining - Practical Machine Learning Tools and Techniques with JAVA Implementations
Witten, I. H., & Frank, E. (2000) · Cumulative Index of Computer Aided Architectural Design · Cited by 394
Challenges in web search engines
Henzinger, M. R., Motwani, R., & Silverstein, C. (2002) · ACM SIGIR Forum · doi:10.1145/792550.792553 · Cited by 307
Spam, damn spam, and statistics: using statistical analysis to locate spam web pages
Fetterly, D., Manasse, M., & Najork, M. (2004) · Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004 · doi:10.1145/1017074.1017077 · Cited by 291
Davison, B. D. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345597 · Cited by 264
Identifying link farm spam pages
Wu, B., & Davison, B. D. (2005) · Special interest tracks and posters of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1062745.1062762 · Cited by 241
Blocking Blog Spam with Language Model Disagreement
Mishne, G., Carmel, D., & Lempel, R. (2005) · UvA-DARE (University of Amsterdam) · Cited by 216
Eiron, N., McCurley, K. S., & Tomlin, J. A. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988714 · Cited by 209
A reference collection for web spam
Castillo, C., Donato, D., Becchetti, L., Boldi, P., Leonardi, S., Santini, M., & Vigna, S. (2006) · ACM SIGIR Forum · doi:10.1145/1189702.1189703 · Cited by 202
Self-citationSpamRank -- Fully Automatic Link Spam Detection.
Benczúr, A. A., Csalogány, K., Sarlós, T., & Uher, M. (2005) · Cited by 170
Gyöngyi, Z., & García-Molina, H. (2005) · Cited by 165
Recognizing Nepotistic Links on the Web
Davison, B. D. (2000) · Cited by 152
Link-Based Characterization and Detection of Web Spam
Becchetti, L., Castillo, C., Donato, D., Leonardi, S., & Baeza-Yates, R. A. (2006) · Cited by 127
Self-citationPropagating Trust and Distrust to Demote Web Spam.
Wu, B., Goel, V., & Davison, B. D. (2006) · Cited by 118
Linear prediction models with graph regularization for web-page categorization
Zhang, T., Popescul, A., & Dom, B. (2006) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1150402.1150510 · Cited by 117
Making Eigenvector-Based Reputation Systems Robust to Collusion
Zhang, H., Goel, A., Govindan, R., Mason, K., & Roy, B. V. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30216-2_8 · Cited by 112
Cloaking and Redirection: A Preliminary Study.
Wu, B., & Davison, B. D. (2005) · Cited by 99
Knowing a web page by the company it keeps
Qi, X., & Davison, B. D. (2006) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1183614.1183650 · Cited by 67
Link-Based Similarity Search to Fight Web Spam
Benczúr, A. A., Csalogány, K., & Sarlós, T. (2006) · SZTAKI Publication Repository (Hungarian Academy of Sciences) · Cited by 65
Pagerank Increase under Different Collusion Topologies.
Baeza-Yates, R. A., Castillo, C., & López, V. (2005) · Cited by 56
Self-citationLink-based Classification using Labeled and Unlabeled Data
Lu, Q. L., & Getoor, L. C. (2003) · Cited by 52
Detecting Link Spam Using Temporal Information
Shen, G., Gao, B., Liu, T., Feng, G., Song, S., & Li, H. (2006) · Proceedings · doi:10.1109/icdm.2006.51 · Cited by 45
Site level noise removal for search engines
Carvalho, A. L. D. C., Chirita, P. A., de Moura, E. S., Calado, P. P., & Nejdl, W. (2006) · International World Wide Web Conference (WWW) · doi:10.1145/1135777.1135793 · Cited by 44
Macskassy, S. A., & Provost, F. J. (2005) · Cited by 31
Wu, B., & Davison, B. D. (2006) · ACM Symposium on Applied Computing · doi:10.1145/1141277.1141535 · Cited by 19
Suspicion scoring based on guilt-by-association, colle ctive inference, and focused data access 1
Macskassy, S. A., & Provost, F. J. (2005) · Cited by 13
(2005)
Cited by
Graph based anomaly detection and description: a survey
Akoglu, L., Tong, H., & Koutra, D. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0365-y · Cited by 1,504
“2009), email and Web spam (Castillo et al. 2007), opinion deception and reviews spam (Ott et al.”
BackgroundInfluentialWhat Yelp Fake Review Filter Might Be Doing?
Mukherjee, A., Venkataraman, V., Liu, B., & Glance, N. (2021) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v7i1.14389 · Cited by 557
DON’T FOLLOW ME - Spam Detection in Twitter
(2010) · Proceedings of the International Conference on Security and Cryptography · doi:10.5220/0002996201420151 · Cited by 462
Web page classification: Features and algorithms
Qi, X., & Davison, B. D. (2009) · ACM Computing Surveys · doi:10.1145/1459352.1459357 · Cited by 435
Understanding and combating link farming in the twitter social network
Ghosh, S., Viswanath, B., Kooti, F., Sharma, N. K., Korlam, G., Benevenuto, F., Ganguly, N., & Gummadi, K. P. (2012) · Proceedings of the 21st international conference on World Wide Web · doi:10.1145/2187836.2187846 · Cited by 342
Metadata
- Authors
- Castillo, C., Donato, D., Gionis, A., Murdock, V., & Silvestri, F.
- Venue
- Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
- Publisher
- ACM
- Published
- 2007-07-23
- Pages
- 423-430
- OpenAlex
- W2130196635
- Cited by
- 310
- References
- 38
- FWCI
- 20.11
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.