Recent developments with Neural Networks produced models which are capable of encoding graph structured data. The most promising and arguably the most capable of these methods are the Graph Neural Networks (GNNs). This paper considers the GNN for the application to recommender system learning problem. It will be shown that the GNN can generally exploit relational information in such a graph structured domain but experiments also revealed some interesting limitations of the GNN. Experiments were conducted on a relatively large set o real world data from MovieLens. The dataset that has been widely used as a benchmark problem. The careful analysis of these data led to the discovery of some intriguing properties which helped to explain the problems and limitations of the GNN when dealing with this learning problem.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.