Skip to main content

Differential Trust Propagation with Community Discovery for Link-Based Web Spam Demotion

  • Conference paper
  • First Online:
Web-Age Information Management (WAIM 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9098))

Included in the following conference series:

Abstract

In this paper, we propose a novel differential trust propagation scheme with community discovery, which can be applied to all kinds of trust propagation algorithms. We first use a random walk-based community discovery algorithm to preselect suspicious communities in which the members are almost spam pages. We then utilize these suspicious communities to limit the across-community-boundary trust propagation. Experimental results on WEBSPAM-UK2007 and ClueWeb09 demonstrate that the proposed penalizing scheme significantly improves the performance of trust propagation algorithms such as TrustRank, LCRank, CPV.

W. Liang—This work was supported by NSF of China (No. 61272374,61300190), SRFDP of Higher Education (No.20120041110046) and Key Project of Chinese Ministry of Education (No. 313011).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gyöngyi, Z., Garcia-Molina, H., Pedersen, J.: Combating web spam with trustrank. In: VLDB 2004, pp. 576–587 (2004)

    Google Scholar 

  2. Zhang, X., Wang, Y., Mou, N., Liang, W.: Propagating both trust and distrust with target differentiation for combating web spam. In: AAAI (2011)

    Google Scholar 

  3. Wu, B., Chellapilla, K.: Extracting link spam using biased random walks from spam seed sets. In: Proceedings of the 3rd International Workshop on Adversarial Information Retrieval on the Web, pp. 37–44. ACM (2007)

    Google Scholar 

  4. Krishnan, V., Raj, R.: Web spam detection with anti-trust rank. In: AIRWeb 2006, pp. 37–40 (2006)

    Google Scholar 

  5. Wu, B., Goel, V., Davison, B.D.: Propagating trust and distrust to demote web spam. In: MTW 2006 (2006)

    Google Scholar 

  6. Zhang, Y., Jiang, Q., Zhang, L., Zhu, Y.: Exploiting bidirectional links: making spamming detection easier. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, pp. 1839–1842. ACM (2009)

    Google Scholar 

  7. Yahoo!: Yahoo! research: Web spam collections. http://barcelona.research.yahoo.net/webspam/datasets/ Crawled by the Laboratory of Web Algorithmics. University of Milan (2007). http://law.dsi.unimi.it/

  8. Callan, J., Hoy, M., Yoo, C., Zhao, L.: The clueweb09 data set (2009). http://boston.lti.cs.cmu.edu/Data/clueweb09/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wenxin Liang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Zhang, X., Feng, Y., Shen, H., Liang, W. (2015). Differential Trust Propagation with Community Discovery for Link-Based Web Spam Demotion. In: Dong, X., Yu, X., Li, J., Sun, Y. (eds) Web-Age Information Management. WAIM 2015. Lecture Notes in Computer Science(), vol 9098. Springer, Cham. https://doi.org/10.1007/978-3-319-21042-1_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21042-1_39

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21041-4

  • Online ISBN: 978-3-319-21042-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics