Web spam detection by probability mapping GraphSOMs and graph neural networks
In this paper, we will apply, to the task of detecting web spam, a combination of the best of its breed algorithms for processing graph domain input data, namely, probability mapping graph self organizing maps and graph neural networks. The two connectionist models are organized into a layered architecture, consisting of a mixture of unsupervised and supervised learning methods. It is found that the results of this layered architecture approach are comparable to the best results obtained so far by others using very different approaches.
Please refer to publisher version or contact your library.