This paper proposes the combination of two state-of-the-art algorithms for processing graph input data, viz., the probabilistic mapping graph self organizing map, an unsupervised learning approach, and the graph neural network, a supervised learning approach. We organize these two algorithms in a cascade architecture containing a probabilistic mapping graph self organizing map, and a graph neural network. We show that this combined approach helps us to limit the long-term dependency problem that exists when training the graph neural network resulting in an overall improvement in performance. This is demonstrated in an application to a benchmark problem requiring the detection of spam in a relatively large set of web sites. It is found that the proposed method produces results which reach the state of the art when compared with some of the best results obtained by others using quite different approaches. A particular strength of our method is its applicability towards any input domain which can be represented as a graph.
Scheda prodotto non validato
Scheda prodotto in fase di analisi da parte dello staff di validazione
|Titolo:||Solving graph data issues using a layered architecture approach with applications to web spam detection|
|Citazione:||Scarselli, F., Ah Chung, T., Markus, H., & Lucia Di, N. (2013). Solving graph data issues using a layered architecture approach with applications to web spam detection. NEURAL NETWORKS, 48, 78-90.|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto: