Abstract

In the global information era, people acquire more and more information from the Internet, but the quality of the search results is degraded strongly because of the presence of web spam. Web spam is one of the serious problems for search engines, and many methods have been proposed for spam detection. We exploit the content features of non-spam in contrast to those of spam. The content features for non-spam pages always possess lots of statistical regularities; but those for spam pages possess very few statistical regularities, because spam pages are made randomly in order to increase the page rank. In this paper, we summarize the regularities distributions of content features for non-spam pages, and propose the calculating probability formulae of the entropy and independent n-grams respectively. Furthermore, we put forward the calculation formulae of multi features correlation. Among them, the notable content features may be used as auxiliary information for spam detection.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.