Link spam target detection using page farms
- 28 July 2009
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 3 (3), 1-38
- https://doi.org/10.1145/1552303.1552306
Abstract
Currently, most popular Web search engines adopt some link-based ranking methods such as PageRank. Driven by the huge potential benefit of improving rankings of Web pages, many tricks have been attempted to boost page rankings. The most common way, which is known as link spam, is to make up some artificially designed link structures. Detecting link spam effectively is a big challenge. In this article, we develop novel and effective detection methods for link spam target pages using page farms. The essential idea is intuitive: whether a page is the beneficiary of link spam is reflected by how it collects its PageRank score. Technically, how a target page collects its PageRank score is modeled by a page farm, which consists of pages contributing a major portion of the PageRank score of the target page. We propose two spamicity measures based on page farms. They can be used as an effective measure to check whether the pages are link spam target pages. An empirical study using a newly available real dataset strongly suggests that our method is effective. It outperforms the state-of-the-art methods like SpamRank and SpamMass in both precision and recall.Keywords
This publication has 17 references indexed in Scilit:
- Web spam detection via commercial intent analysisPublished by Association for Computing Machinery (ACM) ,2007
- Using spam farm to boost PageRankPublished by Association for Computing Machinery (ACM) ,2007
- A reference collection for web spamACM SIGIR Forum, 2006
- PageRank revisitedACM Transactions on Internet Technology, 2006
- Inside PageRankACM Transactions on Internet Technology, 2005
- Identifying link farm spam pagesPublished by Association for Computing Machinery (ACM) ,2005
- Spam, damn spam, and statisticsPublished by Association for Computing Machinery (ACM) ,2004
- Deeper Inside PageRankInternet Mathematics, 2004
- Authoritative sources in a hyperlinked environmentJournal of the ACM, 1999
- Reducibility among Combinatorial ProblemsPublished by Springer Science and Business Media LLC ,1972