Marco Jacopo Ferrarotti
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Marco Jacopo Ferrarotti has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Sergio Decherchi
Fondazione Istituto Italiano di Tecnologia, Genoa, Italy
2 shared publications - Walter Rocchia
Concept Lab, Fondazione Istituto Italiano di Tecnologia, via Morego 30, 16163 Genoa, Italy
2 shared publications - Edoardo Ragusa
Department of Electrical, Electronic, Telecommunications Engineering and Naval Architecture, University of Genoa, Genoa, Italy
1 shared publication - Paolo Gastaldo
DITEN, University of Genoa, Genoa, Italy
1 shared publication - Rodolfo Zunino
DITEN University of Genoa Italy
1 shared publication
Latest Publications
- 16 July 2019
- Published by Springer Nature in Cognitive Computation
- Vol. 11 (5) , 656-675
Cognitive Insights into Sentic Spaces Using Principal Paths
- 16 July 2019
- Published by Springer Nature in Cognitive Computation
- Vol. 11 (5) , 656-675
Cognitive Insights into Sentic Spaces Using Principal Paths
- 25 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 30 (8) , 2449-2462
Finding Principal Paths in Data Space
In this paper, we introduce the concept of principal paths in data space; we show that this is a well-characterized problem from the point of view of cognition, and that it can lead to salient insights in the analyzed data enabling topological/holistic descriptions. These paths, interestingly, can be interpreted as local principal curves, and in this paper, we suggest that they are analogous to what, in the statistical mechanics realm, are called minimum free-energy paths. Here, we move that concept from physics to data space and compute them in both the original and the kernel space. The algorithm is a regularized version of the well-known k -means clustering algorithm. The regularization parameter is derived via an in-sample model selection process based on the Bayesian evidence maximization. Interestingly, we show that this choice for the regularization parameter consistently leads to the same manifold even when changing the number of clusters. We apply the method to common data sets, dynamical systems, and, in particular, to molecular dynamics trajectories showing the generality, the usefulness of the approach and its superiority with respect to other related approaches.
- 25 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 30 (8) , 2449-2462
Finding Principal Paths in Data Space
In this paper, we introduce the concept of principal paths in data space; we show that this is a well-characterized problem from the point of view of cognition, and that it can lead to salient insights in the analyzed data enabling topological/holistic descriptions. These paths, interestingly, can be interpreted as local principal curves, and in this paper, we suggest that they are analogous to what, in the statistical mechanics realm, are called minimum free-energy paths. Here, we move that concept from physics to data space and compute them in both the original and the kernel space. The algorithm is a regularized version of the well-known k -means clustering algorithm. The regularization parameter is derived via an in-sample model selection process based on the Bayesian evidence maximization. Interestingly, we show that this choice for the regularization parameter consistently leads to the same manifold even when changing the number of clusters. We apply the method to common data sets, dynamical systems, and, in particular, to molecular dynamics trajectories showing the generality, the usefulness of the approach and its superiority with respect to other related approaches.