ACM Home Page
Please provide us with feedback. Feedback
Use noisy link analysis to improve web search
Full text PdfPdf (528 KB)
Source
Conference on Hypertext and Hypermedia archive
Proceedings of the 20th ACM conference on Hypertext and hypermedia table of contents
Torino, Italy
POSTER SESSION: Posters table of contents
Pages 377-378  
Year of Publication: 2009
ISBN:978-1-60558-486-7
Authors
Yitong Wang  Fudan University, Shanghai, China
Jingbo Chu  Fudan University, Shanghai, China
Sponsors
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 24,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1557914.1557997
What is a DOI?

ABSTRACT

Link-based ranking algorithm is very important for current success and popular of Web Search Engine. In order to get high rank, some try to improve contents of web pages while others just put dirty tricks, such as link spam. Link spam is a trick targeting at link-based ranking algorithms by artificially created tight link structures to push some target pages get undeserved high ranks. This problem becomes even worse with the advent of wikis, blogs, forums, which are rich in links. We tackle the problem of improving link-based ranking by more fundamental viewpoint--"noisy link" analysis. Motivated by how "non-voting" hyperlinks affect quality of ranking, we propose an approach and corresponding penalty strategies to both detect and handle "noisy link" effectively and automatically. We also compared our approach with other related works to demonstrate that our approach is rather effective in noisy link filtering and could improve the final search results significantly.