Link-Spam-Resistant Domain Ranking: A Comparative Evaluation of PageRank, HITS, and TrustRank Under Simulated Link-Farm Attacks Using Common Crawl Web Graphs
Article Sidebar
Main Article Content
Link-based ranking is still an important part of web information retrieval, but it remains vulnerable to coordinated link-farm attacks. This study examined the resistance of PageRank, HITS, and TrustRank to link spam using simulated attacks on domain-level web graphs extracted from Common Crawl. A quantitative, comparative, and controlled experimental design was used. Five independent base graphs were prepared, with each graph containing 100,000 legitimate domain nodes. Four link-farm structures were tested: star-centered, bounded-density clique, bipartite, and mixed. The attacks were applied at four intensity levels: 1%, 3%, 5%, and 10% of the legitimate graph size. Across all conditions, the experiment produced 480 attacked graph instances and 1,440 verified algorithm-level runs. The algorithms were compared using spam target promotion, spam score share, top-1000 spam infiltration, legitimate-domain displacement, ranking stability, execution time, peak memory use, and iteration count. The results showed that PageRank was the most vulnerable algorithm. It had the highest spam target promotion, highest spam score share, measurable top-1000 spam infiltration, greater legitimate-domain displacement, and lowest ranking stability. HITS showed the strongest overall resistance and computational efficiency. It recorded near-zero spam score share, zero top-1000 infiltration, zero legitimate-domain displacement, highest stability, fastest runtime, and fewest iterations. TrustRank also blocked top-1000 infiltration and legitimate-domain displacement, although it allowed higher target promotion than HITS. The bounded-density clique structure caused the most damage to PageRank, while higher attack intensity increased spam impact in most cases. The findings show that link-spam resistance depends on the ranking algorithm, attack structure, attack intensity, and evaluation metric used. A single ranking score or attack model is not enough to evaluate resistance to link-farm manipulation.
Downloads
References
Akinyelu, A. A. (2021). Advances in spam detection for email spam, web spam, social network spam, and review spam: ML-based and nature-inspired-based techniques. Journal of Computer Security, 29(5), 473-529. https://doi.org/10.3233/JCS-210022
Alom, Z., Carminati, B., & Ferrari, E. (2020). A deep learning model for Twitter spam detection. Online Social Networks and Media, 18, Article 100079. https://doi.org/10.1016/j.osnem.2020.100079
Dou, Y., Liu, Z., Sun, L., Deng, Y., Peng, H., & Yu, P. S. (2020). Enhancing graph neural network-based fraud detectors against camouflaged fraudsters. Proceedings of the 29th ACM International Conference on Information and Knowledge Management, 315-324. https://doi.org/10.1145/3340531.3411903
Elkin, L. A., Kay, M., Higgins, J. J., & Wobbrock, J. O. (2021). An aligned rank transform procedure for multifactor contrast tests. Proceedings of the 34th Annual ACM Symposium on User Interface Software and Technology, 754-768. https://doi.org/10.1145/3472749.3474784
Formal, T., Lassance, C., Piwowarski, B., & Clinchant, S. (2022). From distillation to hard negative sampling: Making sparse neural IR models more effective. Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2353-2359. https://doi.org/10.1145/3477495.3531857
Formal, T., Piwowarski, B., & Clinchant, S. (2021). SPLADE: Sparse lexical and expansion model for first stage ranking. Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2288-2292. https://doi.org/10.1145/3404835.3463098
Gao, C., Zheng, Y., Li, N., Li, Y., Qin, Y., Piao, J., Quan, Y., Chang, J., Jin, D., He, X., & Li, Y. (2023). A survey of graph neural networks for recommender systems: Challenges, methods, and directions. ACM Transactions on Recommender Systems, 1(1), Article 3. https://doi.org/10.1145/3568022
Gao, L., & Callan, J. (2021). Condenser: A pre-training architecture for dense retrieval. Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, 981-993. https://doi.org/10.18653/v1/2021.emnlp-main.75
Gao, L., Dai, Z., & Callan, J. (2021). COIL: Revisit exact lexical match in information retrieval with contextualized inverted list. Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 3030-3042. https://doi.org/10.18653/v1/2021.naacl-main.241
Harris, C. R., Millman, K. J., van der Walt, S. J., Gommers, R., Virtanen, P., Cournapeau, D., Wieser, E., Taylor, J., Berg, S., Smith, N. J., Kern, R., Picus, M., Hoyer, S., van Kerkwijk, M. H., Brett, M., Haldane, A., del Río, J. F., Wiebe, M., Peterson, P., Gérard-Marchant, P., Sheppard, K., Reddy, T., Weckesser, W., Abbasi, H., Gohlke, C., & Oliphant, T. E. (2020). Array programming with NumPy. Nature, 585, 357-362. https://doi.org/10.1038/s41586-020-2649-2
He, X., Deng, K., Wang, X., Li, Y., Zhang, Y., & Wang, M. (2020). LightGCN: Simplifying and powering graph convolution network for recommendation. Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, 639-648. https://doi.org/10.1145/3397271.3401063
Ji, S., Pan, S., Cambria, E., Marttinen, P., & Yu, P. S. (2021). A survey on knowledge graphs: Representation, acquisition, and applications. IEEE Transactions on Neural Networks and Learning Systems, 33(2), 494-514. https://doi.org/10.1109/TNNLS.2021.3070843
Kaddoura, S., Chandrasekaran, G., Popescu, D. E., & Duraisamy, J. H. (2022). A systematic literature review on spam content detection and classification. PeerJ Computer Science, 8, Article e830. https://doi.org/10.7717/peerj-cs.830
Karpukhin, V., Oguz, B., Min, S., Lewis, P., Wu, L., Edunov, S., Chen, D., & Yih, W. (2020). Dense passage retrieval for open-domain question answering. Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, 6769-6781. https://doi.org/10.18653/v1/2020.emnlp-main.550
Khattab, O., & Zaharia, M. (2020). ColBERT: Efficient and effective passage search via contextualized late interaction over BERT. Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, 39-48. https://doi.org/10.1145/3397271.3401075
Lin, J., Ma, X., Lin, S.-C., Yang, J.-H., Pradeep, R., & Nogueira, R. (2021). Pyserini: A Python toolkit for reproducible information retrieval research with sparse and dense representations. Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2356-2362. https://doi.org/10.1145/3404835.3463238
Liu, Z., Dou, Y., Yu, P. S., Deng, Y., & Peng, H. (2020). Alleviating the inconsistency problem of applying graph neural network to fraud detection. Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, 1569-1572. https://doi.org/10.1145/3397271.3401253
Ma, X., Wu, J., Xue, S., Yang, J., Zhou, C., Sheng, Q. Z., Xiong, H., & Akoglu, L. (2023). A comprehensive survey on graph anomaly detection with deep learning. IEEE Transactions on Knowledge and Data Engineering, 35(12), 12012-12038. https://doi.org/10.1109/TKDE.2021.3118815
Macdonald, C., & Tonellotto, N. (2020). Declarative experimentation in information retrieval using PyTerrier. Proceedings of the 2020 ACM SIGIR International Conference on the Theory of Information Retrieval, 161–168. https://doi.org/10.1145/3409256.3409829
Makkar, A., & Kumar, N. (2020). An efficient deep learning-based scheme for web spam detection in IoT environment. Future Generation Computer Systems, 108, 467-487. https://doi.org/10.1016/j.future.2020.03.004
Nogueira, R., Jiang, Z., & Lin, J. (2020). Document ranking with a pretrained sequence-to-sequence model. Findings of the Association for Computational Linguistics: EMNLP 2020, 708-718. https://doi.org/10.18653/v1/2020.findings-emnlp.63
Pang, G., Shen, C., Cao, L., & van den Hengel, A. (2021). Deep learning for anomaly detection: A review. ACM Computing Surveys, 54(2), Article 38, 1-38. https://doi.org/10.1145/3439950
Qu, Y., Ding, Y., Liu, J., Liu, K., Ren, R., Zhao, W. X., Dong, D., Wu, H., & Wang, H. (2021). RocketQA: An optimized training approach to dense passage retrieval for open-domain question answering. Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 5835-5847. https://doi.org/10.18653/v1/2021.naacl-main.466
Rossi, A., Barbosa, D., Firmani, D., Matinata, A., & Merialdo, P. (2021). Knowledge graph embedding for link prediction: A comparative analysis. ACM Transactions on Knowledge Discovery from Data, 15(2), Article 14. https://doi.org/10.1145/3424672
Santhanam, K., Khattab, O., Saad-Falcon, J., Potts, C., & Zaharia, M. (2022). ColBERTv2: Efficient and effective retrieval via lightweight late interaction. Proceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 3715-3734. https://doi.org/10.18653/v1/2022.naacl-main.272
Shahzad, A., Nawi, N. M., Gillani, S. M. Z. R., & Khan, A. (2021). An improved framework for content- and link-based web-spam detection: A combined approach. Complexity, 2021, Article 6625739. https://doi.org/10.1155/2021/6625739
Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., van der Walt, S. J., Brett, M., Wilson, J., Millman, K. J., Mayorov, N., Nelson, A. R. J., Jones, E., Kern, R., Larson, E., Carey, C. J., et al. (2020). SciPy 1.0: Fundamental algorithms for scientific computing in Python. Nature Methods, 17(3), 261-272. https://doi.org/10.1038/s41592-019-0686-2
Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., & Yu, P. S. (2021). A comprehensive survey on graph neural networks. IEEE Transactions on Neural Networks and Learning Systems, 32(1), 4-24. https://doi.org/10.1109/TNNLS.2020.2978386
Zhao, T., Zhang, X., & Wang, S. (2021). GraphSMOTE: Imbalanced node classification on graphs with graph neural networks. Proceedings of the 14th ACM International Conference on Web Search and Data Mining, 833-841. https://doi.org/10.1145/3437963.3441720
Zhou, J., Cui, G., Hu, S., Zhang, Z., Yang, C., Liu, Z., Wang, L., Li, C., & Sun, M. (2020). Graph neural networks: A review of methods and applications. AI Open, 1, 57-81. https://doi.org/10.1016/j.aiopen.2021.01.001
This work is licensed under a Creative Commons Attribution 4.0 International License.
All articles published in our journal are licensed under CC-BY 4.0, which permits authors to retain copyright of their work. This license allows for unrestricted use, sharing, and reproduction of the articles, provided that proper credit is given to the original authors and the source.