Franco Scarselli

Franco Scarselli

Auto-generated profile, based on publicly available information

Franco Scarselli

University of Siena

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 December 2008 in IEEE Transactions on Neural Networks
Verified
Journal Article
Closed access
FSFranco Scarselli
Franco Scarselli
MGMarco Gori
Marco Gori
ATAh Chung Tsoi
Ah Chung Tsoi
MHMarkus Hagenbuchner
Markus Hagenbuchner
GMGabriele Monfardini
Gabriele Monfardini
Many underlying relationships among data in several areas of science and engineering, e.g., computer vision, molecular chemistry, molecular biology, pattern recognition, and data mining, can be represented in terms of graphs. In this paper, we propose a new neural network model, called graph neural network (GNN) model, that extends existing neural network methods for processing the data represented in graph domains. This GNN model, which can directly process most of the practically useful types of graphs, e.g., acyclic, cyclic, directed, and undirected, implements a function tau(G,n) isin IRm that maps a graph G and one of its nodes n into an m-dimensional Euclidean space. A supervised learning algorithm is derived to estimate the parameters of the proposed GNN model. The computational cost of the proposed algorithm is also considered. Some experimental results are shown to validate the proposed learning algorithm, and to demonstrate its generalization capabilities.

5 January 2006
Verified
Conference Paper
Closed access
MGM. Gori
M. Gori
GMG. Monfardini
G. Monfardini
FSF. Scarselli
F. Scarselli

6 January 2014 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
MBMonica Bianchini
Monica Bianchini
FSFranco Scarselli
Franco Scarselli
Recently, researchers in the artificial neural network field have focused their attention on connectionist models composed by several hidden layers. In fact, experimental results and heuristic considerations suggest that deep architectures are more suitable than shallow ones for modern applications, facing very complex problems, e.g., vision and human language understanding. However, the actual theoretical results supporting such a claim are still few and incomplete. In this paper, we propose a new approach to study how the depth of feedforward neural networks impacts on their ability in implementing high complexity functions. First, a new measure based on topological concepts is introduced, aimed at evaluating the complexity of the function implemented by a neural network, used for classification purposes. Then, deep and shallow neural architectures with common sigmoidal activation functions are compared, by deriving upper and lower bounds on their complexity, and studying how the complexity depends on the number of hidden units and the used activation function. The obtained results seem to support the idea that deep networks actually implements functions of higher complexity, so that they are able, with the same number of resources, to address more difficult problems.


1 February 2005 in ACM Transactions on Internet Technology
Verified
Journal Article
Open access
MBMonica Bianchini
Monica Bianchini
MGMarco Gori
Marco Gori
FSFranco Scarselli
Franco Scarselli
Although the interest of a Web page is strictly related to its content and to the subjective readers' cultural background, a measure of the page authority can be provided that only depends on the topological structure of the Web. PageRank is a noticeable way to attach a score to Web pages on the basis of the Web connectivity. In this article, we look inside PageRank to disclose its fundamental properties concerning stability, complexity of computational scheme, and critical role of parameters involved in the computation. Moreover, we introduce a circuit analysis that allows us to understand the distribution of the page score, the way different Web communities interact each other, the role of dangling pages (pages with no outlinks), and the secrets for promotion of Web pages.

1 January 2009 in IEEE Transactions on Neural Networks
Verified
Journal Article
Closed access
FSF. Scarselli
F. Scarselli
MGM. Gori
M. Gori
ATAh Chung Tsoi
Ah Chung Tsoi
MHMarkus Hagenbuchner
Markus Hagenbuchner
GMG. Monfardini
G. Monfardini
In this paper, we will consider the approximation properties of a recently introduced neural network model called graph neural network (GNN), which can be used to process-structured data inputs, e.g., acyclic graphs, cyclic graphs, and directed or undirected graphs. This class of neural networks implements a function tau(G,n) is an element of IR(m) that maps a graph G and one of its nodes n onto an m-dimensional Euclidean space. We characterize the functions that can be approximated by GNNs, in probability, up to any prescribed degree of precision. This set contains the maps that satisfy a property called preservation of the unfolding equivalence, and includes most of the practically useful functions on graphs; the only known exception is when the input graph contains particular patterns of symmetries when unfolding equivalence may not be preserved. The result can be considered an extension of the universal approximation property established for the classic feedforward neural networks (FNNs). Some experimental examples are used to show the computational capabilities of the proposed model.