Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Luca Pappalardo is active.

Publication


Featured researches published by Luca Pappalardo.


Nature Communications | 2015

Returners and explorers dichotomy in human mobility

Luca Pappalardo; Filippo Simini; Salvatore Rinzivillo; Dino Pedreschi; Fosca Giannotti; Albert-László Barabási

The availability of massive digital traces of human whereabouts has offered a series of novel insights on the quantitative patterns characterizing human mobility. In particular, numerous recent studies have lead to an unexpected consensus: the considerable variability in the characteristic travelled distance of individuals coexists with a high degree of predictability of their future locations. Here we shed light on this surprising coexistence by systematically investigating the impact of recurrent mobility on the characteristic distance travelled by individuals. Using both mobile phone and GPS data, we discover the existence of two distinct classes of individuals: returners and explorers. As existing models of human mobility cannot explain the existence of these two classes, we develop more realistic models able to capture the empirical findings. Finally, we show that returners and explorers play a distinct quantifiable role in spreading phenomena and that a correlation exists between their mobility patterns and social interactions.


Journal of data science | 2016

An analytical framework to nowcast well-being using mobile phone data

Luca Pappalardo; Maarten Vanhoof; Lorenzo Gabrielli; Zbigniew Smoreda; Dino Pedreschi; Fosca Giannotti

An intriguing open question is whether measurements derived from Big Data recording human activities can yield high-fidelity proxies of socio-economic development and well-being. Can we monitor and predict the socio-economic development of a territory just by observing the behavior of its inhabitants through the lens of Big Data? In this paper, we design a data-driven analytical framework that uses mobility measures and social measures extracted from mobile phone data to estimate indicators for socio-economic development and well-being. We discover that the diversity of mobility, defined in terms of entropy of the individual users’ trajectories, exhibits (i) significant correlation with two different socio-economic indicators and (ii) the highest importance in predictive models built to predict the socio-economic indicators. Our analytical framework opens an interesting perspective to study human behavior through the lens of Big Data by means of new statistical indicators that quantify and possibly “nowcast” the well-being and the socio-economic development of a territory.


Journal of Official Statistics | 2015

Small Area Model-Based Estimators Using Big Data Sources

Stefano Marchetti; Caterina Giusti; Monica Pratesi; Nicola Salvati; Fosca Giannotti; Dino Pedreschi; Salvatore Rinzivillo; Luca Pappalardo; Lorenzo Gabrielli

Abstract The timely, accurate monitoring of social indicators, such as poverty or inequality, on a finegrained spatial and temporal scale is a crucial tool for understanding social phenomena and policymaking, but poses a great challenge to official statistics. This article argues that an interdisciplinary approach, combining the body of statistical research in small area estimation with the body of research in social data mining based on Big Data, can provide novel means to tackle this problem successfully. Big Data derived from the digital crumbs that humans leave behind in their daily activities are in fact providing ever more accurate proxies of social life. Social data mining from these data, coupled with advanced model-based techniques for fine-grained estimates, have the potential to provide a novel microscope through which to view and understand social complexity. This article suggests three ways to use Big Data together with small area estimation techniques, and shows how Big Data has the potential to mirror aspects of well-being and other socioeconomic phenomena.


advances in social networks analysis and mining | 2012

How Well Do We Know Each Other? Detecting Tie Strength in Multidimensional Social Networks

Luca Pappalardo; Giulio Rossetti; Dino Pedreschi

The advent of social media have allowed us to build massive networks of weak ties: acquaintances and nonintimate ties we use all the time to spread information and thoughts. Conversely, strong ties are the people we really trust, people whose social circles tightly overlap with our own and, often, they are also the people most like us. Unfortunately, the majority of social media do not incorporate explicitly tie strength information in the creation and management of relationships, and treat all users the same: friend or stranger, with little or nothing in between. In the current work, we address the challenging issue of detecting on online social networks the strong and intimate ties from the huge mass of such mere social contacts. In order to do so, we propose a novel multidimensional definition of tie strength which exploits the existence of multiple online social links between two individuals. We test our definition on a multidimensional network constructed over users in Foursquare, Twitter and Facebook, analyzing the structural role of strong and weak links, and the correlations with the most common similarity measures.


Machine Learning | 2017

Tiles: an online algorithm for community discovery in dynamic social networks

Giulio Rossetti; Luca Pappalardo; Dino Pedreschi; Fosca Giannotti

Community discovery has emerged during the last decade as one of the most challenging problems in social network analysis. Many algorithms have been proposed to find communities on static networks, i.e. networks which do not change in time. However, social networks are dynamic realities (e.g. call graphs, online social networks): in such scenarios static community discovery fails to identify a partition of the graph that is semantically consistent with the temporal information expressed by the data. In this work we propose Tiles, an algorithm that extracts overlapping communities and tracks their evolution in time following an online iterative procedure. Our algorithm operates following a domino effect strategy, dynamically recomputing nodes community memberships whenever a new interaction takes place. We compare Tiles with state-of-the-art community detection algorithms on both synthetic and real world networks having annotated community structure: our experiments show that the proposed approach is able to guarantee lower execution times and better correspondence with the ground truth communities than its competitors. Moreover, we illustrate the specifics of the proposed approach by discussing the properties of identified communities it is able to identify.


international conference data science | 2014

The purpose of motion: Learning activities from Individual Mobility Networks

Salvatore Rinzivillo; Lorenzo Gabrielli; Mirco Nanni; Luca Pappalardo; Dino Pedreschi; Fosca Giannotti

The large availability of mobility data allows us to investigate complex phenomena about human movement. However this adundance of data comes with few information about the purpose of movement. In this work we address the issue of activity recognition by introducing Activity-Based Cascading (ABC) classification. Such approach departs completely from probabilistic approaches for two main reasons. First, it exploits a set of structural features extracted from the Individual Mobility Network (IMN), a model able to capture the salient aspects of individual mobility. Second, it uses a cascading classification as a way to tackle the highly skewed frequency of activity classes. We show that our approach outperforms existing state-of-the-art probabilistic methods. Since it reaches high precision, ABC classification represents a very reliable semantic amplifier for Big Data.


social informatics | 2013

The Three Dimensions of Social Prominence

Diego Pennacchioli; Giulio Rossetti; Luca Pappalardo; Dino Pedreschi; Fosca Giannotti; Michele Coscia

One classic problem definition in social network analysis is the study of diffusion in networks, which enables us to tackle problems like favoring the adoption of positive technologies. Most of the attention has been turned to how to maximize the number of influenced nodes, but this approach misses the fact that different scenarios imply different diffusion dynamics, only slightly related to maximizing the number of nodes involved. In this paper we measure three different dimensions of social prominence: the Width, i.e. the ratio of neighbors influenced by a node; the Depth, i.e. the degrees of separation from a node to the nodes perceiving its prominence; and the Strength, i.e. the intensity of the prominence of a node. By defining a procedure to extract prominent users in complex networks, we detect associations between the three dimensions of social prominence and classical network statistics. We validate our results on a social network extracted from the Last.Fm music platform.


Data Mining and Knowledge Discovery | 2018

Data-driven generation of spatio-temporal routines in human mobility

Luca Pappalardo; Filippo Simini

The generation of realistic spatio-temporal trajectories of human mobility is of fundamental importance in a wide range of applications, such as the developing of protocols for mobile ad-hoc networks or what-if analysis in urban ecosystems. Current generative algorithms fail in accurately reproducing the individuals’ recurrent schedules and at the same time in accounting for the possibility that individuals may break the routine during periods of variable duration. In this article we present Ditras (DIary-based TRAjectory Simulator), a framework to simulate the spatio-temporal patterns of human mobility. Ditras operates in two steps: the generation of a mobility diary and the translation of the mobility diary into a mobility trajectory. We propose a data-driven algorithm which constructs a diary generator from real data, capturing the tendency of individuals to follow or break their routine. We also propose a trajectory generator based on the concept of preferential exploration and preferential return. We instantiate Ditras with the proposed diary and trajectory generators and compare the resulting algorithm with real data and synthetic data produced by other generative algorithms, built by instantiating Ditras with several combinations of diary and trajectory generators. We show that the proposed algorithm reproduces the statistical properties of real trajectories in the most accurate way, making a step forward the understanding of the origin of the spatio-temporal patterns of human mobility.


Procedia Computer Science | 2016

Human Mobility Modelling: Exploration and Preferential Return Meet the Gravity Model

Luca Pappalardo; Salvatore Rinzivillo; Filippo Simini

Modeling the properties of individual human mobility is a challenging task that has received increasing attention in the last decade. Since mobility is a complex system, when modeling individual human mobility one should take into account that human movements at a collective level influence, and are influenced by, human movement at an individual level. In this paper the authors propose the d-EPR model, which exploits collective information and the gravity model to drive the movements of an individual and the exploration of new places on the mobility space. They implement their model to simulate the mobility of thousands synthetic individuals, and compare the synthetic movements with real trajectories of mobile phone users and synthetic trajectories produced by a prominent individual mobility model. The authors show that the distributions of global mobility measures computed on the trajectories produced by the d-EPR model are much closer to empirical data, highlighting the importance of considering collective information when simulating individual human mobility.


CompleNet | 2016

A Novel Approach to Evaluate Community Detection Algorithms on Ground Truth

Giulio Rossetti; Luca Pappalardo; Salvatore Rinzivillo

Evaluating a community detection algorithm is a complex task due to the lack of a shared and universally accepted definition of community. In literature, one of the most common way to assess the performances of a community detection algorithm is to compare its output with given ground truth communities by using computationally expensive metrics (i.e., Normalized Mutual Information). In this paper we propose a novel approach aimed at evaluating the adherence of a community partition to the ground truth: our methodology provides more information than the state-of-the-art ones and is fast to compute on large-scale networks. We evaluate its correctness by applying it to six popular community detection algorithms on four large-scale network datasets. Experimental results show how our approach allows to easily evaluate the obtained communities on the ground truth and to characterize the quality of community detection algorithms.

Collaboration


Dive into the Luca Pappalardo's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Fosca Giannotti

National Research Council

View shared research outputs
Top Co-Authors

Avatar

Giulio Rossetti

Istituto di Scienza e Tecnologie dell'Informazione

View shared research outputs
Top Co-Authors

Avatar

Salvatore Rinzivillo

Istituto di Scienza e Tecnologie dell'Informazione

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Fosca Giannotti

National Research Council

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Francesca Pratesi

Istituto di Scienza e Tecnologie dell'Informazione

View shared research outputs
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge