Skip to main content

Solving graph data issues using a layered architecture approach with applications to web spam detection

Journal Article


Abstract


  • 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. © 2013 Elsevier Ltd.

Publication Date


  • 2013

Citation


  • Scarselli, F., Tsoi, A., Hagenbuchner, M. & Di Noi, L. (2013). Solving graph data issues using a layered architecture approach with applications to web spam detection. Neural Networks, 48 78-90.

Scopus Eid


  • 2-s2.0-84882934363

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers/1289

Has Global Citation Frequency


Number Of Pages


  • 12

Start Page


  • 78

End Page


  • 90

Volume


  • 48

Place Of Publication


  • United Kingdom

Abstract


  • 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. © 2013 Elsevier Ltd.

Publication Date


  • 2013

Citation


  • Scarselli, F., Tsoi, A., Hagenbuchner, M. & Di Noi, L. (2013). Solving graph data issues using a layered architecture approach with applications to web spam detection. Neural Networks, 48 78-90.

Scopus Eid


  • 2-s2.0-84882934363

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers/1289

Has Global Citation Frequency


Number Of Pages


  • 12

Start Page


  • 78

End Page


  • 90

Volume


  • 48

Place Of Publication


  • United Kingdom