Recursive processing of cyclic graphs.
Recursive neural networks are a powerful tool for processing structured data. According to the recursive learning paradigm, the input information consists of directed positional acyclic graphs (DPAGs). In fact, recursive networks are fed following the partial order defined by the links of the graph. Unfortunately, the hypothesis of processing DPAGs is sometimes too restrictive, being the nature of some real-world problems intrinsically cyclic. In this paper, a methodology is proposed, which allows us to process any cyclic directed graph. Therefore, the computational power of recursive networks is definitely established, also clarifying the underlying limitations of the model.
Bianchini
Monica
M
Dipartimento di Ingegneria dell'Informazione, Università degli Studi di Siena, 1-53100, Siena, Italy. monica@dii.unisi.it
Gori
Marco
M
Sarti
Lorenzo
L
Scarselli
Franco
F