Transductive link spam detection

ACM International Conference Proceeding Series

Volumn 215, Issue , 2007, Pages 21-28

  Zhou, Dengyong ^a   Burges, Christopher J C ^a   Tao, Tao ^b  

^a MICROSOFT RESEARCH   (United States)

^b MICROSOFT   (United States)

Author keywords

Directed graph; Discrete analysis; Discrete regularization; Link spam; Transductive inference

Indexed keywords

DIRECTED GRAPH; DISCRETE ANALYSIS; DISCRETE REGULARIZATION; LINK SPAM; TRANSDUCTIVE INFERENCE;

CLASSIFICATION (OF INFORMATION); DATA MINING; GRAPH THEORY; PROBLEM SOLVING; SEARCH ENGINES; SECURITY OF DATA; WORLD WIDE WEB;

SPAMMING;

EID: 35548959181     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1244408.1244413     Document Type: Conference Paper

References (32)

1. A. Ando and T. Zhang. Learning on graph with Laplacian regularization. In Advances in Neural Information Processing Systems 19, Cambridge, MA, 2007. MIT Press.
2. R. Baeza-Yates, P. Boldi, and C. Castillo. Generalizing PageRank: Damping functions for link-based ranking algorithms. In Proc. 29th Annual International ACM SIGIR. Conference on Research &c Development on Information Retrieval, pages 308-315, 2006.
3. M. Belkin, I. Matveeva, and P. Niyogi. Regression and regularization on large graphs. In Proc. 17th Annual Conference on Learning Theory, 2004.
4. S. Brin and L. Page. The anatomy of a large scale hypertextual web search engine. In Proc. 7th International World Wide Web Conference, 1998.
5. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R., Stata, A. Tomkins, and J. Wiener. Graph structure in the Web. In Proc. 9th International World Wide Web Conference, 2000.
6. C. Carlos, D. Debora, G. Aristides, M. Vanessa, and S. Fabrizio. Know your neighbors: Web spam detection using the web topology. Technical report, 2006.
7. C. Castillo, D. Donato, L. Becchetti, P. Boldi, M. Santini, and S. Vigna. A reference collection for web spam. SIGIR Forum, 40(2), 2006.
8. F. Chung. Laplacian and the Cheeger inequality for directed graphs. Annals of Combinatorics, 9:1-19, 2005.
9. F. Chung, A. Grigoryan, and S.-T. Yau. Higher eigenvalues and isoperimetric inequalities on Riemannian manifolds and graphs. Communications on Analysis and Geometry, 8:969-1026, 2000.
10. D. A. Cohn, Z. Ghahramani, and M. I. Jordan. Active lea.rning with statistical models. Journal of Artificial Intelligence Research, 4:129-145, 1996.
11. S. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas, and R. A. Harshman. Indexing by latent semantic analysis. Journal of the Society for Information Science, 41 (6): 391-407, 1990.
12. R. El-Yaniv and D. Pechyony. Stable transductive learning. In Proc. 19th Annual Conference on Computational Learning Theory, pages 35-49, 2006.
13. Z. Gyongyi, H. Garcia-Molina, and J. Pedersen. Combating web spam with trustrank. In Proc. 30th International Conference on Very Large Data Bases, pages 576-587, 2004.
14. T. H. Haveliwala. Topic-sensitive pagerank. In Proc. 11th International World Wide Web Conference, pages 517-526, 2002.
15. M. Hein, J. Audibert, and U. von Luxburg. From graphs to manifolds - weak and strong pointwise consistency of graph Laplacians. In Proc. 18th Annual Conference on Learning Theory, pages 470-485, 2005.
16. M. Henzinger. Hyperlink analysis for the web. IEEE Internet Computing, 5(1):45-50, 2001.
17. T. Joachims. Transductive learning via spectral graph partitioning. In Proc. 20th IInternational Conference on Machine Learning, 2003.
18. J. Jost. Riemannian Geometry and Geometric Analysis. Springer-Verlag, Berlin-Heidelberg, third edition, 2002.
19. J. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, 1999.
20. J. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. The web as a graph: Measurements, models, and methods. In Proc. 5th International Conference on Computing and Combinatorics, 1999.
21. A. Ntoulas, M. Najork, M. Manasse, and D. Fetterly. Detecting spam web pages through content analysis. In Proc. 15th International World Wide Web Conference, 2006.
22. R. Raj and V. Krishnan. Web spam detection with anti-trust rank. In Proc. 2nd International Workshop on Adversarial Information Retrieval on the Web, pages 37-40, 2006.
23. B. Schölkopf and A. Smola. Learning with Kernels. MIT Press, Cambridge, MA, 2002.
24. T. Simon and D. Koller. Support vector machine active learning with applications to text classification. Journal of Machine Learning Research, 2:45-66, 2001.
25. R., Tarjan. Depth first search and linear graph algorithms. SIAM Journal on Computing, 1:146-160, 1972.
26. A. Tikhonov and V. Arsenin. Solutions of Ill-posed Problems. W. H. Winston, Washington, DC, 1977.
27. V. Vapnik. Statistical Learning Theory. Wiley, NY, 1998.
28. G. Wahba. Spline Models for Observational Data. Number 59 in CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM, Philadelphia, 1990.
29. B. Wu and B. D. Davison. Identifying link farm spam pages. In WWW (Special interest tracks and posters), pages 820-829, 2005.
30. D. Zhou, O. Bousquet, T. Lal, J. Weston, and B. Schölkopf. Learning with local and global consistency. In Advances in Neural Information Processing Systems 16. MIT Press, Cambridge, MA, 2004.
31. D. Zhou, J. Huang, and B. Schölkopf. Learning from labeled and unlabeled data on a directed graph. In Proc. 22th International Conference on Machine Learning, 2005.
32. X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-supervised learning using Gaussian fields and harmonic functions. In Proc. 20th International Conference on Machine Learning, 2003.