<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Luca Corbucci</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Roberto Pellungrini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Enhancing Privacy and Utility in Federated Learning: A Hybrid P2P and Server-Based Approach with Differential Privacy Protection</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 21st International Conference on Security and Cryptography - SECRYPT</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2024</style></year></dates><publisher><style face="normal" font="default" size="100%">INSTICC</style></publisher><isbn><style face="normal" font="default" size="100%">978-989-758-709-2</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Muscato, Benedetta</style></author><author><style face="normal" font="default" size="100%">Mala, Chandana Sree</style></author><author><style face="normal" font="default" size="100%">Marchiori Manerba, Marta</style></author><author><style face="normal" font="default" size="100%">Gezici, Gizem</style></author><author><style face="normal" font="default" size="100%">Giannotti, Fosca</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Abercrombie, Gavin</style></author><author><style face="normal" font="default" size="100%">Basile, Valerio</style></author><author><style face="normal" font="default" size="100%">Bernadi, Davide</style></author><author><style face="normal" font="default" size="100%">Dudy, Shiran</style></author><author><style face="normal" font="default" size="100%">Frenda, Simona</style></author><author><style face="normal" font="default" size="100%">Havens, Lucy</style></author><author><style face="normal" font="default" size="100%">Tonelli, Sara</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">An Overview of Recent Approaches to Enable Diversity in Large Language Models through Aligning with Human Perspectives</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 3rd Workshop on Perspectivist Approaches to NLP (NLPerspectives) @ LREC-COLING 2024</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2024</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://aclanthology.org/2024.nlperspectives-1.5/</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">ELRA and ICCL</style></publisher><pub-location><style face="normal" font="default" size="100%">Torino, Italia</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The varied backgrounds and experiences of human annotators inject different opinions and potential biases into the data, inevitably leading to disagreements. Yet, traditional aggregation methods fail to capture individual judgments since they rely on the notion of a single ground truth. Our aim is to review prior contributions to pinpoint the shortcomings that might cause stereotypical content generation. As a preliminary study, our purpose is to investigate state-of-the-art approaches, primarily focusing on the following two research directions. First, we investigate how adding subjectivity aspects to LLMs might guarantee diversity. We then look into the alignment between humans and LLMs and discuss how to measure it. Considering existing gaps, our review explores possible methods to mitigate the perpetuation of biases targeting specific communities. However, we recognize the potential risk of disseminating sensitive information due to the utilization of socio-demographic data in the training process. These considerations underscore the inclusion of diverse perspectives while taking into account the critical importance of implementing robust safeguards to protect individuals' privacy and prevent the inadvertent propagation of sensitive information.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Luca Corbucci</style></author><author><style face="normal" font="default" size="100%">Mikko A Heikkila</style></author><author><style face="normal" font="default" size="100%">David Solans Noguero</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Nicolas Kourtellis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">PUFFLE: Balancing Privacy, Utility, and Fairness in Federated Learning</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2024</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://arxiv.org/abs/2407.15224</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Francesca Naretto</style></author><author><style face="normal" font="default" size="100%">Simone Rizzo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Agnostic Label-Only Membership Inference Attack</style></title><secondary-title><style face="normal" font="default" size="100%">17th International Conference on Network and System Security</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2023</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesca Naretto</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Evaluating the Privacy Exposure of Interpretable Global and Local Explainers</style></title><secondary-title><style face="normal" font="default" size="100%">Submitted at Journal of Artificial Intelligence and Law</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2023</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Luca Corbucci</style></author><author><style face="normal" font="default" size="100%">Guidotti, Riccardo</style></author><author><style face="normal" font="default" size="100%">Monreale, Anna</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Explaining Black-Boxes in Federated Learning</style></title><secondary-title><style face="normal" font="default" size="100%">Explainable Artificial Intelligence</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2023</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer Nature Switzerland</style></publisher><pub-location><style face="normal" font="default" size="100%">Cham</style></pub-location><isbn><style face="normal" font="default" size="100%">978-3-031-44067-0</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Federated Learning has witnessed increasing popularity in the past few years for its ability to train Machine Learning models in critical contexts, using private data without moving them. Most of the work in the literature proposes algorithms and architectures for training neural networks, which although they present high performance in different predicting tasks and are easy to be learned with a cooperative mechanism, their predictive reasoning is obscure. Therefore, in this paper, we propose a variant of SHAP, one of the most widely used explanation methods, tailored to Horizontal server-based Federated Learning. The basic idea is having the possibility to explain an instance's prediction performed by the trained Machine Leaning model as an aggregation of the explanations provided by the clients participating in the cooperation. We empirically test our proposal on two different tabular datasets, and we observe interesting and encouraging preliminary results.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Daniele Gambetta</style></author><author><style face="normal" font="default" size="100%">Giovanni Mauro</style></author><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Mobility Constraints in Segregation Models</style></title><secondary-title><style face="normal" font="default" size="100%">Scientific Reports</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2023</style></year></dates><volume><style face="normal" font="default" size="100%">13</style></volume><pages><style face="normal" font="default" size="100%">12087</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Since the development of the original Schelling model of urban segregation, several enhancements have been proposed, but none have considered the impact of mobility constraints on model dynamics. Recent studies have shown that human mobility follows specific patterns, such as a preference for short distances and dense locations. This paper proposes a segregation model incorporating mobility constraints to make agents select their location based on distance and location relevance. Our findings indicate that the mobility-constrained model produces lower segregation levels but takes longer to converge than the original Schelling model. We identified a few persistently unhappy agents from the minority group who cause this prolonged convergence time and lower segregation level as they move around the grid centre. Our study presents a more realistic representation of how agents move in urban areas and provides a novel and insightful approach to analyzing the impact of mobility constraints on segregation models. We highlight the significance of incorporating mobility constraints when policymakers design interventions to address urban segregation.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Failla, Andrea</style></author><author><style face="normal" font="default" size="100%">Mazzoni, Federico</style></author><author><style face="normal" font="default" size="100%">Citraro, Salvatore</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Attribute-aware Community Events in Feature-rich Dynamic Networks</style></title><secondary-title><style face="normal" font="default" size="100%">Complex Networks and Their Applications XI: Proceedings of The Eleventh International Conference on Complex Networks and Their Applications: COMPLEX NETWORKS 2022—Book of Abstracts</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2022</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Valentina Pansanella</style></author><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Letizia Milli</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">From Mean-Field to Complex Topologies: Network Effects on the Algorithmic Bias Model</style></title><secondary-title><style face="normal" font="default" size="100%">Complex Networks &amp; Their Applications X</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2022</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giovanni Mauro</style></author><author><style face="normal" font="default" size="100%">Luca, Massimiliano</style></author><author><style face="normal" font="default" size="100%">Longa, Antonio</style></author><author><style face="normal" font="default" size="100%">Lepri, Bruno</style></author><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Generating mobility networks with generative adversarial networks</style></title><secondary-title><style face="normal" font="default" size="100%">EPJ data science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2022</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">11</style></volume><pages><style face="normal" font="default" size="100%">58</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The increasingly crucial role of human displacements in complex societal phenomena, such as traffic congestion, segregation, and the diffusion of epidemics, is attracting the interest of scientists from several disciplines. In this article, we address mobility network generation, i.e., generating a city’s entire mobility network, a weighted directed graph in which nodes are geographic locations and weighted edges represent people’s movements between those locations, thus describing the entire mobility set flows within a city. Our solution is MoGAN, a model based on Generative Adversarial Networks (GANs) to generate realistic mobility networks. We conduct extensive experiments on public datasets of bike and taxi rides to show that MoGAN outperforms the classical Gravity and Radiation models regarding the realism of the generated networks. Our model can be used for data augmentation and performing simulations and what-if analysis.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Cornacchia, Giuliano</style></author><author><style face="normal" font="default" size="100%">Böhm, Matteo</style></author><author><style face="normal" font="default" size="100%">Giovanni Mauro</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">How Routing Strategies Impact Urban Emissions</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 30th International Conference on Advances in Geographic Information Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2022</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1145/3557915.3560977</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Association for Computing Machinery</style></publisher><pub-location><style face="normal" font="default" size="100%">New York, NY, USA</style></pub-location><isbn><style face="normal" font="default" size="100%">9781450395298</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Navigation apps use routing algorithms to suggest the best path to reach a user's desired destination. Although undoubtedly useful, navigation apps' impact on the urban environment (e.g., CO2 emissions and pollution) is still largely unclear. In this work, we design a simulation framework to assess the impact of routing algorithms on carbon dioxide emissions within an urban environment. Using APIs from TomTom and OpenStreetMap, we find that settings in which either all vehicles or none of them follow a navigation app's suggestion lead to the worst impact in terms of CO2 emissions. In contrast, when just a portion (around half) of vehicles follow these suggestions, and some degree of randomness is added to the remaining vehicles' paths, we observe a reduction in the overall CO2 emissions over the road network. Our work is a first step towards designing next-generation routing principles that may increase urban well-being while satisfying individual needs.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michela Natilli</style></author><author><style face="normal" font="default" size="100%">Alessio Rossi</style></author><author><style face="normal" font="default" size="100%">Trecroci, Athos</style></author><author><style face="normal" font="default" size="100%">Cavaggioni, Luca</style></author><author><style face="normal" font="default" size="100%">Merati, Giampiero</style></author><author><style face="normal" font="default" size="100%">Formenti, Damiano</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The long-tail effect of the COVID-19 lockdown on Italians’ quality of life, sleep and physical activity</style></title><secondary-title><style face="normal" font="default" size="100%">Scientific Data</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2022</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.nature.com/articles/s41597-022-01376-5</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">1–10</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">From March 2020 to May 2021, several lockdown periods caused by the COVID-19 pandemic have limited people’s usual activities and mobility in Italy, as well as around the world. These unprecedented confinement measures dramatically modified citizens’ daily lifestyles and behaviours. However, with the advent of summer 2021 and thanks to the vaccination campaign that significantly prevents serious illness and death, and reduces the risk of contagion, all the Italian regions finally returned to regular behaviours and routines. Anyhow, it is unclear if there is a long-tail effect on people’s quality of life, sleep- and physical activity-related behaviours. Thanks to the dataset described in this paper, it will be possible to obtain accurate insights of the changes induced by the lockdown period in the Italians’ health that will permit to provide practical suggestions at local, regional, and state institutions and companies to improve infrastructures and services that could be beneficial to Italians’ well being.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michele Fontana</style></author><author><style face="normal" font="default" size="100%">Francesca Naretto</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Stefan Schlobach</style></author><author><style face="normal" font="default" size="100%">María Pérez-Ortiz</style></author><author><style face="normal" font="default" size="100%">Myrthe Tielman</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Monitoring Fairness in HOLDA</style></title><secondary-title><style face="normal" font="default" size="100%">HHAI 2022: Augmenting Human Intellect - Proceedings of the First International Conference on Hybrid Human-Artificial Intelligence, Amsterdam, The Netherlands, 13-17 June 2022</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2022</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.3233/FAIA220205</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">IOS Press</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Luca Corbucci</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Cecilia Panigutti</style></author><author><style face="normal" font="default" size="100%">Michela Natilli</style></author><author><style face="normal" font="default" size="100%">Smiraglio, Simona</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Semantic Enrichment of XAI Explanations for Healthcare</style></title><secondary-title><style face="normal" font="default" size="100%">24th International Conference on Artificial Intelligence</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2022</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Explaining black-box models decisions is crucial to increase doctors' trust in AI-based clinical decision support systems. However, current eXplainable Artificial Intelligence (XAI) techniques usually provide explanations that are not easily understandable by experts outside of AI. Furthermore, most of the them produce explanations that consider only the input features of the algorithm. However, broader information about the clinical context of a patient is usually available even if not processed by the AI-based clinical decision support system for its decision. Enriching the explanations with relevant clinical information concerning the health status of a patient would increase the ability of human experts to assess the reliability of the AI decision. Therefore, in this paper we present a methodology that aims to enable clinical reasoning by semantically enriching AI explanations. Starting from a medical AI explanation based only on the input features provided to the algorithm, our methodology leverages medical ontologies and NLP embedding techniques to link relevant information present in the patient's clinical notes to the original explanation. We validate our methodology with two experiments involving a human expert. Our results highlight promising performance in correctly identifying relevant information about the diseases of the patients, in particular about the associated morphology. This suggests that the presented methodology could be a first step toward developing a natural language explanation of AI decision support systems.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Guidotti, Riccardo</style></author><author><style face="normal" font="default" size="100%">Monreale, Anna</style></author><author><style face="normal" font="default" size="100%">Ruggieri, Salvatore</style></author><author><style face="normal" font="default" size="100%">Naretto, Francesca</style></author><author><style face="normal" font="default" size="100%">Turini, Franco</style></author><author><style face="normal" font="default" size="100%">Pedreschi, Dino</style></author><author><style face="normal" font="default" size="100%">Giannotti, Fosca</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Stable and actionable explanations of black-box models through factual and counterfactual rules</style></title><secondary-title><style face="normal" font="default" size="100%">Data Mining and Knowledge Discovery</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2022</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Joseph, Simmi Marina</style></author><author><style face="normal" font="default" size="100%">Salvatore Citraro</style></author><author><style face="normal" font="default" size="100%">Morini, Virginia</style></author><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Stella, Massimo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Cognitive network science quantifies feelings expressed in suicide letters and Reddit mental health communities</style></title><secondary-title><style face="normal" font="default" size="100%">arXiv preprint arXiv:2110.15269</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Salvatore Citraro</style></author><author><style face="normal" font="default" size="100%">Letizia Milli</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Conformity: a Path-Aware Homophily measure for Node-Attributed Networks</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Intelligent SystemsIEEE Intelligent Systems</style></secondary-title><short-title><style face="normal" font="default" size="100%">IEEE Intelligent Systems</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2021</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/9321348</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">1 - 1</style></pages><isbn><style face="normal" font="default" size="100%">1941-1294</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Unveil the homophilic/heterophilic behaviors that characterize the wiring patterns of complex networks is an important task in social network analysis, often approached studying the assortative mixing of node attributes. Recent works underlined that a global measure to quantify node homophily necessarily provides a partial, often deceiving, picture of the reality. Moving from such literature, in this work, we propose a novel measure, namely Conformity, designed to overcome such limitation by providing a node-centric quantification of assortative mixing patterns. Differently from the measures proposed so far, Conformity is designed to be path-aware, thus allowing for a more detailed evaluation of the impact that nodes at different degrees of separations have on the homophilic embeddedness of a target. Experimental analysis on synthetic and real data allowed us to observe that Conformity can unveil valuable insights from node-attributed graphs.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Andrienko, Gennady</style></author><author><style face="normal" font="default" size="100%">Barabasi, Albert-Laszlo</style></author><author><style face="normal" font="default" size="100%">Boldrini, Chiara</style></author><author><style face="normal" font="default" size="100%">Bonchi, Francesco</style></author><author><style face="normal" font="default" size="100%">Cattuto, Ciro</style></author><author><style face="normal" font="default" size="100%">Chiaromonte, Francesca</style></author><author><style face="normal" font="default" size="100%">Comandé, Giovanni</style></author><author><style face="normal" font="default" size="100%">Conti, Marco</style></author><author><style face="normal" font="default" size="100%">Coté, Mark</style></author><author><style face="normal" font="default" size="100%">Dignum, Frank</style></author><author><style face="normal" font="default" size="100%">Dignum, Virginia</style></author><author><style face="normal" font="default" size="100%">Domingo-Ferrer, Josep</style></author><author><style face="normal" font="default" size="100%">Ferragina, Paolo</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Helbing, Dirk</style></author><author><style face="normal" font="default" size="100%">Kaski, Kimmo</style></author><author><style face="normal" font="default" size="100%">Kertész, János</style></author><author><style face="normal" font="default" size="100%">Lehmann, Sune</style></author><author><style face="normal" font="default" size="100%">Lepri, Bruno</style></author><author><style face="normal" font="default" size="100%">Lukowicz, Paul</style></author><author><style face="normal" font="default" size="100%">Matwin, Stan</style></author><author><style face="normal" font="default" size="100%">Jiménez, David Megías</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Morik, Katharina</style></author><author><style face="normal" font="default" size="100%">Oliver, Nuria</style></author><author><style face="normal" font="default" size="100%">Passarella, Andrea</style></author><author><style face="normal" font="default" size="100%">Passerini, Andrea</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Pentland, Alex</style></author><author><style face="normal" font="default" size="100%">Pianesi, Fabio</style></author><author><style face="normal" font="default" size="100%">Francesca Pratesi</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author><author><style face="normal" font="default" size="100%">Salvatore Ruggieri</style></author><author><style face="normal" font="default" size="100%">Siebes, Arno</style></author><author><style face="normal" font="default" size="100%">Torra, Vicenc</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author><author><style face="normal" font="default" size="100%">Hoven, Jeroen van den</style></author><author><style face="normal" font="default" size="100%">Vespignani, Alessandro</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Give more data, awareness and control to individual citizens, and they will help COVID-19 containment</style></title><short-title><style face="normal" font="default" size="100%">Ethics and Information Technology</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2021/02/02</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/article/10.1007/s10676-020-09572-w</style></url></web-urls></urls><isbn><style face="normal" font="default" size="100%">1572-8439</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The rapid dynamics of COVID-19 calls for quick and effective tracking of virus transmission chains and early detection of outbreaks, especially in the “phase 2” of the pandemic, when lockdown and other restriction measures are progressively withdrawn, in order to avoid or minimize contagion resurgence. For this purpose, contact-tracing apps are being proposed for large scale adoption by many countries. A centralized approach, where data sensed by the app are all sent to a nation-wide server, raises concerns about citizens’ privacy and needlessly strong digital surveillance, thus alerting us to the need to minimize personal data collection and avoiding location tracking. We advocate the conceptual advantage of a decentralized approach, where both contact and location data are collected exclusively in individual citizens’ “personal data stores”, to be shared separately and selectively (e.g., with a backend system, but possibly also with other citizens), voluntarily, only when the citizen has tested positive for COVID-19, and with a privacy preserving level of granularity. This approach better protects the personal sphere of citizens and affords multiple benefits: it allows for detailed information gathering for infected people in a privacy-preserving fashion; and, in turn this enables both contact tracing, and, the early detection of outbreak hotspots on more finely-granulated geographic scale. The decentralized approach is also scalable to large populations, in that only the data of positive patients need be handled at a central level. Our recommendation is two-fold. First to extend existing decentralized architectures with a light touch, in order to manage the collection of location data locally on the device, and allow the user to share spatio-temporal aggregates—if and when they want and for specific aims—with health authorities, for instance. Second, we favour a longer-term pursuit of realizing a Personal Data Store vision, giving users the opportunity to contribute to collective good in the measure they want, enhancing self-awareness, and cultivating collective efforts for rebuilding society.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mattia Setzu</style></author><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">GLocalX - From Local to Global Explanations of Black Box AI Models</style></title><short-title><style face="normal" font="default" size="100%">Artificial Intelligence</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2021/05/01/</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/pii/S0004370221000084</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">294</style></volume><pages><style face="normal" font="default" size="100%">103457</style></pages><isbn><style face="normal" font="default" size="100%">0004-3702</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Artificial Intelligence (AI) has come to prominence as one of the major components of our society, with applications in most aspects of our lives. In this field, complex and highly nonlinear machine learning models such as ensemble models, deep neural networks, and Support Vector Machines have consistently shown remarkable accuracy in solving complex tasks. Although accurate, AI models often are “black boxes” which we are not able to understand. Relying on these models has a multifaceted impact and raises significant concerns about their transparency. Applications in sensitive and critical domains are a strong motivational factor in trying to understand the behavior of black boxes. We propose to address this issue by providing an interpretable layer on top of black box models by aggregating “local” explanations. We present GLocalX, a “local-first” model agnostic explanation method. Starting from local explanations expressed in form of local decision rules, GLocalX iteratively generalizes them into global explanations by hierarchically aggregating them. Our goal is to learn accurate yet simple interpretable models to emulate the given black box, and, if possible, replace it entirely. We validate GLocalX in a set of experiments in standard and constrained settings with limited or no access to either data or local explanations. Experiments show that GLocalX is able to accurately emulate several models with simple and small models, reaching state-of-the-art performance against natively global solutions. Our findings show how it is often possible to achieve a high level of both accuracy and comprehensibility of classification models, even in complex domains with high-dimensional data, without necessarily trading one property for the other. This is a key requirement for a trustworthy AI, necessary for adoption in high-stakes decision making applications.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fontana, Michele</style></author><author><style face="normal" font="default" size="100%">Naretto, Francesca</style></author><author><style face="normal" font="default" size="100%">Monreale, Anna</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A new approach for cross-silo federated learning and its privacy risks</style></title><secondary-title><style face="normal" font="default" size="100%">2021 18th International Conference on Privacy, Security and Trust (PST)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michele Fontana</style></author><author><style face="normal" font="default" size="100%">Francesca Naretto</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A new approach for cross-silo federated learning and its privacy risks</style></title><secondary-title><style face="normal" font="default" size="100%">18th International Conference on Privacy, Security and Trust, PST 2021, Auckland, New Zealand, December 13-15, 2021</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1109/PST52912.2021.9647753</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giacomo Mariani</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Francesca Naretto</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Carlos Soares</style></author><author><style face="normal" font="default" size="100%">Luís Torgo</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Privacy Risk Assessment of Individual Psychometric Profiles</style></title><secondary-title><style face="normal" font="default" size="100%">Discovery Science - 24th International Conference, DS 2021, Halifax, NS, Canada, October 11-13, 2021, Proceedings</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-030-88942-5_32</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Morini, Virginia</style></author><author><style face="normal" font="default" size="100%">Pollacci, Laura</style></author><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Toward a Standard Approach for Echo Chamber Detection: Reddit Case Study</style></title><secondary-title><style face="normal" font="default" size="100%">Applied Sciences</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year></dates><number><style face="normal" font="default" size="100%">12</style></number><volume><style face="normal" font="default" size="100%">11</style></volume><pages><style face="normal" font="default" size="100%">5390</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Lorenzoni, Valentina</style></author><author><style face="normal" font="default" size="100%">Triulzi, Isotta</style></author><author><style face="normal" font="default" size="100%">Martinucci, Irene</style></author><author><style face="normal" font="default" size="100%">Toncelli, Letizia</style></author><author><style face="normal" font="default" size="100%">Michela Natilli</style></author><author><style face="normal" font="default" size="100%">Barale, Roberto</style></author><author><style face="normal" font="default" size="100%">Turchetti, Giuseppe</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Understanding eating choices among university students: A study using data from cafeteria cashiers’ transactions</style></title><secondary-title><style face="normal" font="default" size="100%">Health Policy</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year></dates><number><style face="normal" font="default" size="100%">5</style></number><volume><style face="normal" font="default" size="100%">125</style></volume><pages><style face="normal" font="default" size="100%">665–673</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michela Natilli</style></author><author><style face="normal" font="default" size="100%">Daniele Fadda</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Licari, Federica</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Sekerinski, Emil</style></author><author><style face="normal" font="default" size="100%">Moreira, Nelma</style></author><author><style face="normal" font="default" size="100%">Oliveira, José N.</style></author><author><style face="normal" font="default" size="100%">Ratiu, Daniel</style></author><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Farrell, Marie</style></author><author><style face="normal" font="default" size="100%">Luckcuck, Matt</style></author><author><style face="normal" font="default" size="100%">Marmsoler, Diego</style></author><author><style face="normal" font="default" size="100%">Campos, José</style></author><author><style face="normal" font="default" size="100%">Astarte, Troy</style></author><author><style face="normal" font="default" size="100%">Gonnord, Laure</style></author><author><style face="normal" font="default" size="100%">Cerone, Antonio</style></author><author><style face="normal" font="default" size="100%">Couto, Luis</style></author><author><style face="normal" font="default" size="100%">Dongol, Brijesh</style></author><author><style face="normal" font="default" size="100%">Kutrib, Martin</style></author><author><style face="normal" font="default" size="100%">Monteiro, Pedro</style></author><author><style face="normal" font="default" size="100%">Delmas, David</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Analysis and Visualization of Performance Indicators in University Admission Tests</style></title><secondary-title><style face="normal" font="default" size="100%">Formal Methods. FM 2019 International Workshops</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2020//</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-030-54994-7_14</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pub-location><style face="normal" font="default" size="100%">Cham</style></pub-location><isbn><style face="normal" font="default" size="100%">978-3-030-54994-7</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This paper presents an analytical platform for evaluation of the performance and anomaly detection of tests for admission to public universities in Italy. Each test is personalized for each student and is composed of a series of questions, classified on different domains (e.g. maths, science, logic, etc.). Since each test is unique for composition, it is crucial to guarantee a similar level of difficulty for all the tests in a session. For this reason, to each question, it is assigned a level of difficulty from a domain expert. Thus, the general difficultness of a test depends on the correct classification of each item. We propose two approaches to detect outliers. A visualization-based approach using dynamic filter and responsive visual widgets. A data mining approach to evaluate the performance of the different questions for five years. We used clustering to group the questions according to a set of performance indicators to provide labeling of the data-driven level of difficulty. The measured level is compared with the a priori assigned by experts. The misclassifications are then highlighted to the expert, who will be able to refine the question or the classification. Sequential pattern mining is used to check if biases are present in the composition of the tests and their performance. This analysis is meant to exclude overlaps or direct dependencies among questions. Analyzing co-occurrences we are able to state that the composition of each test is fair and uniform for all the students, even on several sessions. The analytical results are presented to the expert through a visual web application that loads the analytical data and indicators and composes an interactive dashboard. The user may explore the patterns and models extracted by filtering and changing thresholds and analytical parameters.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Ioanna Miliou</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Artificial Intelligence (AI): new developments and innovations applied to e-commerce</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year><pub-dates><date><style  face="normal" font="default" size="100%">05/2020</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.europarl.europa.eu/thinktank/en/document.html?reference=IPOL_IDA(2020)648791</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">European Parliament's committee on the Internal Market and Consumer Protection</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This in-depth analysis discusses the opportunities and challenges brought by the recent and the foreseeable developments of Artificial Intelligence into online platforms and marketplaces. The paper advocates the importance to support tustworthy, explainable AI (in order to fight discrimination and manipulation, and empower citizens), and societal-aware AI (in order to fight polarisation, monopolistic concentration and excessive inequality, and pursue diversity and openness).
This document was provided by the Policy Department for Economic, Scientific and Quality of Life Policies at the request of the committee on the Internal Market and Consumer Protection (IMCO).</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dong, Boxiang</style></author><author><style face="normal" font="default" size="100%">Wang, Hui</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Guo, Wenge</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Authenticated Outlier Mining for Outsourced Databases</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Transactions on Dependable and Secure Computing</style></secondary-title><short-title><style face="normal" font="default" size="100%">IEEE Trans. Dependable and Secure Comput.</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Jan-03-2020</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=8858https://ieeexplore.ieee.org/document/8048342/http://xplorestaging.ieee.org/ielx7/8858/9034462/08048342.pdf?arnumber=8048342https://ieeexplore.ieee.org/ielam/8858/9034462/8048342-aam.pdf</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">17</style></volume><pages><style face="normal" font="default" size="100%">222 - 235</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The Data-Mining-as-a-Service (DMaS) paradigm is becoming the focus of research, as it allows the data owner (client) who lacks expertise and/or computational resources to outsource their data and mining needs to a third-party service provider (server). Outsourcing, however, raises some issues about result integrity: how could the client verify the mining results returned by the server are both sound and complete? In this paper, we focus on outlier mining, an important mining task. Previous verification techniques use an authenticated data structure (ADS) for correctness authentication, which may incur much space and communication cost. In this paper, we propose a novel solution that returns a probabilistic result integrity guarantee with much cheaper verification cost. The key idea is to insert a set of artificial records (ARs) into the dataset, from which it constructs a set of artificial outliers (AOs) and artificial non-outliers (ANOs). The AOs and ANOs are used by the client to detect any incomplete and/or incorrect mining results with a probabilistic guarantee. The main challenge that we address is how to construct ARs so that they do not change the (non-)outlierness of original records, while guaranteeing that the client can identify ANOs and AOs without executing mining. Furthermore, we build a strategic game and show that a Nash equilibrium exists only when the server returns correct outliers. Our implementation and experiments demonstrate that our verification solution is efficient and lightweight.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Matwin, Stan</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Brefeld, Ulf</style></author><author><style face="normal" font="default" size="100%">Fromont, Elisa</style></author><author><style face="normal" font="default" size="100%">Hotho, Andreas</style></author><author><style face="normal" font="default" size="100%">Knobbe, Arno</style></author><author><style face="normal" font="default" size="100%">Maathuis, Marloes</style></author><author><style face="normal" font="default" size="100%">Robardet, Céline</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Black Box Explanation by Learning Image Exemplars in the Latent Feature Space</style></title><secondary-title><style face="normal" font="default" size="100%">Machine Learning and Knowledge Discovery in Databases</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2020//</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-030-46150-8_12</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pub-location><style face="normal" font="default" size="100%">Cham</style></pub-location><isbn><style face="normal" font="default" size="100%">978-3-030-46150-8</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We present an approach to explain the decisions of black box models for image classification. While using the black box to label images, our explanation method exploits the latent feature space learned through an adversarial autoencoder. The proposed method first generates exemplar images in the latent feature space and learns a decision tree classifier. Then, it selects and decodes exemplars respecting local decision rules. Finally, it visualizes them in a manner that shows to the user how the exemplars can be modified to either stay within their class, or to become counter-factuals by “morphing” into another class. Since we focus on black box decision systems for image classification, the explanation obtained from the exemplars also provides a saliency map highlighting the areas of the image that contribute to its classification, and areas of the image that push it into another class. We present the results of an experimental evaluation on three datasets and two black box models. Besides providing the most useful and interpretable explanations, we show that the proposed method outperforms existing explainers in terms of fidelity, relevance, coherence, and stability.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Morini, Virginia</style></author><author><style face="normal" font="default" size="100%">Pollacci, Laura</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Capturing Political Polarization of Reddit Submissions in the Trump Era</style></title><secondary-title><style face="normal" font="default" size="100%">SEBD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Salvatore Citraro</style></author><author><style face="normal" font="default" size="100%">Letizia Milli</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Conformity: A Path-Aware Homophily Measure for Node-Attributed Networks</style></title><secondary-title><style face="normal" font="default" size="100%">arXiv preprint arXiv:2012.05195</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alessio Rossi</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Clifton, David A.</style></author><author><style face="normal" font="default" size="100%">Morelli, Davide</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Error Estimation of Ultra-Short Heart Rate Variability Parameters: Effect of Missing Data Caused by Motion Artifacts</style></title><secondary-title><style face="normal" font="default" size="100%">Sensors</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.mdpi.com/1424-8220/20/24/7122</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">24</style></number><volume><style face="normal" font="default" size="100%">20</style></volume><pages><style face="normal" font="default" size="100%">7122</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Application of ultra&amp;ndash;short Heart Rate Variability (HRV) is desirable in order to increase the applicability of HRV features to wrist-worn wearable devices equipped with heart rate sensors that are nowadays becoming more and more popular in people&amp;rsquo;s daily life. This study is focused in particular on the the two most used HRV parameters, i.e., the standard deviation of inter-beat intervals (SDNN) and the root Mean Squared error of successive inter-beat intervals differences (rMSSD). The huge problem of extracting these HRV parameters from wrist-worn devices is that their data are affected by the motion artifacts. For this reason, estimating the error caused by this huge quantity of missing values is fundamental to obtain reliable HRV parameters from these devices. To this aim, we simulate missing values induced by motion artifacts (from 0 to 70%) in an ultra-short time window (i.e., from 4 min to 30 s) by the random walk Gilbert burst model in 22 young healthy subjects. In addition, 30 s and 2 min ultra-short time windows are required to estimate rMSSD and SDNN, respectively. Moreover, due to the fact that ultra-short time window does not permit assessing very low frequencies, and the SDNN is highly affected by these frequencies, the bias for estimating SDNN continues to increase as the time window length decreases. On the contrary, a small error is detected in rMSSD up to 30 s due to the fact that it is highly affected by high frequencies which are possible to be evaluated even if the time window length decreases. Finally, the missing values have a small effect on rMSSD and SDNN estimation. As a matter of fact, the HRV parameter errors increase slightly as the percentage of missing values increase.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Forgó, Nikolaus</style></author><author><style face="normal" font="default" size="100%">Hänold, Stefanie</style></author><author><style face="normal" font="default" size="100%">van den Hoven, Jeroen</style></author><author><style face="normal" font="default" size="100%">Krügel, Tina</style></author><author><style face="normal" font="default" size="100%">Lishchuk, Iryna</style></author><author><style face="normal" font="default" size="100%">Mahieu, René</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Francesca Pratesi</style></author><author><style face="normal" font="default" size="100%">van Putten, David</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An ethico-legal framework for social data science</style></title><short-title><style face="normal" font="default" size="100%">International Journal of Data Science and Analytics</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2020/03/31</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/article/10.1007/s41060-020-00211-7</style></url></web-urls></urls><isbn><style face="normal" font="default" size="100%">2364-4168</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This paper presents a framework for research infrastructures enabling ethically sensitive and legally compliant data science in Europe. Our goal is to describe how to design and implement an open platform for big data social science, including, in particular, personal data. To this end, we discuss a number of infrastructural, organizational and methodological principles to be developed for a concrete implementation. These include not only systematically tools and methodologies that effectively enable both the empirical evaluation of the privacy risk and data transformations by using privacy-preserving approaches, but also the development of training materials (a massive open online course) and organizational instruments based on legal and ethical principles. This paper provides, by way of example, the implementation that was adopted within the context of the SoBigData Research Infrastructure.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Lampridis, Orestis</style></author><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Salvatore Ruggieri</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Appice, Annalisa</style></author><author><style face="normal" font="default" size="100%">Tsoumakas, Grigorios</style></author><author><style face="normal" font="default" size="100%">Manolopoulos, Yannis</style></author><author><style face="normal" font="default" size="100%">Matwin, Stan</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Explaining Sentiment Classification with Synthetic Exemplars and Counter-Exemplars</style></title><secondary-title><style face="normal" font="default" size="100%">Discovery Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2020//</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-030-61527-7_24</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pub-location><style face="normal" font="default" size="100%">Cham</style></pub-location><isbn><style face="normal" font="default" size="100%">978-3-030-61527-7</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We present xspells, a model-agnostic local approach for explaining the decisions of a black box model for sentiment classification of short texts. The explanations provided consist of a set of exemplar sentences and a set of counter-exemplar sentences. The former are examples classified by the black box with the same label as the text to explain. The latter are examples classified with a different label (a form of counter-factuals). Both are close in meaning to the text to explain, and both are meaningful sentences – albeit they are synthetically generated. xspells generates neighbors of the text to explain in a latent space using Variational Autoencoders for encoding text and decoding latent instances. A decision tree is learned from randomly generated neighbors, and used to drive the selection of the exemplars and counter-exemplars. We report experiments on two datasets showing that xspells outperforms the well-known lime method in terms of quality of explanations, fidelity, and usefulness, and that is comparable to it in terms of stability.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mattia Setzu</style></author><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Cellier, Peggy</style></author><author><style face="normal" font="default" size="100%">Driessens, Kurt</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Global Explanations with Local Scoring</style></title><secondary-title><style face="normal" font="default" size="100%">Machine Learning and Knowledge Discovery in Databases</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2020//</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007%2F978-3-030-43823-4_14</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pub-location><style face="normal" font="default" size="100%">Cham</style></pub-location><isbn><style face="normal" font="default" size="100%">978-3-030-43823-4</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Artificial Intelligence systems often adopt machine learning models encoding complex algorithms with potentially unknown behavior. As the application of these “black box” models grows, it is our responsibility to understand their inner working and formulate them in human-understandable explanations. To this end, we propose a rule-based model-agnostic explanation method that follows a local-to-global schema: it generalizes a global explanation summarizing the decision logic of a black box starting from the local explanations of single predicted instances. We define a scoring system based on a rule relevance score to extract global explanations from a set of local explanations in the form of decision rules. Experiments on several datasets and black boxes show the stability, and low complexity of the global explanations provided by the proposed solution in comparison with baselines and state-of-the-art global explainers.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alina Sirbu</style></author><author><style face="normal" font="default" size="100%">Andrienko, Gennady</style></author><author><style face="normal" font="default" size="100%">Andrienko, Natalia</style></author><author><style face="normal" font="default" size="100%">Boldrini, Chiara</style></author><author><style face="normal" font="default" size="100%">Conti, Marco</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Bertoli, Simone</style></author><author><style face="normal" font="default" size="100%">Jisu Kim</style></author><author><style face="normal" font="default" size="100%">Muntean, Cristina Ioana</style></author><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author><author><style face="normal" font="default" size="100%">Passarella, Andrea</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Pollacci, Laura</style></author><author><style face="normal" font="default" size="100%">Francesca Pratesi</style></author><author><style face="normal" font="default" size="100%">Sharma, Rajesh</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Human migration: the big data perspective</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Data Science and Analytics</style></secondary-title><short-title><style face="normal" font="default" size="100%">International Journal of Data Science and Analytics</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2020/03/23</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/article/10.1007%2Fs41060-020-00213-5</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">1–20</style></pages><isbn><style face="normal" font="default" size="100%">2364-4168</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">How can big data help to understand the migration phenomenon? In this paper, we try to answer this question through an analysis of various phases of migration, comparing traditional and novel data sources and models at each phase. We concentrate on three phases of migration, at each phase describing the state of the art and recent developments and ideas. The first phase includes the journey, and we study migration flows and stocks, providing examples where big data can have an impact. The second phase discusses the stay, i.e. migrant integration in the destination country. We explore various data sets and models that can be used to quantify and understand migrant integration, with the final aim of providing the basis for the construction of a novel multi-level integration index. The last phase is related to the effects of migration on the source countries and the return of migrants.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Sekerinski, Emil</style></author><author><style face="normal" font="default" size="100%">Moreira, Nelma</style></author><author><style face="normal" font="default" size="100%">Oliveira, José N.</style></author><author><style face="normal" font="default" size="100%">Ratiu, Daniel</style></author><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Farrell, Marie</style></author><author><style face="normal" font="default" size="100%">Luckcuck, Matt</style></author><author><style face="normal" font="default" size="100%">Marmsoler, Diego</style></author><author><style face="normal" font="default" size="100%">Campos, José</style></author><author><style face="normal" font="default" size="100%">Astarte, Troy</style></author><author><style face="normal" font="default" size="100%">Gonnord, Laure</style></author><author><style face="normal" font="default" size="100%">Cerone, Antonio</style></author><author><style face="normal" font="default" size="100%">Couto, Luis</style></author><author><style face="normal" font="default" size="100%">Dongol, Brijesh</style></author><author><style face="normal" font="default" size="100%">Kutrib, Martin</style></author><author><style face="normal" font="default" size="100%">Monteiro, Pedro</style></author><author><style face="normal" font="default" size="100%">Delmas, David</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">“Know Thyself” How Personal Music Tastes Shape the Last.Fm Online Social Network</style></title><secondary-title><style face="normal" font="default" size="100%">Formal Methods. FM 2019 International Workshops</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2020//</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-030-54994-7_11</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pub-location><style face="normal" font="default" size="100%">Cham</style></pub-location><isbn><style face="normal" font="default" size="100%">978-3-030-54994-7</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">As Nietzsche once wrote “Without music, life would be a mistake” (Twilight of the Idols, 1889.). The music we listen to reflects our personality, our way to approach life. In order to enforce self-awareness, we devised a Personal Listening Data Model that allows for capturing individual music preferences and patterns of music consumption. We applied our model to 30k users of Last.Fm for which we collected both friendship ties and multiple listening. Starting from such rich data we performed an analysis whose final aim was twofold: (i) capture, and characterize, the individual dimension of music consumption in order to identify clusters of like-minded Last.Fm users; (ii) analyze if, and how, such clusters relate to the social structure expressed by the users in the service. Do there exist individuals having similar Personal Listening Data Models? If so, are they directly connected in the social graph or belong to the same community?.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Pietro Bonato</style></author><author><style face="normal" font="default" size="100%">Paolo Cintia</style></author><author><style face="normal" font="default" size="100%">Francesco Fabbri</style></author><author><style face="normal" font="default" size="100%">Daniele Fadda</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Pier Luigi Lopalco</style></author><author><style face="normal" font="default" size="100%">Sara Mazzilli</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Francesco Penone</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Marcello Savarese</style></author><author><style face="normal" font="default" size="100%">Lara Tavoschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Mobile phone data analytics against the COVID-19 epidemics in Italy: flow diversity and local job markets during the national lockdown</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://arxiv.org/abs/2004.11278</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Understanding collective mobility patterns is crucial to plan the restart of production and economic activities, which are currently put in stand-by to fight the diffusion of the epidemics. In this report, we use mobile phone data to infer the movements of people between Italian provinces and municipalities, and we analyze the incoming, outcoming and internal mobility flows before and during the national lockdown (March 9th, 2020) and after the closure of non-necessary productive and economic activities (March 23th, 2020). The population flow across provinces and municipalities enable for the modelling of a risk index tailored for the mobility of each municipality or province. Such an index would be a useful indicator to drive counter-measures in reaction to a sudden reactivation of the epidemics. Mobile phone data, even when aggregated to preserve the privacy of individuals, are a useful data source to track the evolution in time of human mobility, hence allowing for monitoring the effectiveness of control measures such as physical distancing. We address the following analytical questions: How does the mobility structure of a territory change? Do incoming and outcoming flows become more predictable during the lockdown, and what are the differences between weekdays and weekends? Can we detect proper local job markets based on human mobility flows, to eventually shape the borders of a local outbreak?</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Roberto Pellungrini</style></author><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author><author><style face="normal" font="default" size="100%">F. Simini</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Modeling Adversarial Behavior Against Mobility Data Privacy</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Transactions on Intelligent Transportation SystemsIEEE Transactions on Intelligent Transportation Systems</style></secondary-title><short-title><style face="normal" font="default" size="100%">IEEE Transactions on Intelligent Transportation Systems</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2020</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/abstract/document/9199893</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">1 - 14</style></pages><isbn><style face="normal" font="default" size="100%">1558-0016</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Privacy risk assessment is a crucial issue in any privacy-aware analysis process. Traditional frameworks for privacy risk assessment systematically generate the assumed knowledge for a potential adversary, evaluating the risk without realistically modelling the collection of the background knowledge used by the adversary when performing the attack. In this work, we propose Simulated Privacy Annealing (SPA), a new adversarial behavior model for privacy risk assessment in mobility data. We model the behavior of an adversary as a mobility trajectory and introduce an optimization approach to find the most effective adversary trajectory in terms of privacy risk produced for the individuals represented in a mobility data set. We use simulated annealing to optimize the movement of the adversary and simulate a possible attack on mobility data. We finally test the effectiveness of our approach on real human mobility data, showing that it can simulate the knowledge gathering process for an adversary in a more realistic way.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Toccaceli, Cecilia</style></author><author><style face="normal" font="default" size="100%">Letizia Milli</style></author><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Opinion Dynamic Modeling of Fake News Perception</style></title><secondary-title><style face="normal" font="default" size="100%">International Conference on Complex Networks and Their Applications</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-030-65347-7_31</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Fake news diffusion represents one of the most pressing issues of our online society. In recent years, fake news has been analyzed from several points of view, primarily to improve our ability to separate them from the legit ones as well as identify their sources. Among such vast literature, a rarely discussed theme is likely to play uttermost importance in our understanding of such a controversial phenomenon: the analysis of fake news’ perception. In this work, we approach such a problem by proposing a family of opinion dynamic models tailored to study how specific social interaction patterns concur to the acceptance, or refusal, of fake news by a population of interacting individuals. To discuss the peculiarities of the proposed models, we tested them on several synthetic network topologies, thus underlying when/how they affect the stable states reached by the performed simulations.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesca Naretto</style></author><author><style face="normal" font="default" size="100%">Roberto Pellungrini</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Nardini, Franco Maria</style></author><author><style face="normal" font="default" size="100%">Musolesi, Mirco</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Appice, Annalisa</style></author><author><style face="normal" font="default" size="100%">Tsoumakas, Grigorios</style></author><author><style face="normal" font="default" size="100%">Manolopoulos, Yannis</style></author><author><style face="normal" font="default" size="100%">Matwin, Stan</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Predicting and Explaining Privacy Risk Exposure in Mobility Data</style></title><secondary-title><style face="normal" font="default" size="100%">Discovery Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2020//</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-030-61527-7_27</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pub-location><style face="normal" font="default" size="100%">Cham</style></pub-location><isbn><style face="normal" font="default" size="100%">978-3-030-61527-7</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Mobility data is a proxy of different social dynamics and its analysis enables a wide range of user services. Unfortunately, mobility data are very sensitive because the sharing of people’s whereabouts may arise serious privacy concerns. Existing frameworks for privacy risk assessment provide tools to identify and measure privacy risks, but they often (i) have high computational complexity; and (ii) are not able to provide users with a justification of the reported risks. In this paper, we propose expert, a new framework for the prediction and explanation of privacy risk on mobility data. We empirically evaluate privacy risk on real data, simulating a privacy attack with a state-of-the-art privacy risk assessment framework. We then extract individual mobility profiles from the data for predicting their risk. We compare the performance of several machine learning algorithms in order to identify the best approach for our task. Finally, we show how it is possible to explain privacy risk prediction on real data, using two algorithms: Shap, a feature importance-based method and Lore, a rule-based method. Overall, expert is able to provide a user with the privacy risk and an explanation of the risk itself. The experiments show excellent performance for the prediction task.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesca Naretto</style></author><author><style face="normal" font="default" size="100%">Roberto Pellungrini</style></author><author><style face="normal" font="default" size="100%">Nardini, Franco Maria</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Koprinska, Irena</style></author><author><style face="normal" font="default" size="100%">Kamp, Michael</style></author><author><style face="normal" font="default" size="100%">Appice, Annalisa</style></author><author><style face="normal" font="default" size="100%">Loglisci, Corrado</style></author><author><style face="normal" font="default" size="100%">Antonie, Luiza</style></author><author><style face="normal" font="default" size="100%">Zimmermann, Albrecht</style></author><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Özgöbek, Özlem</style></author><author><style face="normal" font="default" size="100%">Ribeiro, Rita P.</style></author><author><style face="normal" font="default" size="100%">Gavaldà, Ricard</style></author><author><style face="normal" font="default" size="100%">Gama, João</style></author><author><style face="normal" font="default" size="100%">Adilova, Linara</style></author><author><style face="normal" font="default" size="100%">Krishnamurthy, Yamuna</style></author><author><style face="normal" font="default" size="100%">Ferreira, Pedro M.</style></author><author><style face="normal" font="default" size="100%">Malerba, Donato</style></author><author><style face="normal" font="default" size="100%">Medeiros, Ibéria</style></author><author><style face="normal" font="default" size="100%">Ceci, Michelangelo</style></author><author><style face="normal" font="default" size="100%">Manco, Giuseppe</style></author><author><style face="normal" font="default" size="100%">Masciari, Elio</style></author><author><style face="normal" font="default" size="100%">Ras, Zbigniew W.</style></author><author><style face="normal" font="default" size="100%">Christen, Peter</style></author><author><style face="normal" font="default" size="100%">Ntoutsi, Eirini</style></author><author><style face="normal" font="default" size="100%">Schubert, Erich</style></author><author><style face="normal" font="default" size="100%">Zimek, Arthur</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Biecek, Przemyslaw</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author><author><style face="normal" font="default" size="100%">Kille, Benjamin</style></author><author><style face="normal" font="default" size="100%">Lommatzsch, Andreas</style></author><author><style face="normal" font="default" size="100%">Gulla, Jon Atle</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Prediction and Explanation of Privacy Risk on Mobility Data with Neural Networks</style></title><secondary-title><style face="normal" font="default" size="100%">ECML PKDD 2020 Workshops</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2020//</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-030-65965-3_34</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pub-location><style face="normal" font="default" size="100%">Cham</style></pub-location><isbn><style face="normal" font="default" size="100%">978-3-030-65965-3</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The analysis of privacy risk for mobility data is a fundamental part of any privacy-aware process based on such data. Mobility data are highly sensitive. Therefore, the correct identification of the privacy risk before releasing the data to the public is of utmost importance. However, existing privacy risk assessment frameworks have high computational complexity. To tackle these issues, some recent work proposed a solution based on classification approaches to predict privacy risk using mobility features extracted from the data. In this paper, we propose an improvement of this approach by applying long short-term memory (LSTM) neural networks to predict the privacy risk directly from original mobility data. We empirically evaluate privacy risk on real data by applying our LSTM-based approach. Results show that our proposed method based on a LSTM network is effective in predicting the privacy risk with results in terms of F1 of up to 0.91. Moreover, to explain the predictions of our model, we employ a state-of-the-art explanation algorithm, Shap. We explore the resulting explanation, showing how it is possible to provide effective predictions while explaining them to the end-user.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesca Pratesi</style></author><author><style face="normal" font="default" size="100%">Lorenzo Gabrielli</style></author><author><style face="normal" font="default" size="100%">Paolo Cintia</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">PRIMULE: Privacy risk mitigation for user profiles</style></title><short-title><style face="normal" font="default" size="100%">Data &amp; Knowledge Engineering</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2020/01/01/</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/pii/S0169023X18305342</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">125</style></volume><pages><style face="normal" font="default" size="100%">101786</style></pages><isbn><style face="normal" font="default" size="100%">0169-023X</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The availability of mobile phone data has encouraged the development of different data-driven tools, supporting social science studies and providing new data sources to the standard official statistics. However, this particular kind of data are subject to privacy concerns because they can enable the inference of personal and private information. In this paper, we address the privacy issues related to the sharing of user profiles, derived from mobile phone data, by proposing PRIMULE, a privacy risk mitigation strategy. Such a method relies on PRUDEnce (Pratesi et al., 2018), a privacy risk assessment framework that provides a methodology for systematically identifying risky-users in a set of data. An extensive experimentation on real-world data shows the effectiveness of PRIMULE strategy in terms of both quality of mobile user profiles and utility of these profiles for analytical services such as the Sociometer (Furletti et al., 2013), a data mining tool for city users classification.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paolo Cintia</style></author><author><style face="normal" font="default" size="100%">Daniele Fadda</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author><author><style face="normal" font="default" size="100%">Bonato, Pietro</style></author><author><style face="normal" font="default" size="100%">Fabbri, Francesco</style></author><author><style face="normal" font="default" size="100%">Penone, Francesco</style></author><author><style face="normal" font="default" size="100%">Savarese, Marcello</style></author><author><style face="normal" font="default" size="100%">Checchi, Daniele</style></author><author><style face="normal" font="default" size="100%">Chiaromonte, Francesca</style></author><author><style face="normal" font="default" size="100%">Vineis , Paolo</style></author><author><style face="normal" font="default" size="100%">Guzzetta, Giorgio</style></author><author><style face="normal" font="default" size="100%">Riccardo, Flavia</style></author><author><style face="normal" font="default" size="100%">Marziano, Valentina</style></author><author><style face="normal" font="default" size="100%">Poletti, Piero</style></author><author><style face="normal" font="default" size="100%">Trentini, Filippo</style></author><author><style face="normal" font="default" size="100%">Bella, Antonio</style></author><author><style face="normal" font="default" size="100%">Andrianou, Xanthi</style></author><author><style face="normal" font="default" size="100%">Del Manso, Martina</style></author><author><style face="normal" font="default" size="100%">Fabiani, Massimo</style></author><author><style face="normal" font="default" size="100%">Bellino, Stefania</style></author><author><style face="normal" font="default" size="100%">Boros, Stefano</style></author><author><style face="normal" font="default" size="100%">Mateo Urdiales, Alberto</style></author><author><style face="normal" font="default" size="100%">Vescio, Maria Fenicia</style></author><author><style face="normal" font="default" size="100%">Brusaferro, Silvio</style></author><author><style face="normal" font="default" size="100%">Rezza, Giovanni</style></author><author><style face="normal" font="default" size="100%">Pezzotti, Patrizio</style></author><author><style face="normal" font="default" size="100%">Ajelli, Marco</style></author><author><style face="normal" font="default" size="100%">Merler, Stefano</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The relationship between human mobility and viral transmissibility during the COVID-19 epidemics in Italy</style></title><secondary-title><style face="normal" font="default" size="100%">arXiv preprint arXiv:2006.03141</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://arxiv.org/abs/2006.03141</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We describe in this report our studies to understand the relationship between human mobility and the spreading of COVID-19, as an aid to manage the restart of the social and economic activities after the lockdown and monitor the epidemics in the coming weeks and months. We compare the evolution (from January to May 2020) of the daily mobility flows in Italy, measured by means of nation-wide mobile phone data, and the evolution of transmissibility, measured by the net reproduction number, i.e., the mean number of secondary infections generated by one primary infector in the presence of control interventions and human behavioural adaptations. We find a striking relationship between the negative variation of mobility flows and the net reproduction number, in all Italian regions, between March 11th and March 18th, when the country entered the lockdown. This observation allows us to quantify the time needed to &quot;switch off&quot; the country mobility (one week) and the time required to bring the net reproduction number below 1 (one week). A reasonably simple regression model provides evidence that the net reproduction number is correlated with a region's incoming, outgoing and internal mobility. We also find a strong relationship between the number of days above the epidemic threshold before the mobility flows reduce significantly as an effect of lockdowns, and the total number of confirmed SARS-CoV-2 infections per 100k inhabitants, thus indirectly showing the effectiveness of the lockdown and the other non-pharmaceutical interventions in the containment of the contagion. Our study demonstrates the value of &quot;big&quot; mobility data to the monitoring of key epidemic indicators to inform choices as the epidemics unfolds in the coming months.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Letizia Milli</style></author><author><style face="normal" font="default" size="100%">Salvatore Citraro</style></author><author><style face="normal" font="default" size="100%">Morini, Virginia</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">UTLDR: an agent-based framework for modeling infectious diseases and public interventions</style></title><secondary-title><style face="normal" font="default" size="100%">arXiv preprint arXiv:2011.05606</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The AI black box Explanation Problem</style></title><secondary-title><style face="normal" font="default" size="100%">ERCIM NEWS</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><number><style face="normal" font="default" size="100%">116</style></number><pages><style face="normal" font="default" size="100%">12–13</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Morelli, Davide</style></author><author><style face="normal" font="default" size="100%">Alessio Rossi</style></author><author><style face="normal" font="default" size="100%">Cairo, Massimo</style></author><author><style face="normal" font="default" size="100%">Clifton, David A</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Analysis of the Impact of Interpolation Methods of Missing RR-intervals Caused by Motion Artifacts on HRV Features Estimations</style></title><secondary-title><style face="normal" font="default" size="100%">Sensors</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.mdpi.com/1424-8220/19/14/3163</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">14</style></number><volume><style face="normal" font="default" size="100%">19</style></volume><pages><style face="normal" font="default" size="100%">3163</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Wearable physiological monitors have become increasingly popular, often worn during people’s daily life, collecting data 24 hours a day, 7 days a week. In the last decade, these devices have attracted the attention of the scientific community as they allow us to automatically extract information about user physiology (e.g., heart rate, sleep quality and physical activity) enabling inference on their health. However, the biggest issue about the data recorded by wearable devices is the missing values due to motion and mechanical artifacts induced by external stimuli during data acquisition. This missing data could negatively affect the assessment of heart rate (HR) response and estimation of heart rate variability (HRV), that could in turn provide misleading insights concerning the health status of the individual. In this study, we focus on healthy subjects with normal heart activity and investigate the effects of missing variation of the timing between beats (RR-intervals) caused by motion artifacts on HRV features estimation by randomly introducing missing values within a five min time windows of RR-intervals obtained from the nsr2db PhysioNet dataset by using Gilbert burst method. We then evaluate several strategies for estimating HRV in the presence of missing values by interpolating periods of missing values, covering the range of techniques often deployed in the literature, via linear, quadratic, cubic, and cubic spline functions. We thereby compare the HRV features obtained by handling missing data in RR-interval time series against HRV features obtained from the same data without missing values. Finally, we assess the difference between the use of interpolation methods on time (i.e., the timestamp when the heartbeats happen) and on duration (i.e., the duration of the heartbeats), in order to identify the best methodology to handle the missing RR-intervals. The main novel finding of this study is that the interpolation of missing data on time produces more reliable HRV estimations when compared to interpolation on duration. Hence, we can conclude that interpolation on duration modifies the power spectrum of the RR signal, negatively affecting the estimation of the HRV features as the amount of missing values increases. We can conclude that interpolation in time is the optimal method among those considered for handling data with large amounts of missing values, such as data from wearable sensors.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Letizia Milli</style></author><author><style face="normal" font="default" size="100%">Cazabet, Rémy</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">CDLIB: a python library to extract, compare and evaluate communities from complex networks</style></title><secondary-title><style face="normal" font="default" size="100%">Applied Network Science</style></secondary-title><short-title><style face="normal" font="default" size="100%">Applied Network Science</style></short-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2019/07/29</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/article/10.1007/s41109-019-0165-9</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">4</style></volume><pages><style face="normal" font="default" size="100%">52</style></pages><isbn><style face="normal" font="default" size="100%">2364-8228</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Community Discovery is among the most studied problems in complex network analysis. During the last decade, many algorithms have been proposed to address such task; however, only a few of them have been integrated into a common framework, making it hard to use and compare different solutions. To support developers, researchers and practitioners, in this paper we introduce a python library - namely CDlib - designed to serve this need. The aim of CDlib is to allow easy and standardized access to a wide variety of network clustering algorithms, to evaluate and compare the results they provide, and to visualize them. It notably provides the largest available collection of community detection implementations, with a total of 39 algorithms.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Letizia Milli</style></author><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Community-Aware Content Diffusion: Embeddednes and Permeability</style></title><secondary-title><style face="normal" font="default" size="100%">International Conference on Complex Networks and Their Applications</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Cecilia Panigutti</style></author><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Explaining multi-label black-box classifiers for health applications</style></title><secondary-title><style face="normal" font="default" size="100%">International Workshop on Health Intelligence</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-030-24409-5_9</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Today the state-of-the-art performance in classification is achieved by the so-called “black boxes”, i.e. decision-making systems whose internal logic is obscure. Such models could revolutionize the health-care system, however their deployment in real-world diagnosis decision support systems is subject to several risks and limitations due to the lack of transparency. The typical classification problem in health-care requires a multi-label approach since the possible labels are not mutually exclusive, e.g. diagnoses. We propose MARLENA, a model-agnostic method which explains multi-label black box decisions. MARLENA explains an individual decision in three steps. First, it generates a synthetic neighborhood around the instance to be explained using a strategy suitable for multi-label decisions. It then learns a decision tree on such neighborhood and finally derives from it a decision rule that explains the black box decision. Our experiments show that MARLENA performs well in terms of mimicking the black box behavior while gaining at the same time a notable amount of interpretability through compact decision rules, i.e. rules with limited length.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Salvatore Ruggieri</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Factual and Counterfactual Explanations for Black Box Decision Making</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Intelligent Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/abstract/document/8920138</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The rise of sophisticated machine learning models has brought accurate but obscure decision systems, which hide their logic, thus undermining transparency, trust, and the adoption of artificial intelligence (AI) in socially sensitive and safety-critical contexts. We introduce a local rule-based explanation method, providing faithful explanations of the decision made by a black box classifier on a specific instance. The proposed method first learns an interpretable, local classifier on a synthetic neighborhood of the instance under investigation, generated by a genetic algorithm. Then, it derives from the interpretable classifier an explanation consisting of a decision rule, explaining the factual reasons of the decision, and a set of counterfactuals, suggesting the changes in the instance features that would lead to a different outcome. Experimental results show that the proposed method outperforms existing approaches in terms of the quality of the explanations and of the accuracy in mimicking the black box.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Cariaggi, Leonardo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Investigating Neighborhood Generation Methods for Explanations of Obscure Image Classifiers</style></title><secondary-title><style face="normal" font="default" size="100%">Pacific-Asia Conference on Knowledge Discovery and Data Mining</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-030-16148-4_5</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Given the wide use of machine learning approaches based on opaque prediction models, understanding the reasons behind decisions of black box decision systems is nowadays a crucial topic. We address the problem of providing meaningful explanations in the widely-applied image classification tasks. In particular, we explore the impact of changing the neighborhood generation function for a local interpretable model-agnostic explanator by proposing four different variants. All the proposed methods are based on a grid-based segmentation of the images, but each of them proposes a different strategy for generating the neighborhood of the image for which an explanation is required. A deep experimentation shows both improvements and weakness of each proposed approach.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Salvatore Ruggieri</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Meaningful explanations of Black Box AI decision systems</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the AAAI Conference on Artificial Intelligence</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://aaai.org/ojs/index.php/AAAI/article/view/5050</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Black box AI systems for automated decision making, often based on machine learning over (big) data, map a user’s features into a class or a score without exposing the reasons why. This is problematic not only for lack of transparency, but also for possible biases inherited by the algorithms from human prejudices and collection artifacts hidden in the training data, which may lead to unfair or wrong decisions. We focus on the urgent open challenge of how to construct meaningful explanations of opaque AI/ML systems, introducing the local-toglobal framework for black box explanation, articulated along three lines: (i) the language for expressing explanations in terms of logic rules, with statistical and causal interpretation; (ii) the inference of local explanations for revealing the decision rationale for a specific case, by auditing the black box in the vicinity of the target instance; (iii), the bottom-up generalization of many local explanations into simple global ones, with algorithms that optimize for quality and comprehensibility. We argue that the local-first approach opens the door to a wide variety of alternative solutions along different dimensions: a variety of data sources (relational, text, images, etc.), a variety of learning problems (multi-label classification, regression, scoring, ranking), a variety of languages for expressing meaningful explanations, a variety of means to audit a black box.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author><author><style face="normal" font="default" size="100%">Paolo Cintia</style></author><author><style face="normal" font="default" size="100%">Ferragina, Paolo</style></author><author><style face="normal" font="default" size="100%">Massucco, Emanuele</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">PlayeRank: data-driven performance evaluation and player ranking in soccer via a machine learning approach</style></title><secondary-title><style face="normal" font="default" size="100%">ACM Transactions on Intelligent Systems and Technology (TIST)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://dl.acm.org/doi/abs/10.1145/3343172</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">5</style></number><volume><style face="normal" font="default" size="100%">10</style></volume><pages><style face="normal" font="default" size="100%">1–27</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The problem of evaluating the performance of soccer players is attracting the interest of many companies and the scientific community, thanks to the availability of massive data capturing all the events generated during a match (e.g., tackles, passes, shots, etc.). Unfortunately, there is no consolidated and widely accepted metric for measuring performance quality in all of its facets. In this article, we design and implement PlayeRank, a data-driven framework that offers a principled multi-dimensional and role-aware evaluation of the performance of soccer players. We build our framework by deploying a massive dataset of soccer-logs and consisting of millions of match events pertaining to four seasons of 18 prominent soccer competitions. By comparing PlayeRank to known algorithms for performance evaluation in soccer, and by exploiting a dataset of players’ evaluations made by professional soccer scouts, we show that PlayeRank significantly outperforms the competitors. We also explore the ratings produced by PlayeRank and discover interesting patterns about the nature of excellent performances and what distinguishes the top players from the others. At the end, we explore some applications of PlayeRank—i.e. searching players and player versatility—showing its flexibility and efficiency, which makes it worth to be used in the design of a scalable platform for soccer analytics.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Roberto Pellungrini</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Alzate, Carlos</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Bioglio, Livio</style></author><author><style face="normal" font="default" size="100%">Bitetta, Valerio</style></author><author><style face="normal" font="default" size="100%">Bordino, Ilaria</style></author><author><style face="normal" font="default" size="100%">Caldarelli, Guido</style></author><author><style face="normal" font="default" size="100%">Ferretti, Andrea</style></author><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Gullo, Francesco</style></author><author><style face="normal" font="default" size="100%">Pascolutti, Stefano</style></author><author><style face="normal" font="default" size="100%">Pensa, Ruggero G.</style></author><author><style face="normal" font="default" size="100%">Robardet, Céline</style></author><author><style face="normal" font="default" size="100%">Squartini, Tiziano</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Privacy Risk for Individual Basket Patterns</style></title><secondary-title><style face="normal" font="default" size="100%">ECML PKDD 2018 Workshops</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2019//</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-030-13463-1_11</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pub-location><style face="normal" font="default" size="100%">Cham</style></pub-location><isbn><style face="normal" font="default" size="100%">978-3-030-13463-1</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Retail data are of fundamental importance for businesses and enterprises that want to understand the purchasing behaviour of their customers. Such data is also useful to develop analytical services and for marketing purposes, often based on individual purchasing patterns. However, retail data and extracted models may also provide very sensitive information to possible malicious third parties. Therefore, in this paper we propose a methodology for empirically assessing privacy risk in the releasing of individual purchasing data. The experiments on real-world retail data show that although individual patterns describe a summary of the customer activity, they may be successful used for the customer re-identifiation.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author><author><style face="normal" font="default" size="100%">Paolo Cintia</style></author><author><style face="normal" font="default" size="100%">Alessio Rossi</style></author><author><style face="normal" font="default" size="100%">Massucco, Emanuele</style></author><author><style face="normal" font="default" size="100%">Ferragina, Paolo</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A public data set of spatio-temporal match events in soccer competitions</style></title><secondary-title><style face="normal" font="default" size="100%">Scientific data</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.nature.com/articles/s41597-019-0247-7</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">6</style></volume><pages><style face="normal" font="default" size="100%">1–15</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Soccer analytics is attracting increasing interest in academia and industry, thanks to the availability of sensing technologies that provide high-fidelity data streams for every match. Unfortunately, these detailed data are owned by specialized companies and hence are rarely publicly available for scientific research. To fill this gap, this paper describes the largest open collection of soccer-logs ever released, containing all the spatio-temporal events (passes, shots, fouls, etc.) that occured during each match for an entire season of seven prominent soccer competitions. Each match event contains information about its position, time, outcome, player and characteristics. The nature of team sports like soccer, halfway between the abstraction of a game and the reality of complex social systems, combined with the unique size and composition of this dataset, provide an ideal ground for tackling a wide range of data science problems, including the measurement and evaluation of performance, both at individual and at collective level, and the determinants of success and failure.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">F Morandin</style></author><author><style face="normal" font="default" size="100%">G Amato</style></author><author><style face="normal" font="default" size="100%">R Gini</style></author><author><style face="normal" font="default" size="100%">C Metta</style></author><author><style face="normal" font="default" size="100%">M Parton</style></author><author><style face="normal" font="default" size="100%">G.C. Pascutto</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">SAI a Sensible Artificial Intelligence that plays Go</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>6</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Marco Malvaldi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Sarò Franco - Vita di Franco Turini, executive chef dell’Università di Pisa</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://store.streetlib.com/it/marco-malvaldi/saro-franco-9788833392523/</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Pisa University Press</style></publisher><pub-location><style face="normal" font="default" size="100%">Pisa, Italy</style></pub-location><pages><style face="normal" font="default" size="100%">20</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Chi è Franco Turini? Come molti sanno, uno dei pionieri dell’informatica italiana. Ma non è questa la domanda che ci interessa. Quella a cui questo breve saggio si propone di rispondere è una questione molto più importante: chi avrebbe voluto essere Franco Turini?
In questo scritto, la vita e la carriera di Turini vengono ripercorse alla luce della sua vera, unica e irredimibile passione: la cucina. In un intreccio romanzesco, denso di colpi di scena e assolutamente falso e tendenzioso, il contributo di Franco Turini all’informatica e all’intelligenza artiﬁciale si dipana, indissolubilmente intrecciato alla sua passione per i fornelli, attraverso le molte intuizioni geniali che lo hanno colpito mentre cucinava.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Guidi, Barbara</style></author><author><style face="normal" font="default" size="100%">Michienzi, Andrea</style></author><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Towards the dynamic community discovery in decentralized online social networks</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Grid Computing</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">17</style></volume><pages><style face="normal" font="default" size="100%">23–44</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Letizia Milli</style></author><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Active and passive diffusion processes in complex networks</style></title><secondary-title><style face="normal" font="default" size="100%">Applied network science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/article/10.1007/s41109-018-0100-5</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">3</style></volume><pages><style face="normal" font="default" size="100%">42</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Ideas, information, viruses: all of them, with their mechanisms, spread over the complex social information, viruses: all tissues described by our interpersonal relations. Usually, to simulate and understand the unfolding of such complex phenomena are used general mathematical models; these models act agnostically from the object of which they simulate the diffusion, thus considering spreading of virus, ideas and innovations alike. Indeed, such degree of abstraction makes it easier to define a standard set of tools that can be applied to heterogeneous contexts; however, it can also lead to biased, incorrect, simulation outcomes. In this work we introduce the concepts of active and passive diffusion to discriminate the degree in which individuals choice affect the overall spreading of content over a social graph. Moving from the analysis of a well-known passive diffusion schema, the Threshold model (that can be used to model peer-pressure related processes), we introduce two novel approaches whose aim is to provide active and mixed schemas applicable in the context of innovations/ideas diffusion simulation.

Our analysis, performed both in synthetic and real-world data, underline that the adoption of exclusively passive/active models leads to conflicting results, thus highlighting the need of mixed approaches to capture the real complexity of the simulated system better.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Roberto Pellungrini</style></author><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author><author><style face="normal" font="default" size="100%">Francesca Pratesi</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Analyzing Privacy Risk in Human Mobility Data</style></title><secondary-title><style face="normal" font="default" size="100%">Software Technologies: Applications and Foundations - STAF 2018 Collocated Workshops, Toulouse, France, June 25-29, 2018, Revised Selected Papers</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-030-04771-9_10</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Mobility data are of fundamental importance for understanding the patterns of human movements, developing analytical services and modeling human dynamics. Unfortunately, mobility data also contain individual sensitive information, making it necessary an accurate privacy risk assessment for the individuals involved. In this paper, we propose a methodology for assessing privacy risk in human mobility data. Given a set of individual and collective mobility features, we define the minimum data format necessary for the computation of each feature and we define a set of possible attacks on these data formats. We perform experiments computing the empirical risk in a real-world mobility dataset, and show how the distributions of the considered mobility features are affected by the removal of individuals with different levels of privacy risk.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Letizia Milli</style></author><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Diffusive Phenomena in Dynamic Networks: a data-driven study</style></title><secondary-title><style face="normal" font="default" size="100%">International Conference on Complex Networks CompleNet</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-319-73198-8_13</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Boston March 5-8 2018</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Everyday, ideas, information as well as viruses spread over complex social tissues described by our interpersonal relations. So far, the network contexts upon which diffusive phenomena unfold have usually considered static, composed by a fixed set of nodes and edges. Recent studies describe social networks as rapidly changing topologies. In this work – following a data-driven approach – we compare the behaviors of classical spreading models when used to analyze a given social network whose topological dynamics are observed at different temporal-granularities. Our goal is to shed some light on the impacts that the adoption of a static topology has on spreading simulations as well as to provide an alternative formulation of two classical diffusion models.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Lorenzo Gabrielli</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Discovering temporal regularities in retail customers’ shopping behavior</style></title><secondary-title><style face="normal" font="default" size="100%">EPJ Data Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year><pub-dates><date><style  face="normal" font="default" size="100%">01/2018</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://epjdatascience.springeropen.com/articles/10.1140/epjds/s13688-018-0133-0</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">7</style></volume><pages><style face="normal" font="default" size="100%">6</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this paper we investigate the regularities characterizing the temporal purchasing behavior of the customers of a retail market chain. Most of the literature studying purchasing behavior focuses on what customers buy while giving few importance to the temporal dimension. As a consequence, the state of the art does not allow capturing which are the temporal purchasing patterns of each customers. These patterns should describe the customer’s temporal habits highlighting when she typically makes a purchase in correlation with information about the amount of expenditure, number of purchased items and other similar aggregates. This knowledge could be exploited for different scopes: set temporal discounts for making the purchases of customers more regular with respect the time, set personalized discounts in the day and time window preferred by the customer, provide recommendations for shopping time schedule, etc. To this aim, we introduce a framework for extracting from personal retail data a temporal purchasing profile able to summarize whether and when a customer makes her distinctive purchases. The individual profile describes a set of regular and characterizing shopping behavioral patterns, and the sequences in which these patterns take place. We show how to compare different customers by providing a collective perspective to their individual profiles, and how to group the customers with respect to these comparable profiles. By analyzing real datasets containing millions of shopping sessions we found that there is a limited number of patterns summarizing the temporal purchasing behavior of all the customers, and that they are sequentially followed in a finite number of ways. Moreover, we recognized regular customers characterized by a small number of temporal purchasing behaviors, and changing customers characterized by various types of temporal purchasing behaviors. Finally, we discuss on how the profiles can be exploited both by customers to enable personalized services, and by the retail market chain for providing tailored discounts based on temporal purchasing regularity.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alessio Rossi</style></author><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author><author><style face="normal" font="default" size="100%">Paolo Cintia</style></author><author><style face="normal" font="default" size="100%">Iaia, F Marcello</style></author><author><style face="normal" font="default" size="100%">Fernàndez, Javier</style></author><author><style face="normal" font="default" size="100%">Medina, Daniel</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Effective injury forecasting in soccer with GPS training data and machine learning</style></title><secondary-title><style face="normal" font="default" size="100%">PloS one</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0201264</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">7</style></number><volume><style face="normal" font="default" size="100%">13</style></volume><pages><style face="normal" font="default" size="100%">e0201264</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Injuries have a great impact on professional soccer, due to their large influence on team performance and the considerable costs of rehabilitation for players. Existing studies in the literature provide just a preliminary understanding of which factors mostly affect injury risk, while an evaluation of the potential of statistical models in forecasting injuries is still missing. In this paper, we propose a multi-dimensional approach to injury forecasting in professional soccer that is based on GPS measurements and machine learning. By using GPS tracking technology, we collect data describing the training workload of players in a professional soccer club during a season. We then construct an injury forecaster and show that it is both accurate and interpretable by providing a set of case studies of interest to soccer practitioners. Our approach opens a novel perspective on injury prevention, providing a set of simple and practical rules for evaluating and interpreting the complex relations between injury risk and training performance in professional soccer.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michela Natilli</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Exploring Students Eating Habits Through Individual Profiling and Clustering Analysis</style></title><secondary-title><style face="normal" font="default" size="100%">ECML PKDD 2018 Workshops</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Martinucci, Irene</style></author><author><style face="normal" font="default" size="100%">Michela Natilli</style></author><author><style face="normal" font="default" size="100%">Lorenzoni, Valentina</style></author><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Turchetti, Giuseppe</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Marchi, Santino</style></author><author><style face="normal" font="default" size="100%">Barale, Roberto</style></author><author><style face="normal" font="default" size="100%">de Bortoli, Nicola</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Gastroesophageal reflux symptoms among Italian university students: epidemiology and dietary correlates using automatically recorded transactions</style></title><secondary-title><style face="normal" font="default" size="100%">BMC gastroenterology</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://bmcgastroenterol.biomedcentral.com/articles/10.1186/s12876-018-0832-9</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">18</style></volume><pages><style face="normal" font="default" size="100%">116</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Background: Gastroesophageal reflux disease (GERD) is one of the most common gastrointestinal disorders
worldwide, with relevant impact on the quality of life and health care costs.The aim of our study is to assess the
prevalence of GERD based on self-reported symptoms among university students in central Italy. The secondary aim is
to evaluate lifestyle correlates, particularly eating habits, in GERD students using automatically recorded transactions
through cashiers at university canteen.
Methods: A web-survey was created and launched through an app, ad-hoc developed for an interactive exchange of
information with students, including anthropometric data and lifestyle habits. Moreover, the web-survey allowed
users a self-diagnosis of GERD through a simple questionnaire. As regard eating habits, detailed collection of meals
consumed, including number and type of dishes, were automatically recorded through cashiers at the university
canteen equipped with an automatic registration system.
Results: We collected 3012 questionnaires. A total of 792 students (26.2% of the respondents) reported typical GERD
symptoms occurring at least weekly. Female sex was more prevalent than male sex. In the set of students with GERD,
the percentage of smokers was higher, and our results showed that when BMI tends to higher values the percentage
of students with GERD tends to increase. When evaluating correlates with diet, we found, among all users, a lower
frequency of legumes choice in GERD students and, among frequent users, a lower frequency of choice of pasta and
rice in GERD students.
Discussion: The results of our study are in line with the values reported in the literature. Nowadays, GERD is a common
problem in our communities, and can potentially lead to serious medical complications; the economic burden
involved in the diagnostic and therapeutic management of the disease has a relevant impact on healthcare costs.
Conclusions: To our knowledge, this is the first study evaluating the prevalence of typical GERD–related symptoms
in a young population of University students in Italy. Considering the young age of enrolled subjects, our prevalence
rate, relatively high compared to the usual estimates, could represent a further negative factor for the future
economic sustainability of the healthcare system.
Keywords: Gastroesophageal reflux disease, GERD, Heartburn, Regurgitation, Diet, Prevalence, University students</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Amato, G.</style></author><author><style face="normal" font="default" size="100%">Candela, L.</style></author><author><style face="normal" font="default" size="100%">Castelli, D.</style></author><author><style face="normal" font="default" size="100%">Esuli, A.</style></author><author><style face="normal" font="default" size="100%">Falchi, F.</style></author><author><style face="normal" font="default" size="100%">Gennaro, C.</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Pagano, P.</style></author><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Francesca Pratesi</style></author><author><style face="normal" font="default" size="100%">Rabitti, F.</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Salvatore Ruggieri</style></author><author><style face="normal" font="default" size="100%">Sebastiani, F.</style></author><author><style face="normal" font="default" size="100%">Tesconi, M.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Flesca, Sergio</style></author><author><style face="normal" font="default" size="100%">Greco, Sergio</style></author><author><style face="normal" font="default" size="100%">Masciari, Elio</style></author><author><style face="normal" font="default" size="100%">Saccà, Domenico</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">How Data Mining and Machine Learning Evolved from Relational Data Base to Data Science</style></title><secondary-title><style face="normal" font="default" size="100%">A Comprehensive Guide Through the Italian Database Research Over the Last 25 Years</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007%2F978-3-319-61893-7_17</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pub-location><style face="normal" font="default" size="100%">Cham</style></pub-location><pages><style face="normal" font="default" size="100%">287 - 306</style></pages><isbn><style face="normal" font="default" size="100%">978-3-319-61893-7</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">During the last 35 years, data management principles such as physical and logical independence, declarative querying and cost-based optimization have led to profound pervasiveness of relational databases in any kind of organization. More importantly, these technical advances have enabled the first round of business intelligence applications and laid the foundation for managing and analyzing Big Data today.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Learning Data Mining</style></title><secondary-title><style face="normal" font="default" size="100%">2018 IEEE 5th International Conference on Data Science and Advanced Analytics (DSAA)2018 IEEE 5th International Conference on Data Science and Advanced Analytics (DSAA)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2018</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/8631453</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In the last decade the usage and study of data mining and machine learning algorithms have received an increasing attention from several and heterogeneous fields of research. Learning how and why a certain algorithm returns a particular result, and understanding which are the main problems connected to its execution is a hot topic in the education of data mining methods. In order to support data mining beginners, students, teachers, and researchers we introduce a novel didactic environment. The Didactic Data Mining Environment (DDME) allows to execute a data mining algorithm on a dataset and to observe the algorithm behavior step by step to learn how and why a certain result is returned. DDME can be practically exploited by teachers and students for having a more interactive learning of data mining. Indeed, on top of the core didactic library, we designed a visual platform that allows online execution of experiments and the visualization of the algorithm steps. The visual platform abstracts the coding activity and makes available the execution of algorithms to non-technicians.
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Salvatore Ruggieri</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Local Rule-Based Explanations of Black Box Decision Systems</style></title><secondary-title><style face="normal" font="default" size="100%">arXiv preprint arXiv:1805.10820</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Letizia Milli</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author><author><style face="normal" font="default" size="100%">Alina Sirbu</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">NDlib: a python library to model and analyze diffusion processes over complex networks</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Data Science and Analytics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/article/10.1007/s41060-017-0086-6</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">5</style></volume><pages><style face="normal" font="default" size="100%">61–79</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Nowadays the analysis of dynamics of and on networks represents a hot topic in the social network analysis playground. To support students, teachers, developers and researchers, in this work we introduce a novel framework, namely NDlib, an environment designed to describe diffusion simulations. NDlib is designed to be a multi-level ecosystem that can be fruitfully used by different user segments. For this reason, upon NDlib, we designed a simulation server that allows remote execution of experiments as well as an online visualization tool that abstracts its programmatic interface and makes available the simulation platform to non-technicians.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author><author><style face="normal" font="default" size="100%">Salvatore Ruggieri</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Open the Black Box Data-Driven Explanation of Black Box Decision Systems</style></title><secondary-title><style face="normal" font="default" size="100%">arXiv preprint arXiv:1806.09936</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesca Pratesi</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Yanagihara, Tadashi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">PRUDEnce: a system for assessing privacy risk vs utility in data sharing ecosystems</style></title><secondary-title><style face="normal" font="default" size="100%">Transactions on Data Privacy</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year><pub-dates><date><style  face="normal" font="default" size="100%">08/2018</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.tdp.cat/issues16/tdp.a284a17.pdf</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">11</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Data describing human activities are an important source of knowledge useful for understanding individual and collective behavior and for developing a wide range of user services. Unfortunately, this kind of data is sensitive, because people’s whereabouts may allow re-identification of individuals in a de-identified database. Therefore, Data Providers, before sharing those data, must apply any sort of anonymization to lower the privacy risks, but they must be aware and capable of controlling also the data quality, since these two factors are often a trade-off. In this paper we propose PRUDEnce (Privacy Risk versus Utility in Data sharing Ecosystems), a system enabling a privacy-aware ecosystem for sharing personal data. It is based on a methodology for assessing both the empirical (not theoretical) privacy risk associated to users represented in the data, and the data quality guaranteed only with users not at risk. Our proposal is able to support the Data Provider in the exploration of a repertoire of possible data transformations with the aim of selecting one specific transformation that yields an adequate trade-off between data quality and privacy risk. We study the practical effectiveness of our proposal over three data formats underlying many services, defined on real mobility data, i.e., presence data, trajectory data and road segment data.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Salvatore Ruggieri</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A survey of methods for explaining black box models</style></title><secondary-title><style face="normal" font="default" size="100%">ACM computing surveys (CSUR)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://dl.acm.org/doi/abs/10.1145/3236009</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">5</style></number><volume><style face="normal" font="default" size="100%">51</style></volume><pages><style face="normal" font="default" size="100%">93</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In recent years, many accurate decision support systems have been constructed as black boxes, that is as systems that hide their internal logic to the user. This lack of explanation constitutes both a practical and an ethical issue. The literature reports many approaches aimed at overcoming this crucial weakness, sometimes at the cost of sacrificing accuracy for interpretability. The applications in which black box decision systems can be used are various, and each approach is typically developed to provide a solution for a specific problem and, as a consequence, it explicitly or implicitly delineates its own definition of interpretability and explanation. The aim of this article is to provide a classification of the main problems addressed in the literature with respect to the notion of explanation and the type of black box system. Given a problem definition, a black box type, and a desired explanation, this survey should help the researcher to find the proposals more useful for his own work. The proposed classification of approaches to open black box models should also be useful for putting the many research open questions in perspective.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atzmueller, Martin</style></author><author><style face="normal" font="default" size="100%">Becker, Martin</style></author><author><style face="normal" font="default" size="100%">Molino, Andrea</style></author><author><style face="normal" font="default" size="100%">Mueller, Juergen</style></author><author><style face="normal" font="default" size="100%">Peters, Jan</style></author><author><style face="normal" font="default" size="100%">Alina Sirbu</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Applications for Environmental Sensing in EveryAware</style></title><secondary-title><style face="normal" font="default" size="100%">Participatory Sensing, Opinions and Collective Awareness</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://link.springer.com/chapter/10.1007/978-3-319-25658-0_7</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pages><style face="normal" font="default" size="100%">135–155</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This chapter provides a technical description of the EveryAware applications for air quality and noise monitoring. Specifically, we introduce AirProbe, for measuring air quality, and WideNoise Plus for estimating environmental noise. We also include an overview on hardware components and smartphone-based measurement technology, and we present the according web backend, e.g., providing for real-time tracking, data storage, analysis and visualizations.

</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dong, Boxiang</style></author><author><style face="normal" font="default" size="100%">Hui Wendy Wang</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">W Guo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Authenticated Outlier Mining for Outsourced Databases</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Transactions on Dependable and Secure Computing</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/8048342/</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The Data-Mining-as-a-Service (DMaS) paradigm is becoming the focus of research, as it allows the data owner (client) who lacks expertise and/or computational resources to outsource their data and mining needs to a third-party service provider (server). Outsourcing, however, raises some issues about result integrity: how could the client verify the mining results returned by the server are both sound and complete? In this paper, we focus on outlier mining, an important mining task. Previous verification techniques use an authenticated data structure (ADS) for correctness authentication, which may incur much space and communication cost. In this paper, we propose a novel solution that returns a probabilistic result integrity guarantee with much cheaper verification cost. The key idea is to insert a set of artificial records (ARs) into the dataset, from which it constructs a set of artificial outliers (AOs) and artificial non-outliers (ANOs). The AOs and ANOs are used by the client to detect any incomplete and/or incorrect mining results with a probabilistic guarantee. The main challenge that we address is how to construct ARs so that they do not change the (non-)outlierness of original records, while guaranteeing that the client can identify ANOs and AOs without executing mining. Furthermore, we build a strategic game and show that a Nash equilibrium exists only when the server returns correct outliers. Our implementation and experiments demonstrate that our verification solution is efficient and lightweight.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Clustering Individual Transactional Data for Masses of Users</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Mining a large number of datasets recording human activities for making sense of individual data is the key enabler of a new wave of personalized knowledge-based services. In this paper we focus on the problem of clustering individual transactional data for a large mass of users. Transactional data is a very pervasive kind of information that is collected by several services, often involving huge pools of users. We propose txmeans, a parameter-free clustering algorithm able to efficiently partitioning transactional data in a completely automatic way. Txmeans is designed for the case where clustering must be applied on a massive number of different datasets, for instance when a large set of users need to be analyzed individually and each of them has generated a long history of transactions. A deep experimentation on both real and synthetic datasets shows the practical effectiveness of txmeans for the mass clustering of different personal datasets, and suggests that txmeans outperforms existing methods in terms of quality and efficiency. Finally, we present a personal cart assistant application based on txmeans</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Roberto Pellungrini</style></author><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author><author><style face="normal" font="default" size="100%">Francesca Pratesi</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Data Mining Approach to Assess Privacy Risk in Human Mobility Data</style></title><secondary-title><style face="normal" font="default" size="100%">ACM Trans. Intell. Syst. Technol.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://doi.acm.org/10.1145/3106774</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">31:1–31:27</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Human mobility data are an important proxy to understand human mobility dynamics, develop analytical services, and design mathematical models for simulation and what-if analysis. Unfortunately mobility data are very sensitive since they may enable the re-identification of individuals in a database. Existing frameworks for privacy risk assessment provide data providers with tools to control and mitigate privacy risks, but they suffer two main shortcomings: (i) they have a high computational complexity; (ii) the privacy risk must be recomputed every time new data records become available and for every selection of individuals, geographic areas, or time windows. In this article, we propose a fast and flexible approach to estimate privacy risk in human mobility data. The idea is to train classifiers to capture the relation between individual mobility patterns and the level of privacy risk of individuals. We show the effectiveness of our approach by an extensive experiment on real-world GPS data in two urban areas and investigate the relations between human mobility patterns and the privacy risk of individuals.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Guidi, Barbara</style></author><author><style face="normal" font="default" size="100%">Michienzi, Andrea</style></author><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Dynamic community analysis in decentralized online social networks</style></title><secondary-title><style face="normal" font="default" size="100%">European Conference on Parallel Processing</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mukala, Patrick</style></author><author><style face="normal" font="default" size="100%">Cerone, Antonio</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An empirical verification of a-priori learning models on mailing archives in the context of online learning activities of participants in free\libre open source software (FLOSS) communities</style></title><secondary-title><style face="normal" font="default" size="100%">Education and Information Technologies</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/article/10.1007/s10639-017-9573-6</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">6</style></number><volume><style face="normal" font="default" size="100%">22</style></volume><pages><style face="normal" font="default" size="100%">3207–3229</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Free\Libre Open Source Software (FLOSS) environments are increasingly dubbed as learning environments where practical software engineering skills can be acquired. Numerous studies have extensively investigated how knowledge is acquired in these environments through a collaborative learning model that define a learning process. Such a learning process, identified either as a result of surveys or by means of questionnaires, can be depicted through a series of graphical representations indicating the steps FLOSS community members go through as they acquire and exchange skills. These representations are referred to as a-priori learning models. They are Petri net-like workflow nets (WF-net) that provide a visual representation of the learning process as it is expected to occur. These models are representations of a learning framework or paradigm in FLOSS communities. As such, the credibility of any models is estimated through a process of model verification and validation. Therefore in this paper, we analyze these models in comparison with the real behavior captured in FLOSS repositories by means of conformance verification in process mining. The purpose of our study is twofold. Firstly, the results of our analysis provide insights on the possible discrepancies that are observed between the initial theoretical representations of learning processes and the real behavior captured in FLOSS event logs, constructed from mailing archives. Secondly, this comparison helps foster the understanding on how learning actually takes place in FLOSS environments based on empirical evidence directly from the data.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Roberto Pellungrini</style></author><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author><author><style face="normal" font="default" size="100%">Francesca Pratesi</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Fast Estimation of Privacy Risk in Human Mobility Data</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><isbn><style face="normal" font="default" size="100%">978-3-319-66283-1</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Mobility data are an important proxy to understand the patterns of human movements, develop analytical services and design models for simulation and prediction of human dynamics. Unfortunately mobility data are also very sensitive, since they may contain personal information about the individuals involved. Existing frameworks for privacy risk assessment enable the data providers to quantify and mitigate privacy risks, but they suffer two main limitations: (i) they have a high computational complexity; (ii) the privacy risk must be re-computed for each new set of individuals, geographic areas or time windows. In this paper we explore a fast and flexible solution to estimate privacy risk in human mobility data, using predictive models to capture the relation between an individual’s mobility patterns and her privacy risk. We show the effectiveness of our approach by experimentation on a real-world GPS dataset and provide a comparison with traditional methods. </style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Letizia Milli</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Forecasting success via early adoptions analysis: A data-driven study</style></title><secondary-title><style face="normal" font="default" size="100%">PloS one</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><number><style face="normal" font="default" size="100%">12</style></number><volume><style face="normal" font="default" size="100%">12</style></volume><pages><style face="normal" font="default" size="100%">e0189096</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Innovations are continuously launched over markets, such as new products over the retail market or new artists over the music scene. Some innovations become a success; others don’t. Forecasting which innovations will succeed at the beginning of their lifecycle is hard. In this paper, we provide a data-driven, large-scale account of the existence of a special niche among early adopters, individuals that consistently tend to adopt successful innovations before they reach success: we will call them Hit-Savvy. Hit-Savvy can be discovered in very different markets and retain over time their ability to anticipate the success of innovations. As our second contribution, we devise a predictive analytical process, exploiting Hit-Savvy as signals, which achieves high accuracy in the early-stage prediction of successful innovations, far beyond the reach of state-of-the-art time series forecasting models. Indeed, our findings and predictive model can be fruitfully used to support marketing strategies and product placement.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Leonardo Candela</style></author><author><style face="normal" font="default" size="100%">Paolo Manghi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Valerio Grossi</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">HyWare: a HYbrid Workflow lAnguage for Research E-infrastructures</style></title><secondary-title><style face="normal" font="default" size="100%">D-Lib Magazine</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1045/january2017-candela</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1/2</style></number><volume><style face="normal" font="default" size="100%">23</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Research e-infrastructures are &quot;systems of systems&quot;, patchworks of tools, services and data sources, evolving over time to address the needs of the scientific process. Accordingly, in such environments, researchers implement their scientific processes by means of workflows made of a variety of actions, including for example usage of web services, download and execution of shared software libraries or tools, or local and manual manipulation of data. Although scientists may benefit from sharing their scientific process, the heterogeneity underpinning e-infrastructures hinders their ability to represent, share and eventually reproduce such workflows. This work presents HyWare, a language for representing scientific process in highly-heterogeneous e-infrastructures in terms of so-called hybrid workflows. HyWare lays in between &quot;business process modeling languages&quot;, which offer a formal and high-level description of a reasoning, protocol, or procedure, and &quot;workflow execution languages&quot;, which enable the fully automated execution of a sequence of computational steps via dedicated engines.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Letizia Milli</style></author><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Information diffusion in complex networks: The active/passive conundrum</style></title><secondary-title><style face="normal" font="default" size="100%">International Workshop on Complex Networks and their Applications</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-319-72150-7_25</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Ideas, information, viruses: all of them, with their mechanisms, can spread over the complex social tissues described by our interpersonal relations. Classical spreading models can agnostically from the object of which they simulate the diffusion, thus considering spreading of virus, ideas and innovations alike. Indeed, such simplification makes easier to define a standard set of tools that can be applied to heterogeneous contexts; however, it can also lead to biased, partial, simulation outcomes. In this work we discuss the concepts of active and passive diffusion: moving from analysis of a well-known passive model, the Threshold one, we introduce two novel approaches whose aim is to provide active and mixed schemas applicable in the context of innovations/ideas diffusion simulation. Our data-driven analysis shows how, in such context, the adoption of exclusively passive/active models leads to conflicting results, thus highlighting the need of mixed approaches.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">MyWay: Location prediction via mobility profiling</style></title><secondary-title><style face="normal" font="default" size="100%">Information Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year><pub-dates><date><style  face="normal" font="default" size="100%">03/2017</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">64</style></volume><pages><style face="normal" font="default" size="100%">350–367</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Forecasting the future positions of mobile users is a valuable task allowing us to operate efficiently a myriad of different applications which need this type of information. We propose MyWay, a prediction system which exploits the individual systematic behaviors modeled by mobility profiles to predict human movements. MyWay provides three strategies: the individual strategy uses only the user individual mobility profile, the collective strategy takes advantage of all users individual systematic behaviors, and the hybrid strategy that is a combination of the previous two. A key point is that MyWay only requires the sharing of individual mobility profiles, a concise representation of the user׳s movements, instead of raw trajectory data revealing the detailed movement of the users. We evaluate the prediction performances of our proposal by a deep experimentation on large real-world data. The results highlight that the synergy between the individual and collective knowledge is the key for a better prediction and allow the system to outperform the state-of-art methods.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Letizia Milli</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author><author><style face="normal" font="default" size="100%">Alina Sirbu</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">NDlib: a python library to model and analyze diffusion processes over complex networks</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Data Science and Analytics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><pages><style face="normal" font="default" size="100%">1–19</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Nowadays the analysis of dynamics of and on networks represents a hot topic in the social network analysis playground.To support students, teachers, developers and researchers, in this work we introduce a novel framework, namely NDlib, an environment designed to describe diffusion simulations. NDlib is designed to be a multi-level ecosystem that can be fruitfully used by different user segments. For this reason, upon NDlib, we designed a simulation server that allows remote execution of experiments as well as an online visualization tool that abstracts its programmatic interface and makes available the simulation platform to non-technicians.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Letizia Milli</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author><author><style face="normal" font="default" size="100%">Alina Sirbu</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">NDlib: Studying Network Diffusion Dynamics</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE International Conference on Data Science and Advanced Analytics, DSA</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/abstract/document/8259774</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Tokyo</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Nowadays the analysis of diffusive phenomena occurring on top of complex networks represents a hot topic in the Social Network Analysis playground. In order to support students, teachers, developers and researchers in this work we introduce a novel simulation framework, ND LIB . ND LIB is designed to be a multi-level ecosystem that can be fruitfully used by different user segments. Upon the diffusion library, we designed a simulation server that allows remote execution of experiments and an online visualization tool that abstract the programmatic interface and makes available the simulation platform to non-technicians.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesca Pratesi</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Privacy Preserving Multidimensional Profiling</style></title><secondary-title><style face="normal" font="default" size="100%">International Conference on Smart Objects and Technologies for Social Good</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-319-76111-4_15</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Recently, big data had become central in the analysis of human behavior and the development of innovative services. In particular, a new class of services is emerging, taking advantage of different sources of data, in order to consider the multiple aspects of human beings. Unfortunately, these data can lead to re-identification problems and other privacy leaks, as diffusely reported in both scientific literature and media. The risk is even more pressing if multiple sources of data are linked together since a potential adversary could know information related to each dataset. For this reason, it is necessary to evaluate accurately and mitigate the individual privacy risk before releasing personal data. In this paper, we propose a methodology for the first task, i.e., assessing privacy risk, in a multidimensional scenario, defining some possible privacy attacks and simulating them using real-world datasets.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alessandro Lulli</style></author><author><style face="normal" font="default" size="100%">Lorenzo Gabrielli</style></author><author><style face="normal" font="default" size="100%">Patrizio Dazzi</style></author><author><style face="normal" font="default" size="100%">Matteo Dell'Amico</style></author><author><style face="normal" font="default" size="100%">Pietro Michiardi</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Laura Ricci</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Scalable and flexible clustering solutions for mobile phone-based population indicators</style></title><secondary-title><style face="normal" font="default" size="100%">I. J. Data Science and Analytics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1007/s41060-017-0065-y</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">4</style></volume><pages><style face="normal" font="default" size="100%">285–299</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Pollacci, Laura</style></author><author><style face="normal" font="default" size="100%">Alina Sirbu</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Claudio Lucchese</style></author><author><style face="normal" font="default" size="100%">Muntean, Cristina Ioana</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Sentiment Spreading: An Epidemic Model for Lexicon-Based Sentiment Analysis on Twitter</style></title><secondary-title><style face="normal" font="default" size="100%">Conference of the Italian Association for Artificial Intelligence</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-319-70169-1_9</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">While sentiment analysis has received significant attention in the last years, problems still exist when tools need to be applied to microblogging content. This because, typically, the text to be analysed consists of very short messages lacking in structure and semantic context. At the same time, the amount of text produced by online platforms is enormous. So, one needs simple, fast and effective methods in order to be able to efficiently study sentiment in these data. Lexicon-based methods, which use a predefined dictionary of terms tagged with sentiment valences to evaluate sentiment in longer sentences, can be a valid approach. Here we present a method based on epidemic spreading to automatically extend the dictionary used in lexicon-based sentiment analysis, starting from a reduced dictionary and large amounts of Twitter data. The resulting dictionary is shown to contain valences that correlate well with human-annotated sentiment, and to produce tweet sentiment classifications comparable to the original dictionary, with the advantage of being able to tag more tweets than the original. The method is easily extensible to various languages and applicable to large amounts of data.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sonia Bergamaschi</style></author><author><style face="normal" font="default" size="100%">Emanuele Carlini</style></author><author><style face="normal" font="default" size="100%">Michelangelo Ceci</style></author><author><style face="normal" font="default" size="100%">Barbara Furletti</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Donato Malerba</style></author><author><style face="normal" font="default" size="100%">Mario Mezzanzanica</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Gabriella Pasi</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Raffaele Perego</style></author><author><style face="normal" font="default" size="100%">Salvatore Ruggieri</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Big Data Research in Italy: A Perspective</style></title><secondary-title><style face="normal" font="default" size="100%">Engineering</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year><pub-dates><date><style  face="normal" font="default" size="100%">06/2016</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://engineering.org.cn/EN/abstract/article_12288.shtml</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">2</style></volume><pages><style face="normal" font="default" size="100%">163</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The aim of this article is to synthetically describe the research projects that a selection of Italian universities is undertaking in the context of big data. Far from being exhaustive, this article has the objective of offering a sample of distinct applications that address the issue of managing huge amounts of data in Italy, collected in relation to diverse domains.</style></abstract><call-num><style face="normal" font="default" size="100%">10-1244/N</style></call-num></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Valerio Grossi</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Driving Profiles Computation and Monitoring for Car Insurance CRM</style></title><secondary-title><style face="normal" font="default" size="100%">Journal ACM Transactions on Intelligent Systems and Technology (TIST)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://doi.acm.org/10.1145/2912148</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">8</style></volume><pages><style face="normal" font="default" size="100%">14:1–14:26</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Customer segmentation is one of the most traditional and valued tasks in customer relationship management (CRM). In this article, we explore the problem in the context of the car insurance industry, where the mobility behavior of customers plays a key role: Different mobility needs, driving habits, and skills imply also different requirements (level of coverage provided by the insurance) and risks (of accidents). In the present work, we describe a methodology to extract several indicators describing the driving profile of customers, and we provide a clustering-oriented instantiation of the segmentation problem based on such indicators. Then, we consider the availability of a continuous flow of fresh mobility data sent by the circulating vehicles, aiming at keeping our segments constantly up to date. We tackle a major scalability issue that emerges in this context when the number of customers is large-namely, the communication bottleneck-by proposing and implementing a sophisticated distributed monitoring solution that reduces communications between vehicles and company servers to the essential. We validate the framework on a large database of real mobility data coming from GPS devices on private cars. Finally, we analyze the privacy risks that the proposed approach might involve for the users, providing and evaluating a countermeasure based on data perturbation.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Valerio Grossi</style></author><author><style face="normal" font="default" size="100%">Tias Guns</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Siegfried Nijssen</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Partition-Based Clustering Using Constraint Optimization</style></title><secondary-title><style face="normal" font="default" size="100%">Data Mining and Constraint Programming - Foundations of a Cross-Disciplinary Approach</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-50137-6_11</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pages><style face="normal" font="default" size="100%">282–299</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Partition-based clustering is the task of partitioning a dataset in a number of groups of examples, such that examples in each group are similar to each other. Many criteria for what constitutes a good clustering have been identified in the literature; furthermore, the use of additional constraints to find more useful clusterings has been proposed. In this chapter, it will be shown that most of these clustering tasks can be formalized using optimization criteria and constraints. We demonstrate how a range of clustering tasks can be modelled in generic constraint programming languages with these constraints and optimization criteria. Using the constraint-based modeling approach we also relate the DBSCAN method for density-based clustering to the label propagation technique for community discovery.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Hui Wendy Wang</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Privacy-Preserving Outsourcing of Data Mining</style></title><secondary-title><style face="normal" font="default" size="100%">40th IEEE Annual Computer Software and Applications Conference, {COMPSAC} Workshops 2016, Atlanta, GA, USA, June 10-14, 2016</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1109/COMPSAC.2016.169</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher><pub-location><style face="normal" font="default" size="100%"> Atlanta, GA, USA</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Data mining is gaining momentum in society due to the ever increasing availability of large amounts of data, easily gathered by a variety of collection technologies and stored via computer systems. Due to the limited computational resources of data owners and the developments in cloud computing, there has been considerable recent interest in the paradigm of data mining-as-a-service (DMaaS). In this paradigm, a company (data owner) lacking in expertise or computational resources outsources its mining needs to a third party service provider (server). Given the fact that the server may not be fully trusted, one of the main concerns of the DMaaS paradigm is the protection of data privacy. In this paper, we provide an overview of a variety of techniques and approaches that address the privacy issues of the DMaaS paradigm.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Marrella, Alessandro</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Kloepper, Benjamin</style></author><author><style face="normal" font="default" size="100%">Krueger, Martin W</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Privacy-Preserving Outsourcing of Pattern Mining of Event-Log Data-A Use-Case from Process Industry</style></title><secondary-title><style face="normal" font="default" size="100%">Cloud Computing Technology and Science (CloudCom), 2016 IEEE International Conference on</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">With the advent of cloud computing and its model for IT services based on the Internet and big data centers, the interest of industries into XaaS (&quot;Anything as a Service&quot;) paradigm is increasing. Business intelligence and knowledge discovery services are typical services that companies tend to externalize on the cloud, due to their data intensive nature and the algorithms complexity. What is appealing for a company is to rely on external expertise and infrastructure to compute the analytical results and models which are required by the business analysts for understanding the business phenomena under observation. Although it is advantageous to achieve sophisticated analysis there exist several serious privacy issues in this paradigm. In this paper we investigate through an industrial use-case the application of a framework for privacypreserving outsourcing of pattern mining on event-log data. Moreover, we present and discuss some ideas about possible extensions.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>6</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ayris, Paul</style></author><author><style face="normal" font="default" size="100%">Berthou, Jean-Yves</style></author><author><style face="normal" font="default" size="100%">Bruce, Rachel</style></author><author><style face="normal" font="default" size="100%">Lindstaedt, Stefanie</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Mons, Barend</style></author><author><style face="normal" font="default" size="100%">Murayama, Yasuhiro</style></author><author><style face="normal" font="default" size="100%">Södergård, Caj</style></author><author><style face="normal" font="default" size="100%">Tochtermann, Klaus</style></author><author><style face="normal" font="default" size="100%">Wilkinson, Ross</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Realising the European open science cloud</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.2777/940154</style></url></web-urls></urls><isbn><style face="normal" font="default" size="100%">978-92-79-61762-1</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The European Open Science Cloud (EOSC) aims to accelerate and support the current transition to more effective Open Science and Open Innovation in the Digital Single Market. It should enable trusted access to services, systems and the re-use of shared scientific data across disciplinary, social and geographical borders. This report approaches the EOSC as a federated environment for scientific data sharing and re-use, based on existing and emerging elements in the Member States, with light-weight international guidance and governance, and a large degree of freedom regarding practical implementation.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Ioanna Miliou</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A supervised approach for intra-/inter-community interaction prediction in dynamic social networks</style></title><secondary-title><style face="normal" font="default" size="100%">Social Network Analysis and Mining</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year><pub-dates><date><style  face="normal" font="default" size="100%">09/2016</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/s13278-016-0397-y</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">6</style></volume><pages><style face="normal" font="default" size="100%">86</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Due to the growing availability of Internet services in the last decade, the interactions between people became more and more easy to establish. For example, we can have an intercontinental job interview, or we can send real-time multimedia content to any friend of us just owning a smartphone. All this kind of human activities generates digital footprints, that describe a complex, rapidly evolving, network structures. In such dynamic scenario, one of the most challenging tasks involves the prediction of future interactions between couples of actors (i.e., users in online social networks, researchers in collaboration networks). In this paper, we approach such problem by leveraging networks dynamics: to this extent, we propose a supervised learning approach which exploits features computed by time-aware forecasts of topological measures calculated between node pairs. Moreover, since real social networks are generally composed by weakly connected modules, we instantiate the interaction prediction problem in two disjoint applicative scenarios: intra-community and inter-community link prediction. Experimental results on real time-stamped networks show how our approach is able to reach high accuracy. Furthermore, we analyze the performances of our methodology when varying the typologies of features, community discovery algorithms and forecast methods.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Unveiling mobility complexity through complex network analysis</style></title><secondary-title><style face="normal" font="default" size="100%">Social Network Analysis and Mining</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">6</style></volume><pages><style face="normal" font="default" size="100%">59</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The availability of massive digital traces of individuals is offering a series of novel insights on the understanding of patterns characterizing human mobility. Many studies try to semantically enrich mobility data with annotations about human activities. However, these approaches either focus on places with high frequencies (e.g., home and work), or relay on background knowledge (e.g., public available points of interest). In this paper, we depart from the concept of frequency and we focus on a high level representation of mobility using network analytics. The visits of each driver to each systematic destination are modeled as links in a bipartite network where a set of nodes represents drivers and the other set represents places. We extract such network from two real datasets of human mobility based, respectively, on GPS and GSM data. We introduce the concept of mobility complexity of drivers and places as a ranking analysis over the nodes of these networks. In addition, by means of community discovery analysis, we differentiate subgroups of drivers and places according both to their homogeneity and to their mobility complexity.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Balliu, Alkida</style></author><author><style face="normal" font="default" size="100%">Olivetti, Dennis</style></author><author><style face="normal" font="default" size="100%">Ozalp Babaoglu</style></author><author><style face="normal" font="default" size="100%">Marzolla, Moreno</style></author><author><style face="normal" font="default" size="100%">Alina Sirbu</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Big Data Analyzer for Large Trace Logs</style></title><secondary-title><style face="normal" font="default" size="100%">Computing</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://link.springer.com/article/10.1007/s00607-015-0480-7</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Valerio Grossi</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Clustering Formulation Using Constraint Optimization</style></title><secondary-title><style face="normal" font="default" size="100%">Software Engineering and Formal Methods - {SEFM} 2015 Collocated Workshops: ATSE, HOFM, MoKMaSD, and VERY*SCART, York, UK, September 7-8, 2015, Revised Selected Papers</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-662-49224-6_9</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer Berlin Heidelberg</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The problem of clustering a set of data is a textbook machine learning problem, but at the same time, at heart, a typical optimization problem. Given an objective function, such as minimizing the intra-cluster distances or maximizing the inter-cluster distances, the task is to find an assignment of data points to clusters that achieves this objective. In this paper, we present a constraint programming model for a centroid based clustering and one for a density based clustering. In particular, as a key contribution, we show how the expressivity introduced by the formulation of the problem by constraint programming makes the standard problem easy to be extended with other constraints that permit to generate interesting variants of the problem. We show this important aspect in two different ways: first, we show how the formulation of the density-based clustering by constraint programming makes it very similar to the label propagation problem and then, we propose a variant of the standard label propagation approach.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sara Hajian</style></author><author><style face="normal" font="default" size="100%">Josep Domingo-Ferrer</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Discrimination- and privacy-aware patterns</style></title><secondary-title><style face="normal" font="default" size="100%">Data Min. Knowl. Discov.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/s10618-014-0393-7</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">6</style></number><volume><style face="normal" font="default" size="100%">29</style></volume><pages><style face="normal" font="default" size="100%">1733–1782</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Data mining is gaining societal momentum due to the ever increasing availability of large amounts of human data, easily collected by a variety of sensing technologies. We are therefore faced with unprecedented opportunities and risks: a deeper understanding of human behavior and how our society works is darkened by a greater chance of privacy intrusion and unfair discrimination based on the extracted patterns and profiles. Consider the case when a set of patterns extracted from the personal data of a population of individual persons is released for a subsequent use into a decision making process, such as, e.g., granting or denying credit. First, the set of patterns may reveal sensitive information about individual persons in the training population and, second, decision rules based on such patterns may lead to unfair discrimination, depending on what is represented in the training cases. Although methods independently addressing privacy or discrimination in data mining have been proposed in the literature, in this context we argue that privacy and discrimination risks should be tackled together, and we present a methodology for doing so while publishing frequent pattern mining results. We describe a set of pattern sanitization methods, one for each discrimination measure used in the legal literature, to achieve a fair publishing of frequent patterns in combination with two possible privacy transformations: one based on k-anonymity and one based on differential privacy. Our proposed pattern sanitization methods based on k-anonymity yield both privacy- and discrimination-protected patterns, while introducing reasonable (controlled) pattern distortion. Moreover, they obtain a better trade-off between protection and data quality than the sanitization methods based on differential privacy. Finally, the effectiveness of our proposals is assessed by extensive experiments. </style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mukala, Patrick</style></author><author><style face="normal" font="default" size="100%">Cerone, Antonio</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An exploration of learning processes as process maps in FLOSS repositories</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://eprints.adm.unipi.it/id/eprint/2344</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Evidence suggests that Free/Libre Open Source Software (FLOSS) environ-ments provide unlimited learning opportunities. Community members engage in a number of activities both during their interaction with their peers and while mak-ing use of the tools available in these environments. A number of studies docu-ment the existence of learning processes in FLOSS through the analysis of sur-veys and questionnaires filled by FLOSS project participants. At the same time, the interest in understanding the dynamics of the FLOSS phenomenon, its popu-larity and success resulted in the development of tools and techniques for extract-ing and analyzing data from different FLOSS data sources. This new field is called Mining Software Repositories (MSR). In spite of these efforts, there is limited work aiming to provide empirical evidence of learning processes directly from FLOSS repositories. In this paper, we seek to trigger such an initiative by proposing an approach based on Process Mining to trace learning behaviors from FLOSS participants’ trails of activities, as recorded in FLOSS repositories, and visualize them as pro-cess maps. Process maps provide a pictorial representation of real behavior as it is recorded in FLOSS data. Our aim is to provide critical evidence that boosts the understanding of learning behavior in FLOSS communities by analyzing the rel-evant repositories. In order to accomplish this, we propose an effective approach that comprises first the mining of FLOSS repositories in order to generate Event logs, and then the generation of process maps, equipped with relevant statistical data interpreting and indicating the value of process discovery from these reposi-tories.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paolo Cintia</style></author><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Marco Malvaldi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The harsh rule of the goals: data-driven performance indicators for football teams</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE International Conference on Data Science and Advanced Analytics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.researchgate.net/profile/Luca_Pappalardo/publication/281318318_The_harsh_rule_of_the_goals_data-driven_performance_indicators_for_football_teams/links/561668e308ae37cfe4090a5d.pdf</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">—Sports analytics in general, and football (soccer in
USA) analytics in particular, have evolved in recent years in an
amazing way, thanks to automated or semi-automated sensing
technologies that provide high-fidelity data streams extracted
from every game. In this paper we propose a data-driven
approach and show that there is a large potential to boost the
understanding of football team performance. From observational
data of football games we extract a set of pass-based performance
indicators and summarize them in the H indicator. We observe a
strong correlation among the proposed indicator and the success
of a team, and therefore perform a simulation on the four major
European championships (78 teams, almost 1500 games). The
outcome of each game in the championship was replaced by a
synthetic outcome (win, loss or draw) based on the performance
indicators computed for each team. We found that the final
rankings in the simulated championships are very close to the
actual rankings in the real championships, and show that teams
with high ranking error show extreme values of a defense/attack
efficiency measure, the Pezzali score. Our results are surprising
given the simplicity of the proposed indicators, suggesting that
a complex systems’ view on football data has the potential of
revealing hidden patterns and behavior of superior quality.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mukala, Patrick</style></author><author><style face="normal" font="default" size="100%">Cerone, Antonio</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Mining learning processes from FLOSS mailing archives</style></title><secondary-title><style face="normal" font="default" size="100%">Conference on e-Business, e-Services and e-Society</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer, Cham</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Evidence suggests that Free/Libre Open Source Software (FLOSS) environments provide unlimited learning opportunities. Community members engage in a number of activities both during their interaction with their peers and while making use of these environments. As FLOSS repositories store data about participants’ interaction and activities, we analyze participants’ interaction and knowledge exchange in emails to trace learning activities that occur in distinct phases of the learning process. We make use of semantic search in SQL to retrieve data and build corresponding event logs which are then fed to a process mining tool in order to produce visual workflow nets. We view these nets as representative of the traces of learning activities in FLOSS as well as their relevant flow of occurrence. Additional statistical details are provided to contextualize and describe these models.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alina Sirbu</style></author><author><style face="normal" font="default" size="100%">Becker, Martin</style></author><author><style face="normal" font="default" size="100%">Saverio Caminiti</style></author><author><style face="normal" font="default" size="100%">De Baets, Bernard</style></author><author><style face="normal" font="default" size="100%">Elen, Bart</style></author><author><style face="normal" font="default" size="100%">Francis, Louise</style></author><author><style face="normal" font="default" size="100%">Pietro Gravino</style></author><author><style face="normal" font="default" size="100%">Hotho, Andreas</style></author><author><style face="normal" font="default" size="100%">Ingarra, Stefano</style></author><author><style face="normal" font="default" size="100%">Vittorio Loreto</style></author><author><style face="normal" font="default" size="100%">Molino, Andrea</style></author><author><style face="normal" font="default" size="100%">Mueller, Juergen</style></author><author><style face="normal" font="default" size="100%">Peters, Jan</style></author><author><style face="normal" font="default" size="100%">Ricchiuti, Ferdinando</style></author><author><style face="normal" font="default" size="100%">Saracino, Fabio</style></author><author><style face="normal" font="default" size="100%">Vito D P Servedio</style></author><author><style face="normal" font="default" size="100%">Stumme, Gerd</style></author><author><style face="normal" font="default" size="100%">Theunis, Jan</style></author><author><style face="normal" font="default" size="100%">Francesca Tria</style></author><author><style face="normal" font="default" size="100%">Van den Bossche, Joris</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Participatory Patterns in an International Air Quality Monitoring Initiative.</style></title><secondary-title><style face="normal" font="default" size="100%">PLoS One</style></secondary-title><alt-title><style face="normal" font="default" size="100%">PLoS ONE</style></alt-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2015</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">10</style></volume><pages><style face="normal" font="default" size="100%">e0136763</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The issue of sustainability is at the top of the political and societal agenda, being considered of extreme importance and urgency. Human individual action impacts the environment both locally (e.g., local air/water quality, noise disturbance) and globally (e.g., climate change, resource use). Urban environments represent a crucial example, with an increasing realization that the most effective way of producing a change is involving the citizens themselves in monitoring campaigns (a citizen science bottom-up approach). This is possible by developing novel technologies and IT infrastructures enabling large citizen participation. Here, in the wider framework of one of the first such projects, we show results from an international competition where citizens were involved in mobile air pollution monitoring using low cost sensing devices, combined with a web-based game to monitor perceived levels of pollution. Measures of shift in perceptions over the course of the campaign are provided, together with insights into participatory patterns emerging from this study. Interesting effects related to inertia and to direct involvement in measurement activities rather than indirect information exposure are also highlighted, indicating that direct involvement can enhance learning and environmental awareness. In the future, this could result in better adoption of policies towards decreasing pollution.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Letizia Milli</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Fabrizio Sebastiani</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Quantification in Social Networks</style></title><secondary-title><style face="normal" font="default" size="100%">International Conference on Data Science and Advanced Analytics (IEEE DSAA'2015)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.giuliorossetti.net/about/wp-content/uploads/2015/12/main_DSAA.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Paris, France</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In many real-world applications there is a need to monitor the distribution of a population across different classes, and to track changes in this distribution over time. As an example, an important task is to monitor the percentage of unemployed adults in a given region. When the membership of an individual in a class cannot be established deterministically, a typical solution is the classification task. However, in the above applications the final goal is not determining which class the individuals belong to, but estimating the prevalence of each class in the unlabeled data. This task is called quantification. Most of the work in the literature addressed the quantification problem considering data presented in conventional attribute format. Since the ever-growing availability of web and social media we have a flourish of network data representing a new important source of information and by using quantification network techniques we could quantify collective behavior, i.e., the number of users that are involved in certain type of activities, preferences, or behaviors. In this paper we exploit the homophily effect observed in many social networks in order to construct a quantifier for networked data. Our experiments show the effectiveness of the proposed approaches and the comparison with the existing state-of-the-art quantification methods shows that they are more accurate. </style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anirban Basu</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author><author><style face="normal" font="default" size="100%">Juan Camilo Corena</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Shinsaku Kiyomoto</style></author><author><style face="normal" font="default" size="100%">Yutaka Miyake</style></author><author><style face="normal" font="default" size="100%">Tadashi Yanagihara</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A risk model for privacy in trajectory data</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Trust Management</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">2</style></volume><pages><style face="normal" font="default" size="100%">9</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Time sequence data relating to users, such as medical histories and mobility data, are good candidates for data mining, but often contain highly sensitive information. Different methods in privacy-preserving data publishing are utilised to release such private data so that individual records in the released data cannot be re-linked to specific users with a high degree of certainty. These methods provide theoretical worst-case privacy risks as measures of the privacy protection that they offer. However, often with many real-world data the worst-case scenario is too pessimistic and does not provide a realistic view of the privacy risks: the real probability of re-identification is often much lower than the theoretical worst-case risk. In this paper, we propose a novel empirical risk model for privacy which, in relation to the cost of privacy attacks, demonstrates better the practical risks associated with a privacy preserving data release. We show detailed evaluation of the proposed risk model by using k-anonymised real-world mobility data and then, we show how the empirical evaluation of the privacy risk has a different trend in synthetic data describing random movements.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Stefano Marchetti</style></author><author><style face="normal" font="default" size="100%">Caterina Giusti</style></author><author><style face="normal" font="default" size="100%">Monica Pratesi</style></author><author><style face="normal" font="default" size="100%">Nicola Salvati</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author><author><style face="normal" font="default" size="100%">Lorenzo Gabrielli</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Small Area Model-Based Estimators Using Big Data Sources</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Official Statistics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">31</style></volume><pages><style face="normal" font="default" size="100%">263–281</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mukala, Patrick</style></author><author><style face="normal" font="default" size="100%">Cerone, Antonio</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An abstract state machine (ASM) representation of learning process in FLOSS communities</style></title><secondary-title><style face="normal" font="default" size="100%">International Conference on Software Engineering and Formal Methods</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer, Cham</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Free/Libre Open Source Software (FLOSS) communities as collaborative environments enable the occurrence of learning between participants in these groups. With the increasing interest research on understanding the mechanisms and processes through which learning occurs in FLOSS, there is an imperative to describe these processes. One successful way of doing this is through specification methods. In this paper, we describe the adoption of Abstract States Machines (ASMs) as a specification methodology for the description of learning processes in FLOSS. The goal of this endeavor is to represent the many possible steps and/or activities FLOSS participants go through during interactions that can be categorized as learning processes. Through ASMs, we express learning phases as states while activities that take place before moving from one state to another are expressed as transitions.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Ruggero G. Pensa</style></author><author><style face="normal" font="default" size="100%">Fabio Pinelli</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Anonymity preserving sequential pattern mining</style></title><secondary-title><style face="normal" font="default" size="100%">Artif. Intell. Law</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/s10506-014-9154-6</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">22</style></volume><pages><style face="normal" font="default" size="100%">141–173</style></pages><abstract><style face="normal" font="default" size="100%">The increasing availability of personal data of a sequential nature, such as time-stamped transaction or location data, enables increasingly sophisticated sequential pattern mining techniques. However, privacy is at risk if it is possible to reconstruct the identity of individuals from sequential data. Therefore, it is important to develop privacy-preserving techniques that support publishing of really anonymous data, without altering the analysis results significantly. In this paper we propose to apply the Privacy-by-design paradigm for designing a technological framework to counter the threats of undesirable, unlawful effects of privacy violation on sequence data, without obstructing the knowledge discovery opportunities of data mining technologies. First, we introduce a k-anonymity framework for sequence data, by defining the sequence linking attack model and its associated countermeasure, a k-anonymity notion for sequence datasets, which provides a formal protection against the attack. Second, we instantiate this framework and provide a specific method for constructing the k-anonymous version of a sequence dataset, which preserves the results of sequential pattern mining, together with several basic statistics and other analytical properties of the original data, including the clustering structure. A comprehensive experimental study on realistic datasets of process-logs, web-logs and GPS tracks is carried out, which empirically shows how, in our proposed method, the protection of privacy meets analytical utility.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Balliu, Alkida</style></author><author><style face="normal" font="default" size="100%">Olivetti, Dennis</style></author><author><style face="normal" font="default" size="100%">Ozalp Babaoglu</style></author><author><style face="normal" font="default" size="100%">Marzolla, Moreno</style></author><author><style face="normal" font="default" size="100%">Alina Sirbu</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">BiDAl: Big Data Analyzer for Cluster Traces</style></title><secondary-title><style face="normal" font="default" size="100%">Informatika (BigSys workshop)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://arxiv.org/abs/1410.1309</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">GI-Edition Lecture Notes in Informatics</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anirban Basu</style></author><author><style face="normal" font="default" size="100%">Juan Camilo Corena</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Shinsaku Kiyomoto</style></author><author><style face="normal" font="default" size="100%">Vaidya, Jaideep</style></author><author><style face="normal" font="default" size="100%">Yutaka Miyake</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">CF-inspired Privacy-Preserving Prediction of Next Location in the Cloud</style></title><secondary-title><style face="normal" font="default" size="100%">Cloud Computing Technology and Science (CloudCom), 2014 IEEE 6th International Conference on</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1109/CloudCom.2014.114</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Mobility data gathered from location sensors such as Global Positioning System (GPS) enabled phones and vehicles is valuable for spatio-temporal data mining for various location-based services (LBS). Such data is often considered sensitive and there exist many a mechanism for privacy preserving analyses of the data. Through various anonymisation mechanisms, it can be ensured with a high probability that a particular individual cannot be identified when mobility data is outsourced to third parties for analysis. However, challenges remain with the privacy of the queries on outsourced analysis results, especially when the queries are sent directly to third parties by end-users. Drawing inspiration from our earlier work in privacy preserving collaborative filtering (CF) and next location prediction, in this exploratory work, we propose a novel representation of trajectory data in the CF domain and experiment with a privacy preserving Slope One CF predictor. We present evaluations for the accuracy and the computational performance of our proposal using anonymised data gathered from real traffic data in the Italian cities of Pisa and Milan. One use-case is a third-party location-prediction-as-a-service deployed on a public cloud, which can respond to privacy-preserving queries while enabling data owners to build a rich predictor on the cloud. </style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sara Hajian</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Josep Domingo-Ferrer</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Fair pattern discovery</style></title><secondary-title><style face="normal" font="default" size="100%">Symposium on Applied Computing, {SAC} 2014, Gyeongju, Republic of Korea - March 24 - 28, 2014</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://doi.acm.org/10.1145/2554850.2555043</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">113–120</style></pages><abstract><style face="normal" font="default" size="100%">Data mining is gaining societal momentum due to the ever increasing availability of large amounts of human data, easily collected by a variety of sensing technologies. We are assisting to unprecedented opportunities of understanding human and society behavior that unfortunately is darkened by several risks for human rights: one of this is the unfair discrimination based on the extracted patterns and profiles. Consider the case when a set of patterns extracted from the personal data of a population of individual persons is released for subsequent use in a decision making process, such as, e.g., granting or denying credit. Decision rules based on such patterns may lead to unfair discrimination, depending on what is represented in the training cases. In this context, we address the discrimination risks resulting from publishing frequent patterns. We present a set of pattern sanitization methods, one for each discrimination measure used in the legal literature, for fair (discrimination-protected) publishing of frequent pattern mining results. Our proposed pattern sanitization methods yield discrimination-protected patterns, while introducing reasonable (controlled) pattern distortion. Finally, the effectiveness of our proposals is assessed by extensive experiments.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sergio Mascetti</style></author><author><style face="normal" font="default" size="100%">Ricci, Annarita</style></author><author><style face="normal" font="default" size="100%">Salvatore Ruggieri</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Introduction to special issue on computational methods for enforcing privacy and fairness in the knowledge society</style></title><secondary-title><style face="normal" font="default" size="100%">Artificial Intelligence and Law</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">22</style></volume><pages><style face="normal" font="default" size="100%">109–111</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mukala, Patrick</style></author><author><style face="normal" font="default" size="100%">Cerone, Antonio</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Ontolifloss: Ontology for learning processes in FLOSS communities</style></title><secondary-title><style face="normal" font="default" size="100%">International Conference on Software Engineering and Formal Methods</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer, Cham</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Free/Libre Open Source Software (FLOSS) communities are considered an example of commons-based peer-production models where groups of participants work together to achieve projects of common purpose. In these settings, many occurring activities can be documented and have established them as learning environments. As knowledge exchange is proved to occur in FLOSS, the dynamic and free nature of participation poses a great challenge in understanding activities pertaining to Learning Processes.

In this paper we raise this question and propose an ontology (called OntoLiFLOSS) in order to define terms and concepts that can explain learning activities taking place in these communities. The objective of this endeavor is to define in the simplest possible way a common definition of concepts and activities that can guide the identification of learning processes taking place among FLOSS members in any of the standard repositories such as mailing list, SVN, bug trackers and even discussion forums.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anirban Basu</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Juan Camilo Corena</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Shinsaku Kiyomoto</style></author><author><style face="normal" font="default" size="100%">Yutaka Miyake</style></author><author><style face="normal" font="default" size="100%">Tadashi Yanagihara</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Privacy Risk Model for Trajectory Data</style></title><secondary-title><style face="normal" font="default" size="100%">Trust Management {VIII} - 8th {IFIP} {WG} 11.11 International Conference, {IFIPTM} 2014, Singapore, July 7-10, 2014. Proceedings</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-662-43813-8_9</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">125–140</style></pages><abstract><style face="normal" font="default" size="100%">Time sequence data relating to users, such as medical histories and mobility data, are good candidates for data mining, but often contain highly sensitive information. Different methods in privacy-preserving data publishing are utilised to release such private data so that individual records in the released data cannot be re-linked to specific users with a high degree of certainty. These methods provide theoretical worst-case privacy risks as measures of the privacy protection that they offer. However, often with many real-world data the worst-case scenario is too pessimistic and does not provide a realistic view of the privacy risks: the real probability of re-identification is often much lower than the theoretical worst-case risk. In this paper we propose a novel empirical risk model for privacy which, in relation to the cost of privacy attacks, demonstrates better the practical risks associated with a privacy preserving data release. We show detailed evaluation of the proposed risk model by using k-anonymised real-world mobility data.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author><author><style face="normal" font="default" size="100%">Francesca Pratesi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Privacy-by-Design in Big Data Analytics and Social Mining</style></title><secondary-title><style face="normal" font="default" size="100%">EPJ Data Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><volume><style face="normal" font="default" size="100%">10</style></volume><abstract><style face="normal" font="default" size="100%">Privacy is ever-growing concern in our society and is becoming a fundamental aspect to take into account when one wants to use, publish and analyze data involving human personal sensitive information. Unfortunately, it is increasingly hard to transform the data in a way that it protects sensitive information: we live in the era of big data characterized by unprecedented opportunities to sense, store and analyze social data describing human activities in great detail and resolution. As a result, privacy preservation simply cannot be accomplished by de-identification alone. In this paper, we propose the privacy-by-design paradigm to develop technological frameworks for countering the threats of undesirable, unlawful effects of privacy violation, without obstructing the knowledge discovery opportunities of social mining and big data analytical technologies. Our main idea is to inscribe privacy protection into the knowledge discovery technology by design, so that the analysis incorporates the relevant privacy requirements from the start.</style></abstract><notes><style face="normal" font="default" size="100%">2014:10</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mukala, Patrick</style></author><author><style face="normal" font="default" size="100%">Cerone, Antonio</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Process mining event logs from FLOSS data: state of the art and perspectives</style></title><secondary-title><style face="normal" font="default" size="100%">International Conference on Software Engineering and Formal Methods</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer, Cham</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Free/Libre Open Source Software (FLOSS) is a phenomenon that has undoubtedly triggered extensive research endeavors. At the heart of these initiatives is the ability to mine data from FLOSS repositories with the hope of revealing empirical evidence to answer existing questions on the FLOSS development process. In spite of the success produced with existing mining techniques, emerging questions about FLOSS data require alternative and more appropriate ways to explore and analyse such data.

In this paper, we explore a different perspective called process mining. Process mining has been proved to be successful in terms of tracing and reconstructing process models from data logs (event logs). The chief objective of our analysis is threefold. We aim to achieve: (1) conformance to predefined models; (2) discovery of new model patterns; and, finally, (3) extension to predefined models.

</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Retrieving Points of Interest from Human Systematic Movements</style></title><secondary-title><style face="normal" font="default" size="100%">Software Engineering and Formal Methods</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pages><style face="normal" font="default" size="100%">294–308</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Human mobility analysis is emerging as a more and more fundamental task to deeply understand human behavior. In the last decade these kind of studies have become feasible thanks to the massive increase in availability of mobility data. A crucial point, for many mobility applications and analysis, is to extract interesting locations for people. In this paper, we propose a novel methodology to retrieve efficiently significant places of interest from movement data. Using car drivers’ systematic movements we mine everyday interesting locations, that is, places around which people life gravitates. The outcomes show the empirical evidence that these places capture nearly the whole mobility even though generated only from systematic movements abstractions.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Barbara Furletti</style></author><author><style face="normal" font="default" size="100%">Lorenzo Gabrielli</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Letizia Milli</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors><subsidiary-authors><author><style face="normal" font="default" size="100%">Roberta Vivio</style></author><author><style face="normal" font="default" size="100%">Giuseppe Garofalo</style></author></subsidiary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Use of mobile phone data to estimate mobility flows. Measuring urban population and inter-city mobility using big data in an integrated approach</style></title><secondary-title><style face="normal" font="default" size="100%">47th SIS Scientific Meeting of the Italian Statistica Society</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year><pub-dates><date><style  face="normal" font="default" size="100%">06/2014</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.sis2014.it/proceedings/allpapers/3026.pdf</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Cagliari </style></pub-location><isbn><style face="normal" font="default" size="100%">978-88-8467-874-4</style></isbn><abstract><style face="normal" font="default" size="100%">The Big Data, originating from the digital breadcrumbs of human activi-
ties, sensed as a by-product of the technologies that we use for our daily activities, let
us to observe the individual and collective behavior of people at an unprecedented
detail. Many dimensions of our social life have big data “proxies”, as the mobile
calls data for mobility. In this paper we investigate to what extent such ”big data”,
in integration with administrative ones, could be a support in producing reliable and
timely estimates of inter-city mobility. The study has been jointly developed by Is-
tat, CNR, University of Pisa in the range of interest of the “Commssione di studio
avente il compito di orientare le scelte dellIstat sul tema dei Big Data ”. In an on-
going project at ISTAT, called “Persons and Places” – based on an integration of
administrative data sources, it has been produced a first release of Origin Destina-
tion matrix – at municipality level – assuming that the places of residence and that
of work (or study) be the terminal points of usual individual mobility for work or
study. The coincidence between the city of residence and that of work (or study) –
is considered as a proxy of the absence of intercity mobility for a person (we define
him a static resident). The opposite case is considered as a proxy of presence of mo-
bility (the person is a dynamic resident: commuter or embedded). As administrative
data do not contain information on frequency of the mobility, the idea is to specify
an estimate method, using calling data as support, to define for each municipality the
stock of standing residents, embedded city users and daily city users (commuters)</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ivanildo Barbosa</style></author><author><style face="normal" font="default" size="100%">Marco A. Casanova</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">de José Antônio Fernandes Macêdo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Average Speed Estimation For Road Networks Based On GPS Raw Trajectories</style></title><secondary-title><style face="normal" font="default" size="100%">ICEIS Conference</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Becker, Martin</style></author><author><style face="normal" font="default" size="100%">Saverio Caminiti</style></author><author><style face="normal" font="default" size="100%">Fiorella, Donato</style></author><author><style face="normal" font="default" size="100%">Francis, Louise</style></author><author><style face="normal" font="default" size="100%">Pietro Gravino</style></author><author><style face="normal" font="default" size="100%">Haklay, Mordechai Muki</style></author><author><style face="normal" font="default" size="100%">Hotho, Andreas</style></author><author><style face="normal" font="default" size="100%">Vittorio Loreto</style></author><author><style face="normal" font="default" size="100%">Mueller, Juergen</style></author><author><style face="normal" font="default" size="100%">Ricchiuti, Ferdinando</style></author><author><style face="normal" font="default" size="100%">Vito D P Servedio</style></author><author><style face="normal" font="default" size="100%">Alina Sirbu</style></author><author><style face="normal" font="default" size="100%">Francesca Tria</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Awareness and learning in participatory noise sensing.</style></title><secondary-title><style face="normal" font="default" size="100%">PLoS One</style></secondary-title><alt-title><style face="normal" font="default" size="100%">PLoS ONE</style></alt-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2013</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">8</style></volume><pages><style face="normal" font="default" size="100%">e81638</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The development of ICT infrastructures has facilitated the emergence of new paradigms for looking at society and the environment over the last few years. Participatory environmental sensing, i.e. directly involving citizens in environmental monitoring, is one example, which is hoped to encourage learning and enhance awareness of environmental issues. In this paper, an analysis of the behaviour of individuals involved in noise sensing is presented. Citizens have been involved in noise measuring activities through the WideNoise smartphone application. This application has been designed to record both objective (noise samples) and subjective (opinions, feelings) data. The application has been open to be used freely by anyone and has been widely employed worldwide. In addition, several test cases have been organised in European countries. Based on the information submitted by users, an analysis of emerging awareness and learning is performed. The data show that changes in the way the environment is perceived after repeated usage of the application do appear. Specifically, users learn how to recognise different noise levels they are exposed to. Additionally, the subjective data collected indicate an increased user involvement in time and a categorisation effect between pleasant and less pleasant environments.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Kenneth S. Boeg</style></author><author><style face="normal" font="default" size="100%">Ira Assent,</style></author><author><style face="normal" font="default" size="100%">Matteo Magnani</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Efficient GPU-based skyline computation</style></title><secondary-title><style face="normal" font="default" size="100%">DAMON@SIGMOD 2013</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2013</style></date></pub-dates></dates></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michele Berlingerio</style></author><author><style face="normal" font="default" size="100%">Michele Coscia</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Evolving networks: Eras and turning points</style></title><secondary-title><style face="normal" font="default" size="100%">Intell. Data Anal.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.3233/IDA-120566</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">17</style></volume><pages><style face="normal" font="default" size="100%">27–48</style></pages><abstract><style face="normal" font="default" size="100%">Within the large body of research in complex network analysis, an important topic is the temporal evolution of networks. Existing approaches aim at analyzing the evolution on the global and the local scale, extracting properties of either the entire network or local patterns. In this paper, we focus on detecting clusters of temporal snapshots of a network, to be interpreted as eras of evolution. To this aim, we introduce a novel hierarchical clustering methodology, based on a dissimilarity measure (derived from the Jaccard coefficient) between two temporal snapshots of the network, able to detect the turning points at the beginning of the eras. We devise a framework to discover and browse the eras, either in top-down or a bottom-up fashion, supporting the exploration of the evolution at any level of temporal resolution. We show how our approach applies to real networks and null models, by detecting eras in an evolving co-authorship graph extracted from a bibliographic dataset, a collaboration graph extracted from a cinema database, and a network extracted from a database of terrorist attacks; we illustrate how the discovered temporal clustering highlights the crucial moments when the networks witnessed profound changes in their structure. Our approach is finally boosted by introducing a meaningful labeling of the obtained clusters, such as the characterizing topics of each discovered era, thus adding a semantic dimension to our analysis.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ricardo Wagner</style></author><author><style face="normal" font="default" size="100%">de José Antônio Fernandes Macêdo</style></author><author><style face="normal" font="default" size="100%">Alessandra Raffaetà</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Alessandro Roncato</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Mob-Warehouse: A semantic approach for mobility analysis with a Trajectory Data Ware- house</style></title><secondary-title><style face="normal" font="default" size="100%">SecoGIS 2013 - International Workshop on Semantic Aspects of GIS, Joint to ER conference 2013</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><pub-location><style face="normal" font="default" size="100%">Hong Kong</style></pub-location></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Matteo Magnani</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">On multidimensional network measures</style></title><secondary-title><style face="normal" font="default" size="100%">SEDB 2013</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2013</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.researchgate.net/publication/256194479_On_multidimensional_network_measures</style></url></web-urls></urls><abstract><style face="normal" font="default" size="100%">Networks, i.e., sets of interconnected entities, are ubiquitous,
spanning disciplines as diverse as sociology, biology and computer science.
The recent availability of large amounts of network data has thus
provided a unique opportunity to develop models and analysis tools applicable
to a wide range of scenarios. However, real-world phenomena are
often more complex than existing graph data models. One relevant example
concerns the numerous types of social relationships (or edges) that
can be present between individuals in a social network. In this short paper
we present a unified model and a set of measures recently developed
to represent and analyze network data with multiple types of edges.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesca Pratesi</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Hui Wendy Wang</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Gennady Andrienko</style></author><author><style face="normal" font="default" size="100%">Natalia Andrienko</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Privacy-Aware Distributed Mobility Data Analytics</style></title><secondary-title><style face="normal" font="default" size="100%">SEBD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><pub-location><style face="normal" font="default" size="100%">Roccella Jonica</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We propose an approach to preserve privacy in an analytical processing within a distributed setting, and tackle the problem of obtaining aggregated information about vehicle traffic in a city from movement data collected by individual vehicles and shipped to a central server. Movement data are sensitive because they may describe typical movement behaviors and therefore be used for re-identification of individuals in a database. We provide a privacy-preserving framework for movement data aggregation based on trajectory generalization in a distributed environment. The proposed solution, based on the differential privacy model and on sketching techniques for efficient data compression, provides a formal data protection safeguard. Using real-life data, we demonstrate the effectiveness of our approach also in terms of data utility preserved by the data transformation.
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Hui Wendy Wang</style></author><author><style face="normal" font="default" size="100%">Francesca Pratesi</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Gennady Andrienko</style></author><author><style face="normal" font="default" size="100%">Natalia Andrienko</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Vandenbroucke, Danny</style></author><author><style face="normal" font="default" size="100%">Bucher, Bénédicte</style></author><author><style face="normal" font="default" size="100%">Crompvoets, Joep</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Privacy-Preserving Distributed Movement Data Aggregation</style></title><secondary-title><style face="normal" font="default" size="100%">Geographic Information Science at the Heart of Europe</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Geoinformation and Cartography</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-00615-4_13</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer International Publishing</style></publisher><pages><style face="normal" font="default" size="100%">225-245</style></pages><isbn><style face="normal" font="default" size="100%">978-3-319-00614-7</style></isbn><abstract><style face="normal" font="default" size="100%">We propose a novel approach to privacy-preserving analytical processing within a distributed setting, and tackle the problem of obtaining aggregated information about vehicle traffic in a city from movement data collected by individual vehicles and shipped to a central server. Movement data are sensitive because people’s whereabouts have the potential to reveal intimate personal traits, such as religious or sexual preferences, and may allow re-identification of individuals in a database. We provide a privacy-preserving framework for movement data aggregation based on trajectory generalization in a distributed environment. The proposed solution, based on the differential privacy model and on sketching techniques for efficient data compression, provides a formal data protection safeguard. Using real-life data, we demonstrate the effectiveness of our approach also in terms of data utility preserved by the data transformation.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">L.V.S. Lakshmanan</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Hui Wendy Wang</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Privacy-Preserving Mining of Association Rules From Outsourced Transaction Databases</style></title><secondary-title><style face="normal" font="default" size="100%"> IEEE Systems Journal</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><abstract><style face="normal" font="default" size="100%">Spurred by developments such as cloud computing, there has been considerable recent interest in the paradigm of data mining-as-a-service. A company (data owner) lacking in expertise or computational resources can outsource its mining needs to a third party service provider (server). However, both the items and the association rules of the outsourced database are considered private property of the corporation (data owner). To protect corporate privacy, the data owner transforms its data and ships it to the server, sends mining queries to the server, and recovers the true patterns from the extracted patterns received from the server. In this paper, we study the problem of outsourcing the association rule mining task within a corporate privacy-preserving framework. We propose an attack model based on background knowledge and devise a scheme for privacy preserving outsourced mining. Our scheme ensures that each transformed item is indistinguishable with respect to the attacker's background knowledge, from at least k-1 other transformed items. Our comprehensive experiments on a very large and real transaction database demonstrate that our techniques are effective, scalable, and protect privacy.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fabio Da Costa Albuquerque</style></author><author><style face="normal" font="default" size="100%">Marco A. Casanova</style></author><author><style face="normal" font="default" size="100%">Marcelo Tilio M. de Carvalho</style></author><author><style face="normal" font="default" size="100%">de José Antônio Fernandes Macêdo</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Proactive Ap- plication to Monitor Truck Fleets</style></title><secondary-title><style face="normal" font="default" size="100%">Mobile Data Management Conference, 2013</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Letizia Milli</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fabrizio Sebastiani</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Quantification Trees</style></title><secondary-title><style face="normal" font="default" size="100%">2013 IEEE 13th International Conference on Data Mining, Dallas, TX, USA, December 7-10, 2013</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1109/ICDM.2013.122</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">528–536</style></pages><abstract><style face="normal" font="default" size="100%">In many applications there is a need to monitor how a population is distributed across different classes, and to track the changes in this distribution that derive from varying circumstances, an example such application is monitoring the percentage (or &quot;prevalence&quot;) of unemployed people in a given region, or in a given age range, or at different time periods. When the membership of an individual in a class cannot be established deterministically, this monitoring activity requires classification. However, in the above applications the final goal is not determining which class each individual belongs to, but simply estimating the prevalence of each class in the unlabeled data. This task is called quantification. In a supervised learning framework we may estimate the distribution across the classes in a test set from a training set of labeled individuals. However, this may be sub optimal, since the distribution in the test set may be substantially different from that in the training set (a phenomenon called distribution drift). So far, quantification has mostly been addressed by learning a classifier optimized for individual classification and later adjusting the distribution it computes to compensate for its tendency to either under-or over-estimate the prevalence of the class. In this paper we propose instead to use a type of decision trees (quantification trees) optimized not for individual classification, but directly for quantification. Our experiments show that quantification trees are more accurate than existing state-of-the-art quantification methods, while retaining at the same time the simplicity and understandability of the decision tree framework.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Christine Parent</style></author><author><style face="normal" font="default" size="100%">Stefano Spaccapietra</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Gennady Andrienko</style></author><author><style face="normal" font="default" size="100%">Natalia Andrienko</style></author><author><style face="normal" font="default" size="100%">Vania Bogorny</style></author><author><style face="normal" font="default" size="100%">Damiani M L,</style></author><author><style face="normal" font="default" size="100%">Gkoulalas-Divanis A,</style></author><author><style face="normal" font="default" size="100%">de José Antônio Fernandes Macêdo</style></author><author><style face="normal" font="default" size="100%">Nikos Pelekis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Semantic Trajectories Modeling and Analysis</style></title><secondary-title><style face="normal" font="default" size="100%">ACM Computing Surveys</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">August 2013</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">45</style></volume></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Vittoria Cozza</style></author><author><style face="normal" font="default" size="100%">Antonio Messina</style></author><author><style face="normal" font="default" size="100%">Danilo Montesi</style></author><author><style face="normal" font="default" size="100%">Luca Arietta</style></author><author><style face="normal" font="default" size="100%">Matteo Magnani</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Spatio temporal keyword-queries in Social Networs</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Igo Brilhante</style></author><author><style face="normal" font="default" size="100%">Franco Maria Nardini</style></author><author><style face="normal" font="default" size="100%">Raffaele Perego</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">de José Antônio Fernandes Macêdo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Where Shall We Go Today? Planning Touristic Tours with TripBuilder</style></title><secondary-title><style face="normal" font="default" size="100%">International Conference CIKM 2013</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><pub-location><style face="normal" font="default" size="100%">San Francisco, USA</style></pub-location></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Tom Bellemans</style></author><author><style face="normal" font="default" size="100%">Sebastian Bothe</style></author><author><style face="normal" font="default" size="100%">Sungjin Cho</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Davy Janssens</style></author><author><style face="normal" font="default" size="100%">Luk Knapen</style></author><author><style face="normal" font="default" size="100%">Christine Körner</style></author><author><style face="normal" font="default" size="100%">Michael May</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Hendrik Stange</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author><author><style face="normal" font="default" size="100%">Ansar-Ul-Haque Yasar</style></author><author><style face="normal" font="default" size="100%">Geert Wets</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An Agent-Based Model to Evaluate Carpooling at Large Manufacturing Plants</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 3rd International Conference on Ambient Systems, Networks and Technologies {(ANT} 2012), the 9th International Conference on Mobile Web Information Systems (MobiWIS-2012), Niagara Falls, Ontario, Canada, August 27-29, 2012</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1016/j.procs.2012.08.001</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">S Mascetti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">A Ricci</style></author><author><style face="normal" font="default" size="100%">A. Gerino</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Anonymity: a Comparison between the Legal and Computer Science Perspectives.</style></title><secondary-title><style face="normal" font="default" size="100%">The 5rd International Conference on Computers, Privacy, and Data Protection: “European Data Protection: Coming of Age”</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2012</style></date></pub-dates></dates><abstract><style face="normal" font="default" size="100%">Privacy preservation has emerged as a major challenge in ICT. One possible solution for enforcing privacy is to guarantee anonymity. Indeed, according to international regulations, no restriction is applied to the handling of anonymous data. Consequently, in the past years the notion of anonymity has been extensively studied by two different communities: Law researchers and professionals that propose definitions of privacy regulations, and Computer Scientists attempting to provide technical solutions for enforcing the legal requirements.

In this contribution we address the problem with an interdisciplinary approach, in the aim to encourage the reciprocal understanding and collaboration between researchers in the two areas. To achieve this, we compare the different notions of anonymity provided in the European data protection Law with the formal models proposed in Computer Science. This analysis allows us to identify the main similarities and differences between the two points of view, hence highlighting the need for a joint research effort.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">R.Liu</style></author><author><style face="normal" font="default" size="100%">Hui Wendy Wang</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">W Guo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">AUDIO: An Integrity Auditing Framework of Outlier-Mining-as-a-Service Systems.</style></title><secondary-title><style face="normal" font="default" size="100%">Machine Learning and Knowledge Discovery in Databases, European Conference, ECML PKDD 2012 </style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2012</style></date></pub-dates></dates><abstract><style face="normal" font="default" size="100%">Spurred by developments such as cloud computing, there has been considerable recent interest in the data-mining-as-a-service paradigm. Users lacking in expertise or computational resources can outsource their data and mining needs to a third-party service provider (server). Outsourcing, however, raises issues about result integrity: how can the data owner verify that the mining results returned by the server are correct? In this paper, we present AUDIO, an integrity auditing framework for the specific task of distance-based outlier mining outsourcing. It provides efficient and practical verification approaches to check both completeness and correctness of the mining results. The key idea of our approach is to insert a small amount of artificial tuples into the outsourced data; the artificial tuples will produce artificial outliers and non-outliers that do not exist in the original dataset. The server’s answer is verified by analyzing the presence of artificial outliers/non-outliers, obtaining a probabilistic guarantee of correctness and completeness of the mining result. Our empirical results show the effectiveness and efficiency of our method.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giacomo Bachi</style></author><author><style face="normal" font="default" size="100%">Michele Coscia</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Classifying Trust/Distrust Relationships in Online Social Networks</style></title><secondary-title><style face="normal" font="default" size="100%">2012 International Conference on Privacy, Security, Risk and Trust, {PASSAT} 2012, and 2012 International Confernece on Social Computing, SocialCom 2012, Amsterdam, Netherlands, September 3-5, 2012</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1109/SocialCom-PASSAT.2012.115</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">552–557</style></pages><abstract><style face="normal" font="default" size="100%">Online social networks are increasingly being used as places where communities gather to exchange information, form opinions, collaborate in response to events. An aspect of this information exchange is how to determine if a source of social information can be trusted or not. Data mining literature addresses this problem. However, if usually employs social balance theories, by looking at small structures in complex networks known as triangles. This has proven effective in some cases, but it under performs in the lack of context information about the relation and in more complex interactive structures. In this paper we address the problem of creating a framework for the trust inference, able to infer the trust/distrust relationships in those relational environments that cannot be described by using the classical social balance theory. We do so by decomposing a trust network in its ego network components and mining on this ego network set the trust relationships, extending a well known graph mining algorithm. We test our framework on three public datasets describing trust relationships in the real world (from the social media Epinions, Slash dot and Wikipedia) and confronting our results with the trust inference state of the art, showing better performances where the social balance theory fails.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Igo Brilhante</style></author><author><style face="normal" font="default" size="100%">Michele Berlingerio</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">de José Antônio Fernandes Macêdo</style></author><author><style face="normal" font="default" size="100%">Marco A. Casanova</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">ComeTogether: Discovering Communities of Places in Mobility Data</style></title><secondary-title><style face="normal" font="default" size="100%">MDM 2012</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2012</style></date></pub-dates></dates><pages><style face="normal" font="default" size="100%"> 268-273</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author><author><style face="normal" font="default" size="100%">Simone Mainardi</style></author><author><style face="normal" font="default" size="100%">Fabio Pezzoni</style></author><author><style face="normal" font="default" size="100%">Michele Coscia</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Discovering the Geographical Borders of Human Mobility</style></title><secondary-title><style face="normal" font="default" size="100%">KI - Künstliche Intelligenz</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/article/10.1007%2Fs13218-012-0181-8</style></url></web-urls></urls><abstract><style face="normal" font="default" size="100%">The availability of massive network and mobility data from diverse domains has fostered the analysis of human behavior and interactions. Broad, extensive, and multidisciplinary research has been devoted to the extraction of non-trivial knowledge from this novel form of data. We propose a general method to determine the influence of social and mobility behavior over a specific geographical area in order to evaluate to what extent the current administrative borders represent the real basin of human movement. We build a network representation of human movement starting with vehicle GPS tracks and extract relevant clusters, which are then mapped back onto the territory, finding a good match with the existing administrative borders. The novelty of our approach is the focus on a detailed spatial resolution, we map emerging borders in terms of individual municipalities, rather than macro regional or national areas. We present a series of experiments to illustrate and evaluate the effectiveness of our approach.</style></abstract><section><style face="normal" font="default" size="100%">1</style></section></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sara Hajian</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Josep Domingo-Ferrer</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Injecting Discrimination and Privacy Awareness Into Pattern Discovery</style></title><secondary-title><style face="normal" font="default" size="100%">12th {IEEE} International Conference on Data Mining Workshops, {ICDM} Workshops, Brussels, Belgium, December 10, 2012</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1109/ICDMW.2012.51</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">360–369</style></pages><abstract><style face="normal" font="default" size="100%">Data mining is gaining societal momentum due to the ever increasing availability of large amounts of human data, easily collected by a variety of sensing technologies. Data mining comes with unprecedented opportunities and risks: a deeper understanding of human behavior and how our society works is darkened by a greater chance of privacy intrusion and unfair discrimination based on the extracted patterns and profiles. Although methods independently addressing privacy or discrimination in data mining have been proposed in the literature, in this context we argue that privacy and discrimination risks should be tackled together, and we present a methodology for doing so while publishing frequent pattern mining results. We describe a combined pattern sanitization framework that yields both privacy and discrimination-protected patterns, while introducing reasonable (controlled) pattern distortion.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michele Berlingerio</style></author><author><style face="normal" font="default" size="100%">Michele Coscia</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Multidimensional networks: foundations of structural analysis</style></title><secondary-title><style face="normal" font="default" size="100%">World Wide Web</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">10/2012</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.springerlink.com/content/f774289854430410/abstract/</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%"> Volume 15 / 2012</style></volume><abstract><style face="normal" font="default" size="100%">Complex networks have been receiving increasing attention by the scientific community, thanks also to the increasing availability of real-world network data. So far, network analysis has focused on the characterization and measurement of local and global properties of graphs, such as diameter, degree distribution, centrality, and so on. In the last years, the multidimensional nature of many real world networks has been pointed out, i.e. many networks containing multiple connections between any pair of nodes have been analyzed. Despite the importance of analyzing this kind of networks was recognized by previous works, a complete framework for multidimensional network analysis is still missing. Such a framework would enable the analysts to study different phenomena, that can be either the generalization to the multidimensional setting of what happens in monodimensional networks, or a new class of phenomena induced by the additional degree of complexity that multidimensionality provides in real networks. The aim of this paper is then to give the basis for multidimensional network analysis: we present a solid repertoire of basic concepts and analytical measures, which take into account the general structure of multidimensional networks. We tested our framework on different real world multidimensional networks, showing the validity and the meaningfulness of the measures introduced, that are able to extract important and non-random information about complex phenomena in such networks. </style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Daniel Marbach</style></author><author><style face="normal" font="default" size="100%">J.C. Costello</style></author><author><style face="normal" font="default" size="100%">Robert Küffner</style></author><author><style face="normal" font="default" size="100%">N.M. Vega</style></author><author><style face="normal" font="default" size="100%">R.J. Prill</style></author><author><style face="normal" font="default" size="100%">D.M. Camacho</style></author><author><style face="normal" font="default" size="100%">K.R. Allison</style></author><author><style face="normal" font="default" size="100%">Manolis Kellis</style></author><author><style face="normal" font="default" size="100%">J.J. Collins</style></author><author><style face="normal" font="default" size="100%">Aderhold, A.</style></author><author><style face="normal" font="default" size="100%">Gustavo Stolovitzky</style></author><author><style face="normal" font="default" size="100%">Bonneau, R.</style></author><author><style face="normal" font="default" size="100%">Chen, Y.</style></author><author><style face="normal" font="default" size="100%">Cordero, F.</style></author><author><style face="normal" font="default" size="100%">Martin Crane</style></author><author><style face="normal" font="default" size="100%">Dondelinger, F.</style></author><author><style face="normal" font="default" size="100%">Drton, M.</style></author><author><style face="normal" font="default" size="100%">Esposito, R.</style></author><author><style face="normal" font="default" size="100%">Foygel, R.</style></author><author><style face="normal" font="default" size="100%">De La Fuente, A.</style></author><author><style face="normal" font="default" size="100%">Gertheiss, J.</style></author><author><style face="normal" font="default" size="100%">Geurts, P.</style></author><author><style face="normal" font="default" size="100%">Greenfield, A.</style></author><author><style face="normal" font="default" size="100%">Grzegorczyk, M.</style></author><author><style face="normal" font="default" size="100%">Haury, A.-C.</style></author><author><style face="normal" font="default" size="100%">Holmes, B.</style></author><author><style face="normal" font="default" size="100%">Hothorn, T.</style></author><author><style face="normal" font="default" size="100%">Husmeier, D.</style></author><author><style face="normal" font="default" size="100%">Huynh-Thu, V.A.</style></author><author><style face="normal" font="default" size="100%">Irrthum, A.</style></author><author><style face="normal" font="default" size="100%">Karlebach, G.</style></author><author><style face="normal" font="default" size="100%">Lebre, S.</style></author><author><style face="normal" font="default" size="100%">De Leo, V.</style></author><author><style face="normal" font="default" size="100%">Madar, A.</style></author><author><style face="normal" font="default" size="100%">Mani, S.</style></author><author><style face="normal" font="default" size="100%">Mordelet, F.</style></author><author><style face="normal" font="default" size="100%">Ostrer, H.</style></author><author><style face="normal" font="default" size="100%">Ouyang, Z.</style></author><author><style face="normal" font="default" size="100%">Pandya, R.</style></author><author><style face="normal" font="default" size="100%">Petri, T.</style></author><author><style face="normal" font="default" size="100%">Pinna, A.</style></author><author><style face="normal" font="default" size="100%">Poultney, C.S.</style></author><author><style face="normal" font="default" size="100%">Rezny, S.</style></author><author><style face="normal" font="default" size="100%">Heather J Ruskin</style></author><author><style face="normal" font="default" size="100%">Saeys, Y.</style></author><author><style face="normal" font="default" size="100%">Shamir, R.</style></author><author><style face="normal" font="default" size="100%">Alina Sirbu</style></author><author><style face="normal" font="default" size="100%">Song, M.</style></author><author><style face="normal" font="default" size="100%">Soranzo, N.</style></author><author><style face="normal" font="default" size="100%">Statnikov, A.</style></author><author><style face="normal" font="default" size="100%">N.M. Vega</style></author><author><style face="normal" font="default" size="100%">Vera-Licona, P.</style></author><author><style face="normal" font="default" size="100%">Vert, J.-P.</style></author><author><style face="normal" font="default" size="100%">Visconti, A.</style></author><author><style face="normal" font="default" size="100%">Haizhou Wang</style></author><author><style face="normal" font="default" size="100%">Wehenkel, L.</style></author><author><style face="normal" font="default" size="100%">Windhager, L.</style></author><author><style face="normal" font="default" size="100%">Zhang, Y.</style></author><author><style face="normal" font="default" size="100%">Zimmer, R.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Wisdom of crowds for robust gene network inference</style></title><secondary-title><style face="normal" font="default" size="100%">Nature Methods</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.scopus.com/inward/record.url?eid=2-s2.0-84870305264&amp;partnerID=40&amp;md5=04a686572bdefff60157bf68c95df7ea</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">8</style></number><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">796-804</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Daniel Marbach</style></author><author><style face="normal" font="default" size="100%">J.C. Costello</style></author><author><style face="normal" font="default" size="100%">Robert Küffner</style></author><author><style face="normal" font="default" size="100%">N.M. Vega</style></author><author><style face="normal" font="default" size="100%">R.J. Prill</style></author><author><style face="normal" font="default" size="100%">D.M. Camacho</style></author><author><style face="normal" font="default" size="100%">K.R. Allison</style></author><author><style face="normal" font="default" size="100%">Manolis Kellis</style></author><author><style face="normal" font="default" size="100%">J.J. Collins</style></author><author><style face="normal" font="default" size="100%">Gustavo Stolovitzky</style></author></authors><translated-authors><author><style face="normal" font="default" size="100%">DREAM5 Consortium</style></author></translated-authors></contributors><titles><title><style face="normal" font="default" size="100%">Wisdom of crowds for robust gene network inference.</style></title><secondary-title><style face="normal" font="default" size="100%">Nat Methods</style></secondary-title><alt-title><style face="normal" font="default" size="100%">Nat. Methods</style></alt-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2012 Aug</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">796-804</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Reconstructing gene regulatory networks from high-throughput data is a long-standing challenge. Through the Dialogue on Reverse Engineering Assessment and Methods (DREAM) project, we performed a comprehensive blind assessment of over 30 network inference methods on Escherichia coli, Staphylococcus aureus, Saccharomyces cerevisiae and in silico microarray data. We characterize the performance, data requirements and inherent biases of different inference approaches, and we provide guidelines for algorithm application and development. We observed that no single inference method performs optimally across all data sets. In contrast, integration of predictions from multiple inference methods shows robust and high performance across diverse data sets. We thereby constructed high-confidence networks for E. coli and S. aureus, each comprising ~1,700 transcriptional interactions at a precision of ~50%. We experimentally tested 53 previously unobserved regulatory interactions in E. coli, of which 23 (43%) were supported. Our results establish community-based methods as a powerful and robust tool for the inference of transcriptional gene regulatory networks.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Vania Bogorny</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">C-safety: a framework for the anonymization of semantic trajectories</style></title><secondary-title><style face="normal" font="default" size="100%">Transactions on Data Privacy</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dl.acm.org/citation.cfm?id=2019319&amp;CFID=803961971&amp;CFTOKEN=35994039</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">4</style></volume><pages><style face="normal" font="default" size="100%">73-101</style></pages><abstract><style face="normal" font="default" size="100%">The increasing abundance of data about the trajectories of personal movement is opening
new opportunities for analyzing and mining human mobility. However, new risks emerge since it
opens new ways of intruding into personal privacy. Representing the personal movements as sequences
of places visited by a person during her/his movements - semantic trajectory - poses great
privacy threats. In this paper we propose a privacy model defining the attack model of semantic trajectory
linking and a privacy notion, called c-safety based on a generalization of visited places based
on a taxonomy. This method provides an upper bound to the probability of inferring that a given
person, observed in a sequence of non-sensitive places, has also visited any sensitive location. Coherently
with the privacy model, we propose an algorithm for transforming any dataset of semantic
trajectories into a c-safe one. We report a study on two real-life GPS trajectory datasets to show how
our algorithm preserves interesting quality/utility measures of the original trajectories, when mining
semantic trajectories sequential pattern mining results. We also empirically measure how the
probability that the attacker’s inference succeeds is much lower than the theoretical upper bound
established.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michele Berlingerio</style></author><author><style face="normal" font="default" size="100%">Michele Coscia</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Foundations of Multidimensional Network Analysis</style></title><secondary-title><style face="normal" font="default" size="100%">ASONAM</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><pages><style face="normal" font="default" size="100%">485-489</style></pages><abstract><style face="normal" font="default" size="100%">Complex networks have been receiving increasing attention by the scientific community, thanks also to the increasing availability of real-world network data. In the last years, the multidimensional nature of many real world networks has been pointed out, i.e. many networks containing multiple connections between any pair of nodes have been analyzed. Despite the importance of analyzing this kind of networks was recognized by previous works, a complete framework for multidimensional network analysis is still missing. Such a framework would enable the analysts to study different phenomena, that can be either the generalization to the multidimensional setting of what happens inmonodimensional network, or a new class of phenomena induced by the additional degree of complexity that multidimensionality provides in real networks. The aim of this paper is then to give the basis for multidimensional network analysis: we develop a solid repertoire of basic concepts and analytical measures, which takes into account the general structure of multidimensional networks. We tested our framework on a real world multidimensional network, showing the validity and the meaningfulness of the measures introduced, that are able to extract important, nonrandom, information about complex phenomena.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Leone, Laura</style></author><author><style face="normal" font="default" size="100%">Marchitiello, Maria</style></author><author><style face="normal" font="default" size="100%">Michela Natilli</style></author><author><style face="normal" font="default" size="100%">Romano, Maria Francesca</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Measuring the effectiveness of homeopathic care through objective and shared indicators</style></title><secondary-title><style face="normal" font="default" size="100%">Homeopathy</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><number><style face="normal" font="default" size="100%">04</style></number><volume><style face="normal" font="default" size="100%">100</style></volume><pages><style face="normal" font="default" size="100%">212–219</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">L.V.S. Lakshmanan</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Hui Wendy Wang</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Privacy-preserving data mining from outsourced databases.</style></title><secondary-title><style face="normal" font="default" size="100%"> the 3rd International Conference on Computers, Privacy, and Data Protection: An element of choice </style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2011</style></date></pub-dates></dates><abstract><style face="normal" font="default" size="100%">Spurred by developments such as cloud computing, there has been considerable recent interest in the paradigm of data mining-as-service: a company (data owner) lacking in expertise or computational resources can outsource its mining needs to a third party service provider (server). However, both the outsourced database and the knowledge extract from it by data mining are considered private property of the data owner. To protect corporate privacy, the data owner transforms its data and ships it to the server, sends mining queries to the server, and recovers the true patterns from the extracted patterns received from the server. In this paper, we study the problem of outsourcing a data mining task within a corporate privacy-preserving framework. We propose a scheme for privacy-preserving outsourced mining which offers a formal protection against information disclosure, and show that the data owner can recover the correct data mining results efficiently.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michele Berlingerio</style></author><author><style face="normal" font="default" size="100%">Michele Coscia</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The pursuit of hubbiness: Analysis of hubs in large multidimensional networks</style></title><secondary-title><style face="normal" font="default" size="100%">J. Comput. Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">2</style></volume><pages><style face="normal" font="default" size="100%">223-237</style></pages><abstract><style face="normal" font="default" size="100%">Hubs are highly connected nodes within a network. In complex network analysis, hubs have been widely studied, and are at the basis of many tasks, such as web search and epidemic outbreak detection. In reality, networks are often multidimensional, i.e., there can exist multiple connections between any pair of nodes. In this setting, the concept of hub depends on the multiple dimensions of the network, whose interplay becomes crucial for the connectedness of a node. In this paper, we characterize multidimensional hubs. We consider the multidimensional generalization of the degree and introduce a new class of measures, that we call Dimension Relevance, aimed at analyzing the importance of different dimensions for the hubbiness of a node. We assess the meaningfulness of our measures by comparing them on real networks and null models, then we study the interplay among dimensions and their effect on node connectivity. Our findings show that: (i) multidimensional hubs do exist and their characterization yields interesting insights and (ii) it is possible to detect the most influential dimensions that cause the different hub behaviors. We demonstrate the usefulness of multidimensional analysis in three real world domains: detection of ambiguous query terms in a word–word query log network, outlier detection in a social network, and temporal analysis of behaviors in a co-authorship network.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michele Berlingerio</style></author><author><style face="normal" font="default" size="100%">Michele Coscia</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">As Time Goes by: Discovering Eras in Evolving Social Networks</style></title><secondary-title><style face="normal" font="default" size="100%">PAKDD (1)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><pages><style face="normal" font="default" size="100%">81-90</style></pages><abstract><style face="normal" font="default" size="100%">Within the large body of research in complex network analysis, an important topic is the temporal evolution of networks. Existing approaches aim at analyzing the evolution on the global and the local scale, extracting properties of either the entire network or local patterns. In this paper, we focus instead on detecting clusters of temporal snapshots of a network, to be interpreted as eras of evolution. To this aim, we introduce a novel hierarchical clustering methodology, based on a dissimilarity measure (derived from the Jaccard coefficient) between two temporal snapshots of the network. We devise a framework to discover and browse the eras, either in top-down or a bottom-up fashion, supporting the exploration of the evolution at any level of temporal resolution. We show how our approach applies to real networks, by detecting eras in an evolving co-authorship graph extracted from a bibliographic dataset; we illustrate how the discovered temporal clustering highlights the crucial moments when the network had profound changes in its structure. Our approach is finally boosted by introducing a meaningful labeling of the obtained clusters, such as the characterizing topics of each discovered era, thus adding a semantic dimension to our analysis.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michele Berlingerio</style></author><author><style face="normal" font="default" size="100%">Michele Coscia</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Discovering Eras in Evolving Social Networks (Extended Abstract)</style></title><secondary-title><style face="normal" font="default" size="100%">SEBD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><pages><style face="normal" font="default" size="100%">78-85</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author><author><style face="normal" font="default" size="100%">Fabio Pinelli</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Exploring Real Mobility Data with M-Atlas</style></title><secondary-title><style face="normal" font="default" size="100%">ECML/PKDD (3)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><pages><style face="normal" font="default" size="100%">624-627</style></pages><abstract><style face="normal" font="default" size="100%">Research on moving-object data analysis has been recently fostered by the widespread diffusion of new techniques and systems for monitoring, collecting and storing location aware data, generated by a wealth of technological infrastructures, such as GPS positioning and wireless networks. These have made available massive repositories of spatio-temporal data recording human mobile activities, that call for suitable analytical methods, capable of enabling the development of innovative, location-aware applications.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gennady Andrienko</style></author><author><style face="normal" font="default" size="100%">Natalia Andrienko</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Generalisation-based Approach to Anonymising Movement Data</style></title><secondary-title><style face="normal" font="default" size="100%">13th AGILE conference on Geographic Information Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://agile2010.dsi.uminho.pt/pen/ShortPapers_PDF%5C122_DOC.pdf</style></url></web-urls></urls><abstract><style face="normal" font="default" size="100%">The possibility to collect, store, disseminate, and analyze data about movements of people raises
very serious privacy concerns, given the sensitivity of the information about personal positions. In
particular, sensitive information about individuals can be uncovered with the use of data mining and
visual analytics methods. In this paper we present a method for the generalization of trajectory data
that can be adopted as the first step of a process to obtain k-anonymity in spatio-temporal datasets.
We ran a preliminary set of experiments on a real-world trajectory dataset, demonstrating that this
method of generalization of trajectories preserves the clustering analysis results. </style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Fabio Pinelli</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Location Prediction through Trajectory Pattern Mining (Extended Abstract)</style></title><secondary-title><style face="normal" font="default" size="100%">SEBD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><pages><style face="normal" font="default" size="100%">134-141</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Gennady Andrienko</style></author><author><style face="normal" font="default" size="100%">Natalia Andrienko</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author><author><style face="normal" font="default" size="100%">Stefan Wrobel</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Movement Data Anonymity through Generalization</style></title><secondary-title><style face="normal" font="default" size="100%">Transactions on Data Privacy</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.tdp.cat/issues/abs.a045a10.php</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">3</style></volume><pages><style face="normal" font="default" size="100%">91–121</style></pages><abstract><style face="normal" font="default" size="100%">Wireless networks and mobile devices, such as mobile phones and GPS receivers, sense
and track the movements of people and vehicles, producing society-wide mobility databases. This is
a challenging scenario for data analysis and mining. On the one hand, exciting opportunities arise out
of discovering new knowledge about human mobile behavior, and thus fuel intelligent info-mobility
applications. On other hand, new privacy concerns arise when mobility data are published. The
risk is particularly high for GPS trajectories, which represent movement of a very high precision and
spatio-temporal resolution: the de-identification of such trajectories (i.e., forgetting the ID of their
associated owners) is only a weak protection, as generally it is possible to re-identify a person by observing
her routine movements. In this paper we propose a method for achieving true anonymity in
a dataset of published trajectories, by defining a transformation of the original GPS trajectories based
on spatial generalization and k-anonymity. The proposed method offers a formal data protection
safeguard, quantified as a theoretical upper bound to the probability of re-identification. We conduct
a thorough study on a real-life GPS trajectory dataset, and provide strong empirical evidence that
the proposed anonymity techniques achieve the conflicting goals of data utility and data privacy. In
practice, the achieved anonymity protection is much stronger than the theoretical worst case, while
the quality of the cluster analysis on the trajectory data is preserved.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Vania Bogorny</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Preserving privacy in semantic-rich trajectories of human mobility</style></title><secondary-title><style face="normal" font="default" size="100%">SPRINGL</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><pages><style face="normal" font="default" size="100%">47-54</style></pages><abstract><style face="normal" font="default" size="100%">The increasing abundance of data about the trajectories of personal movement is opening up new opportunities for analyzing and mining human mobility, but new risks emerge since it opens new ways of intruding into personal privacy. Representing the personal movements as sequences of places visited by a person during her/his movements - semantic trajectory - poses even greater privacy threats w.r.t. raw geometric location data. In this paper we propose a privacy model defining the attack model of semantic trajectory linking, together with a privacy notion, called c-safety. This method provides an upper bound to the probability of inferring that a given person, observed in a sequence of nonsensitive places, has also stopped in any sensitive location. Coherently with the privacy model, we propose an algorithm for transforming any dataset of semantic trajectories into a c-safe one. We report a study on a real-life GPS trajectory dataset to show how our algorithm preserves interesting quality/utility measures of the original trajectories, such as sequential pattern mining results.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Slava Kisilevich</style></author><author><style face="normal" font="default" size="100%">Florian Mansmann</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Spatio-temporal clustering</style></title><secondary-title><style face="normal" font="default" size="100%">Data Mining and Knowledge Discovery Handbook</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><pages><style face="normal" font="default" size="100%">855-874</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michele Berlingerio</style></author><author><style face="normal" font="default" size="100%">Michele Coscia</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Towards Discovery of Eras in Social Networks</style></title><secondary-title><style face="normal" font="default" size="100%">M3SN 2010 Workshop, in conjunction with ICDE2010</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><abstract><style face="normal" font="default" size="100%">In the last decades, much research has been devoted in topics related to Social Network Analysis. One important direction in this area is to analyze the temporal evolution of a network. So far, previous approaches analyzed this setting at both the global and the local level. In this paper, we focus on finding a way to detect temporal eras in an evolving network. We pose the basis for a general framework that aims at helping the analyst in browsing the temporal clusters both in a top-down and bottom-up way, exploring the network at any level of temporal details. We show the effectiveness of our approach on real data, by applying our proposed methodology to a co-authorship network extracted from a bibliographic dataset. Our first results are encouraging, and open the way for the definition and implementation of a general framework for discovering eras in evolving social networks.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ruggero G. Pensa</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Fabio Pinelli</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Anonymous Sequences from Trajectory Data</style></title><secondary-title><style face="normal" font="default" size="100%">17th Italian Symposium on Advanced Database Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><edition><style face="normal" font="default" size="100%">17</style></edition><pub-location><style face="normal" font="default" size="100%">Camogli, Italy</style></pub-location></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gennady Andrienko</style></author><author><style face="normal" font="default" size="100%">Natalia Andrienko</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Movement data anonymity through generalization</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 2nd SIGSPATIAL ACM GIS 2009 International Workshop on Security and Privacy in GIS and LBS</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In recent years, spatio-temporal and moving objects databases have gained considerable interest, due to the diffusion of mobile devices (e.g., mobile phones, RFID devices and GPS devices) and of new applications, where the discovery of consumable, concise, and applicable knowledge is the key step. Clearly, in these applications privacy is a concern, since models extracted from this kind of data can reveal the behavior of group of individuals, thus compromising their privacy. Movement data present a new challenge for the privacy-preserving data mining community because of their spatial and temporal characteristics.

In this position paper we briefly present an approach for the generalization of movement data that can be adopted for obtaining k-anonymity in spatio-temporal datasets; specifically, it can be used to realize a framework for publishing of spatio-temporal data while preserving privacy. We ran a preliminary set of experiments on a real-world trajectory dataset, demonstrating that this method of generalization of trajectories preserves the clustering analysis results.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Monica Wachowicz</style></author><author><style face="normal" font="default" size="100%">de José Antônio Fernandes Macêdo</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Arend Ligtenberg</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">{The Role of a Multi-tier Ontological Framework in Reasoning to Discover Meaningful Patterns of Sustainable Mobility}</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">{Geographic Data Mining and Knowledge Discovery, 2nd Edition, to appear}</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Miriam Baglioni</style></author><author><style face="normal" font="default" size="100%">de José Antônio Fernandes Macêdo</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author><author><style face="normal" font="default" size="100%">Monica Wachowicz</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Towards Semantic Interpretation of Movement Behavior</style></title><secondary-title><style face="normal" font="default" size="100%">AGILE Conf.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><pages><style face="normal" font="default" size="100%">271-288</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Miriam Baglioni</style></author><author><style face="normal" font="default" size="100%">de José Antônio Fernandes Macêdo</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author><author><style face="normal" font="default" size="100%">Monica Wachowicz</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Towards Semantic Interpretation of Movement Behavior</style></title><secondary-title><style face="normal" font="default" size="100%">AGILE Conf.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><pages><style face="normal" font="default" size="100%">271-288</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Fabio Pinelli</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">WhereNext: a Location Predictor on Trajectory Pattern Mining</style></title><secondary-title><style face="normal" font="default" size="100%">15th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><abstract><style face="normal" font="default" size="100%">The pervasiveness of mobile devices and location based services is leading to an increasing volume of mobility data.This side eect provides the opportunity for innovative methods that analyse the behaviors of movements. In this paper we propose WhereNext, which is a method aimed at predicting with a certain level of accuracy the next location of a moving object. The prediction uses previously extracted movement patterns named Trajectory Patterns, which are a concise representation of behaviors of moving objects as sequences of regions frequently visited with a typical travel time. A decision tree, named T-pattern Tree, is built and evaluated with a formal training and test process. The tree is learned from the Trajectory Patterns that hold a certain area and it may be used as a predictor of the next location of a new trajectory finding the best matching path in the tree. Three dierent best matching methods to classify a new moving object are proposed and their impact on the quality of prediction is studied extensively. Using Trajectory Patterns as predictive rules has the following implications: (I) the learning depends on the movement of all available objects in a certain area instead of on the individual history of an object; (II) the prediction tree intrinsically contains the spatio-temporal properties that have emerged from the data and this allows us to define matching methods that striclty depend on the properties of such movements. In addition, we propose a set of other measures, that evaluate a priori the predictive power of a set of Trajectory Patterns. This measures were tuned on a real life case study. Finally, an exhaustive set of experiments and results on the real dataset are presented.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alessandra Raffaetà</style></author><author><style face="normal" font="default" size="100%">T. Ceccarelli</style></author><author><style face="normal" font="default" size="100%">D. Centeno</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">A. Massolo</style></author><author><style face="normal" font="default" size="100%">Christine Parent</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Stefano Spaccapietra</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An Application of Advanced Spatio-Temporal Formalisms to Behavioural Ecology</style></title><secondary-title><style face="normal" font="default" size="100%">GeoInformatica</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">12</style></volume><pages><style face="normal" font="default" size="100%">37-72</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">T. Ceccarelli</style></author><author><style face="normal" font="default" size="100%">D. Centeno</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">A. Massolo</style></author><author><style face="normal" font="default" size="100%">Christine Parent</style></author><author><style face="normal" font="default" size="100%">Alessandra Raffaetà</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Stefano Spaccapietra</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An Application of Advanced Spatio-Temporal Formalisms to Behavioural Ecology</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">Geoinformatica, Volume 12, Number 1 / March,</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Andrea Zanda</style></author><author><style face="normal" font="default" size="100%">Christine Körner</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Daniel Schulz</style></author><author><style face="normal" font="default" size="100%">Michael May</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Clustering of German municipalities based on mobility characteristics: an overview of results</style></title><secondary-title><style face="normal" font="default" size="100%">GIS</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><pages><style face="normal" font="default" size="100%">69</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Riccardo Ortale</style></author><author><style face="normal" font="default" size="100%">E Ritacco</style></author><author><style face="normal" font="default" size="100%">N. Pelekisy</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author><author><style face="normal" font="default" size="100%">Gianni Costa</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Yannis Theodoridis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">DAEDALUS: A knowledge discovery analysis framework for movement data</style></title><secondary-title><style face="normal" font="default" size="100%">SEBD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><pages><style face="normal" font="default" size="100%">191-198</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Riccardo Ortale</style></author><author><style face="normal" font="default" size="100%">E Ritacco</style></author><author><style face="normal" font="default" size="100%">Nikos Pelekis</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author><author><style face="normal" font="default" size="100%">Gianni Costa</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Yannis Theodoridis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The DAEDALUS framework: progressive querying and mining of movement data</style></title><secondary-title><style face="normal" font="default" size="100%">GIS</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><pages><style face="normal" font="default" size="100%">52</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Barbara Furletti</style></author><author><style face="normal" font="default" size="100%">Francesco Fornasari</style></author><author><style face="normal" font="default" size="100%">Claudio Montanari</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">AN EXTENSIBLE AND INTERACTIVE SOFTWARE AGENT FOR MOBILE DEVICES BASED ON GPS DATA</style></title><secondary-title><style face="normal" font="default" size="100%">IADIS International Conference Applied Computing</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2008</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.iadisportal.org/digital-library/mdownload/an-extensible-and-interactive-software-agent-for-mobile-devices-based-on-gps-data</style></url></web-urls></urls><isbn><style face="normal" font="default" size="100%">978-972-8924-56-0</style></isbn></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">S Rinzivillo</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author><author><style face="normal" font="default" size="100%">Vania Bogorny</style></author><author><style face="normal" font="default" size="100%">Christine Körner</style></author><author><style face="normal" font="default" size="100%">Bart Kuijpers</style></author><author><style face="normal" font="default" size="100%">Michael May</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Knowledge Discovery from Geographical Data</style></title><secondary-title><style face="normal" font="default" size="100%">Mobility, Data Mining and Privacy</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><pages><style face="normal" font="default" size="100%">243-265</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fabio Pinelli</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Location prediction within the mobility data analysis environment Daedalus</style></title><secondary-title><style face="normal" font="default" size="100%">First International Workshop on Computational Transportation Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><pub-location><style face="normal" font="default" size="100%">Dublin, Ireland</style></pub-location><abstract><style face="normal" font="default" size="100%">In this paper we propose a method to predict the next location of a moving object based on two recent results in GeoPKDD project: DAEDALUS, a mobility data analysis environment and Trajectory Pattern, a sequential pattern mining algorithm with temporal annotation integrated in DAEDALUS. The first one is a DMQL environment for moving objects, where both data and patterns can be represented. The second one extracts movement patterns as sequences of movements between locations with typical travel times.

This paper proposes a prediction method which uses the local models extracted by Trajectory Pattern to build a global model called Prediction Tree. The future location of a moving object is predicted visiting the tree and calculating the best matching function.

The integration within DAEDALUS system supports an interactive construction of the predictor on the top of a set of spatio-temporal patterns.

Others proposals in literature base the definition of prediction methods for future location of a moving object on previously extracted frequent patterns. They use the recent history of movements of the object itself and often use time only to order the events. Our work uses the movements of all moving objects in a certain area to learn a classifier built on the mined trajectory patterns, which are intrinsically equipped with temporal information.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Miriam Baglioni</style></author><author><style face="normal" font="default" size="100%">de José Antônio Fernandes Macêdo</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Monica Wachowicz</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An Ontology-Based Approach for the Semantic Modelling and Reasoning on Trajectories</style></title><secondary-title><style face="normal" font="default" size="100%">ER Workshops</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><pages><style face="normal" font="default" size="100%">344-353</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Miriam Baglioni</style></author><author><style face="normal" font="default" size="100%">E. Giovannetti</style></author><author><style face="normal" font="default" size="100%">Maria V Masserotti</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Laura Spinsanti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Ontology-driven Querying of Geographical Databases</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><pages><style face="normal" font="default" size="100%">31–44</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">Transactions in GIS Volume 12, Issue s1, Date: December Pages:\subsection{Capitoli Libri}</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ruggero G. Pensa</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Fabio Pinelli</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Pattern-Preserving k-Anonymization of Sequences and its Application to Mobility Data Mining</style></title><secondary-title><style face="normal" font="default" size="100%">PiLBA</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://air.unimi.it/retrieve/handle/2434/52786/106397/ProceedingsPiLBA08.pdf#page=44</style></url></web-urls></urls><abstract><style face="normal" font="default" size="100%">Sequential pattern mining is a major research field in knowledge
discovery and data mining. Thanks to the increasing availability of
transaction data, it is now possible to provide new and improved services
based on users’ and customers’ behavior. However, this puts the citizen’s
privacy at risk. Thus, it is important to develop new privacy-preserving
data mining techniques that do not alter the analysis results significantly.
In this paper we propose a new approach for anonymizing sequential
data by hiding infrequent, and thus potentially sensible, subsequences.
Our approach guarantees that the disclosed data are k-anonymous and
preserve the quality of extracted patterns. An application to a real-world
moving object database is presented, which shows the effectiveness of our
approach also in complex contexts.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Francesco Bonchi</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author><author><style face="normal" font="default" size="100%">Vassilios S. Verykios</style></author><author><style face="normal" font="default" size="100%">Maurizio Atzori</style></author><author><style face="normal" font="default" size="100%">Bradley Malin</style></author><author><style face="normal" font="default" size="100%">Bart Moelans</style></author><author><style face="normal" font="default" size="100%">Yücel Saygin</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Privacy Protection: Regulations and Technologies, Opportunities and Threats</style></title><secondary-title><style face="normal" font="default" size="100%">Mobility, Data Mining and Privacy</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><pages><style face="normal" font="default" size="100%">101-119</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Miriam Baglioni</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Bart Kuijpers</style></author><author><style face="normal" font="default" size="100%">Alessandra Raffaetà</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Querying and Reasoning for Spatio-Temporal Data Mining</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><publisher><style face="normal" font="default" size="100%">a Knowledge Discovery vision</style></publisher><pub-location><style face="normal" font="default" size="100%">Mobility, Privacy, and Geography</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">, A Springer LNCS Monograph Fosca Giannotti and Dino Pedreschi, Editors, January</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Miriam Baglioni</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Bart Kuijpers</style></author><author><style face="normal" font="default" size="100%">Alessandra Raffaetà</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Querying and Reasoning for Spatiotemporal Data Mining</style></title><secondary-title><style face="normal" font="default" size="100%">Mobility, Data Mining and Privacy</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><pages><style face="normal" font="default" size="100%">335-374</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Bart Kuijpers</style></author><author><style face="normal" font="default" size="100%">Christine Körner</style></author><author><style face="normal" font="default" size="100%">Michael May</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Spatiotemporal Data Mining</style></title><secondary-title><style face="normal" font="default" size="100%">Mobility, Data Mining and Privacy</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><pages><style face="normal" font="default" size="100%">267-296</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Salvatore Ruggieri</style></author><author><style face="normal" font="default" size="100%">Frédéric Mesnard</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Typing Linear Constraints for Moding CLP() Programs</style></title><secondary-title><style face="normal" font="default" size="100%">SAS</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><pages><style face="normal" font="default" size="100%">128-143</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Simone Puntoni</style></author><author><style face="normal" font="default" size="100%">E. Frentzos</style></author><author><style face="normal" font="default" size="100%">Andrea Mazzoni</style></author><author><style face="normal" font="default" size="100%">Bart Moelans</style></author><author><style face="normal" font="default" size="100%">Nikos Pelekis</style></author><author><style face="normal" font="default" size="100%">F. Pini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Wireless Network Data Sources: Tracking and Synthesizing Trajectories</style></title><secondary-title><style face="normal" font="default" size="100%">Mobility, Data Mining and Privacy</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><pages><style face="normal" font="default" size="100%">73-100</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Miriam Baglioni</style></author><author><style face="normal" font="default" size="100%">Maria V Masserotti</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Laura Spinsanti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Building Geospatial Ontologies from Geographical Databases</style></title><secondary-title><style face="normal" font="default" size="100%">GeoS</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><pages><style face="normal" font="default" size="100%">195-209</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">H. Hosni</style></author><author><style face="normal" font="default" size="100%">Maria V Masserotti</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Maximum Entropy Reasoning for GIS</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">Flexible Databases supporting Imprecision and Uncertainty, Physica Verlag, June</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Betti, Gianni</style></author><author><style face="normal" font="default" size="100%">Mulas, Anna</style></author><author><style face="normal" font="default" size="100%">Michela Natilli</style></author><author><style face="normal" font="default" size="100%">Neri, Laura</style></author><author><style face="normal" font="default" size="100%">Verma, Vijay</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Comparative indicators of regional poverty and deprivation: Poland versus EU-15 Member States</style></title><secondary-title><style face="normal" font="default" size="100%">conference Comparative Economic Analysis of Households‟ Behaviour (CEAHB): Old and New EU Members, Warsaw University</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesco Bonchi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Alessio Mazzanti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Efficient breadth-first mining of frequent pattern with monotone constraints</style></title><secondary-title><style face="normal" font="default" size="100%">Knowl. Inf. Syst.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">8</style></volume><pages><style face="normal" font="default" size="100%">131-153</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesco Bonchi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Alessio Mazzanti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Exante: A Preprocessing Method for Frequent-Pattern Mining</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Intelligent Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">20</style></volume><pages><style face="normal" font="default" size="100%">25-31</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Andrea Mazzoni</style></author><author><style face="normal" font="default" size="100%">Simone Puntoni</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Synthetic generation of cellular network positioning data</style></title><secondary-title><style face="normal" font="default" size="100%">GIS</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><pages><style face="normal" font="default" size="100%">12-20</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Andrea Mazzoni</style></author><author><style face="normal" font="default" size="100%">Simone Puntoni</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Synthetic generation of cellular network positioning data</style></title><secondary-title><style face="normal" font="default" size="100%">GIS</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><pages><style face="normal" font="default" size="100%">12-20</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paolo Mancarella</style></author><author><style face="normal" font="default" size="100%">Alessandra Raffaetà</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Integrating Knowledge Representation and Reasoning in Geographical</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">information systems. {\em International Journal of GIS,Vol 18 (4), June }.</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paolo Mancarella</style></author><author><style face="normal" font="default" size="100%">Alessandra Raffaetà</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Integrating knowledge representation and reasoning in Geographical Information Systems</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Geographical Information Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year></dates><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">18</style></volume><pages><style face="normal" font="default" size="100%">417-447</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Specifying Mining Algorithms with Iterative User-Defined Aggregates</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Trans. Knowl. Data Eng.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year></dates><number><style face="normal" font="default" size="100%">10</style></number><volume><style face="normal" font="default" size="100%">16</style></volume><pages><style face="normal" font="default" size="100%">1232-1246</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Towards a Logic Query Language for Data Mining</style></title><secondary-title><style face="normal" font="default" size="100%">Database Support for Data Mining Applications</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year></dates><pages><style face="normal" font="default" size="100%">76-94</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesco Bonchi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Alessio Mazzanti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Adaptive Constraint Pushing in Frequent Pattern Mining</style></title><secondary-title><style face="normal" font="default" size="100%">PKDD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><pages><style face="normal" font="default" size="100%">47-58</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesco Bonchi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Alessio Mazzanti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">ExAMiner: Optimized Level-wise Frequent Pattern Mining with Monotone Constraint</style></title><secondary-title><style face="normal" font="default" size="100%">ICDM</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><pages><style face="normal" font="default" size="100%">11-18</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesco Bonchi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Alessio Mazzanti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">ExAnte: Anticipated Data Reduction in Constrained Pattern Mining</style></title><secondary-title><style face="normal" font="default" size="100%">PKDD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><pages><style face="normal" font="default" size="100%">59-70</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Jef Wijsen</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Logical Languages for Data Mining</style></title><secondary-title><style face="normal" font="default" size="100%">Logics for Emerging Applications of Databases</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><pages><style face="normal" font="default" size="100%">325-361</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesco Bonchi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Alessio Mazzanti</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Pre-processing for Constrained Pattern Mining</style></title><secondary-title><style face="normal" font="default" size="100%">SEBD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><pages><style face="normal" font="default" size="100%">519-530</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Cristian Gozzi</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Characterizing Web User Accesses: A Transactional Approach to Web Log Clustering</style></title><secondary-title><style face="normal" font="default" size="100%">ITCC</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><pages><style face="normal" font="default" size="100%">312</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Cristian Gozzi</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Clustering Transactional Data</style></title><secondary-title><style face="normal" font="default" size="100%">PKDD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><pages><style face="normal" font="default" size="100%">175-187</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paolo Mascellani</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The Declarative Side of Magic</style></title><secondary-title><style face="normal" font="default" size="100%">Computational Logic: Logic Programming and Beyond</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><pages><style face="normal" font="default" size="100%">83-108</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">LDL-M$_{\mbox{ine}}$: Integrating Data Mining with Intelligent Query Answering</style></title><secondary-title><style face="normal" font="default" size="100%">JELIA</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><pages><style face="normal" font="default" size="100%">517-520</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paolo Mancarella</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Salvatore Ruggieri</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Negation as Failure through Abduction: Reasoning about Termination</style></title><secondary-title><style face="normal" font="default" size="100%">Computational Logic: Logic Programming and Beyond</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><pages><style face="normal" font="default" size="100%">240-272</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Cristian Gozzi</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Clustering Transactional Data</style></title><secondary-title><style face="normal" font="default" size="100%">SEBD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><pages><style face="normal" font="default" size="100%">163-176</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesco Bonchi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Salvatore Ruggieri</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Data Mining for Intelligent Web Caching</style></title><secondary-title><style face="normal" font="default" size="100%">ITCC</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><pages><style face="normal" font="default" size="100%">599-603</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesco Bonchi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Salvatore Ruggieri</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Data Mining for Intelligent Web Caching</style></title><secondary-title><style face="normal" font="default" size="100%">ITCC</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><pages><style face="normal" font="default" size="100%">599-603</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Nondeterministic, Nonmonotonic Logic Databases</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Trans. Knowl. Data Eng.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><number><style face="normal" font="default" size="100%">5</style></number><volume><style face="normal" font="default" size="100%">13</style></volume><pages><style face="normal" font="default" size="100%">813-823</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Specifying Mining Algorithms with Iterative User-Defined Aggregates: A Case Study</style></title><secondary-title><style face="normal" font="default" size="100%">PKDD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><pages><style face="normal" font="default" size="100%">128-139</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesco Bonchi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Cristian Gozzi</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Salvatore Ruggieri</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Web log data warehousing and mining for intelligent web caching</style></title><secondary-title><style face="normal" font="default" size="100%">Data Knowl. Eng.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">39</style></volume><pages><style face="normal" font="default" size="100%">165-189</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesco Bonchi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Cristian Gozzi</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Salvatore Ruggieri</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Web Log Data Warehousing and Mining for Intelligent Web Caching</style></title><secondary-title><style face="normal" font="default" size="100%">Data and Knowledge Engineering</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">39:165, November .</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesco Bonchi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Cristian Gozzi</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Salvatore Ruggieri</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Web log data warehousing and mining for intelligent web caching</style></title><secondary-title><style face="normal" font="default" size="100%">Data Knowl. Eng.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">39</style></volume><pages><style face="normal" font="default" size="100%">165-189</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Declarative Knowledge Extraction with Interactive User-Defined Aggregates</style></title><secondary-title><style face="normal" font="default" size="100%">FQAS</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2000</style></year></dates><pages><style face="normal" font="default" size="100%">435-444</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Making Knowledge Extraction and Reasoning Closer</style></title><secondary-title><style face="normal" font="default" size="100%">PAKDD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2000</style></year></dates><pages><style face="normal" font="default" size="100%">360-371</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesco Bonchi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Gianni Mainetto</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Classification-Based Methodology for Planning Audit Strategies in Fraud Detection</style></title><secondary-title><style face="normal" font="default" size="100%">KDD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><pages><style face="normal" font="default" size="100%">175-184</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Experiences with a Logic-Based Knowledge Discovery Support Environment</style></title><secondary-title><style face="normal" font="default" size="100%">AI*IA</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><pages><style face="normal" font="default" size="100%">202-213</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Experiences with a Logic-based knowledge discovery Support Environment</style></title><secondary-title><style face="normal" font="default" size="100%">1999 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Integration of Deduction and Induction for Mining Supermarket Sales Data</style></title><secondary-title><style face="normal" font="default" size="100%">SEBD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><pages><style face="normal" font="default" size="100%">117-131</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Querying inductive Databases via Logic-Based user-defined aggregates</style></title><secondary-title><style face="normal" font="default" size="100%">APPIA-GULP-PRODE</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><pages><style face="normal" font="default" size="100%">605-620</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Querying Inductive Databases via Logic-Based User-Defined Aggregates</style></title><secondary-title><style face="normal" font="default" size="100%">PKDD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><pages><style face="normal" font="default" size="100%">125-135</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesco Bonchi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Gianni Mainetto</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Una Metodologia Basata sulla Classificazione per la Pianificazione degli Accertamenti nel Rilevamento di Frodi</style></title><secondary-title><style face="normal" font="default" size="100%">SEBD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><pages><style face="normal" font="default" size="100%">69-84</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Francesco Bonchi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Gianni Mainetto</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Using Data Mining Techniques in Fiscal Fraud Detection</style></title><secondary-title><style face="normal" font="default" size="100%">DaWaK</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><pages><style face="normal" font="default" size="100%">369-376</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">On the Effective Semantics of Nondeterministic, Nonmonotonic, Temporal Logic Databases</style></title><secondary-title><style face="normal" font="default" size="100%">CSL</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1998</style></year></dates><pages><style face="normal" font="default" size="100%">58-72</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Query Answering in Nondeterministic, Nonmonotonic Logic Databases</style></title><secondary-title><style face="normal" font="default" size="100%">FQAS</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1998</style></year></dates><pages><style face="normal" font="default" size="100%">175-187</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Datalog++: A Basis for Active Object-Oriented Databases</style></title><secondary-title><style face="normal" font="default" size="100%">DOOD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1997</style></year></dates><pages><style face="normal" font="default" size="100%">283-301</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Datalog++: a Basis for Active Object.Oriented Databases</style></title><secondary-title><style face="normal" font="default" size="100%">SEBD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1997</style></year></dates><pages><style face="normal" font="default" size="100%">325-340</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Giuseppe Manco</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Deductive Data Model for Representing and Querying Semistructured Data</style></title><secondary-title><style face="normal" font="default" size="100%">APPIA-GULP-PRODE</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1997</style></year></dates><pages><style face="normal" font="default" size="100%">129-140</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giuseppe Amato</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Gianni Mainetto</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Static Analysis of Transactions for Conservative Multigranularity Locking</style></title><secondary-title><style face="normal" font="default" size="100%">DBPL</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1997</style></year></dates><pages><style face="normal" font="default" size="100%">413-430</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Marilisa E. Carboni</style></author><author><style face="normal" font="default" size="100%">Annalisa Di Deo</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Maria V Masserotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Ragionamento spazio-temporale con LDLT: primi esperimenti verso un sistema deduttivo per applicazioni geografiche</style></title><secondary-title><style face="normal" font="default" size="100%">SEBD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1996</style></year></dates><pages><style face="normal" font="default" size="100%">73-90</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Marilisa E. Carboni</style></author><author><style face="normal" font="default" size="100%">Annalisa Di Deo</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Maria V Masserotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Spatio-Temporal Reasoning with LDLT: First Steps Towards a Deductive System for Geographical Applications</style></title><secondary-title><style face="normal" font="default" size="100%">DDLP</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1996</style></year></dates><pages><style face="normal" font="default" size="100%">135-151</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Danilo Montesi</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Using Temporary Integrity Constraints to Optimize Databases</style></title><secondary-title><style face="normal" font="default" size="100%">FAPR</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1996</style></year></dates><pages><style face="normal" font="default" size="100%">430-435</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giuseppe Amato</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Gianni Mainetto</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Conservative Multigranularity Locking for an Obiect-Oriented Persistent Language via Abstract Interpretation</style></title><secondary-title><style face="normal" font="default" size="100%">SEBD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1994</style></year></dates><pages><style face="normal" font="default" size="100%">329-349</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Antonio Brogi</style></author><author><style face="normal" font="default" size="100%">A. Chiarelli</style></author><author><style face="normal" font="default" size="100%">Paolo Mancarella</style></author><author><style face="normal" font="default" size="100%">V. Mazzotta</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Implementations of Program Composition Operations</style></title><secondary-title><style face="normal" font="default" size="100%">PLILP</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1994</style></year></dates><pages><style face="normal" font="default" size="100%">292-307</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Antonio Brogi</style></author><author><style face="normal" font="default" size="100%">A. Chiarelli</style></author><author><style face="normal" font="default" size="100%">Paolo Mancarella</style></author><author><style face="normal" font="default" size="100%">V. Mazzotta</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Implementations of Program Composition Operations</style></title></titles><dates><year><style  face="normal" font="default" size="100%">1994</style></year></dates><pages><style face="normal" font="default" size="100%">292–307</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">Programming Language Implementation and Logic Programming Lecture Notes in Computer Science, volume 844,</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Antonio Brogi</style></author><author><style face="normal" font="default" size="100%">A. Chiarelli</style></author><author><style face="normal" font="default" size="100%">Paolo Mancarella</style></author><author><style face="normal" font="default" size="100%">V. Mazzotta</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Implementations of Program Composition Operations</style></title><secondary-title><style face="normal" font="default" size="100%">PLILP</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1994</style></year></dates><pages><style face="normal" font="default" size="100%">292-307</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Antonio Brogi</style></author><author><style face="normal" font="default" size="100%">Paolo Mancarella</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Modular Logic Programming</style></title><secondary-title><style face="normal" font="default" size="100%">ACM Trans. Program. Lang. Syst.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1994</style></year></dates><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">16</style></volume><pages><style face="normal" font="default" size="100%">1361-1398</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paolo Mascellani</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Proving termination of Prolog programs</style></title><secondary-title><style face="normal" font="default" size="100%">GULP-PRODE (1)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1994</style></year></dates><pages><style face="normal" font="default" size="100%">46-61</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giuseppe Amato</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Gianni Mainetto</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Data Sharing Analysis for a Database Programming Lanaguage via Abstract Interpretation</style></title><secondary-title><style face="normal" font="default" size="100%">VLDB</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1993</style></year></dates><pages><style face="normal" font="default" size="100%">405-415</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giuseppe Amato</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Gianni Mainetto</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Static Analysis of Transactions: an Experiment of Abstract Interpretation Usage</style></title><secondary-title><style face="normal" font="default" size="100%">FMLDO</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1993</style></year></dates><pages><style face="normal" font="default" size="100%">19-29</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">A. Chiarelli</style></author><author><style face="normal" font="default" size="100%">V. Mazzotta</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A WAM Estesa per la Composizione di Programi Logici</style></title><secondary-title><style face="normal" font="default" size="100%">GULP</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1993</style></year></dates><pages><style face="normal" font="default" size="100%">189-202</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giuseppe Amato</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Gianni Mainetto</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Analysis of Concurrent Transactions in a Functional Database Programming Language</style></title><secondary-title><style face="normal" font="default" size="100%">WSA</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1992</style></year></dates><pages><style face="normal" font="default" size="100%">174-184</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Antonio Brogi</style></author><author><style face="normal" font="default" size="100%">Paolo Mancarella</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Meta for Modularising Logic Programming</style></title><secondary-title><style face="normal" font="default" size="100%">META</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1992</style></year></dates><pages><style face="normal" font="default" size="100%">105-119</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>6</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Bruno Bertolino</style></author><author><style face="normal" font="default" size="100%">Luigi Meo</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The Type System of LML</style></title><secondary-title><style face="normal" font="default" size="100%">Types in Logic Programming</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1992</style></year></dates><pages><style face="normal" font="default" size="100%">313-332</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Antonio Brogi</style></author><author><style face="normal" font="default" size="100%">Paolo Mancarella</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Theory Construction in Computational Logic</style></title><secondary-title><style face="normal" font="default" size="100%">ICLP Workshop on Construction of Logic Programs</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1991</style></year></dates><pages><style face="normal" font="default" size="100%">241-250</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paolo Mancarella</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Marina Rondinelli</style></author><author><style face="normal" font="default" size="100%">Marco Tagliatti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Algebraic Properties of a Class of Logic Programs</style></title><secondary-title><style face="normal" font="default" size="100%">NACLP</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1990</style></year></dates><pages><style face="normal" font="default" size="100%">23-39</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Antonio Brogi</style></author><author><style face="normal" font="default" size="100%">Paolo Mancarella</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Logic Programming within a Functional Framework</style></title><secondary-title><style face="normal" font="default" size="100%">PLILP</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1990</style></year></dates><pages><style face="normal" font="default" size="100%">372-386</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Roberto Barbuti</style></author><author><style face="normal" font="default" size="100%">Paolo Mancarella</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Transformational Approach to Negation in Logic Programming</style></title><secondary-title><style face="normal" font="default" size="100%">J. Log. Program.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1990</style></year></dates><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">8</style></volume><pages><style face="normal" font="default" size="100%">201-228</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Antonio Brogi</style></author><author><style face="normal" font="default" size="100%">Paolo Mancarella</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Universal Quantification by Case Analysis</style></title><secondary-title><style face="normal" font="default" size="100%">ECAI</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1990</style></year></dates><pages><style face="normal" font="default" size="100%">111-116</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paolo Mancarella</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An Algebra of Logic Programs</style></title><secondary-title><style face="normal" font="default" size="100%">ICLP/SLP</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1988</style></year></dates><pages><style face="normal" font="default" size="100%">1006-1023</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paolo Mancarella</style></author><author><style face="normal" font="default" size="100%">Simone Martini</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Complete Logic Programs with Domain-Closure Axiom</style></title><secondary-title><style face="normal" font="default" size="100%">J. Log. Program.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1988</style></year></dates><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">5</style></volume><pages><style face="normal" font="default" size="100%">263-276</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Bruno Bertolino</style></author><author><style face="normal" font="default" size="100%">Paolo Mancarella</style></author><author><style face="normal" font="default" size="100%">Luigi Meo</style></author><author><style face="normal" font="default" size="100%">Luca Nini</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Progress Report on the LML Project</style></title><secondary-title><style face="normal" font="default" size="100%">FGCS</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1988</style></year></dates><pages><style face="normal" font="default" size="100%">675-684</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Roberto Barbuti</style></author><author><style face="normal" font="default" size="100%">Paolo Mancarella</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Intensional Negation of Logic Programs: Examples and Implementation Techniques</style></title><secondary-title><style face="normal" font="default" size="100%">TAPSOFT, Vol.2</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1987</style></year></dates><pages><style face="normal" font="default" size="100%">96-110</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Attilio Matteucci</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Franco Turini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Symbolic Evaluation with Structural Recursive Symbolic Constants</style></title><secondary-title><style face="normal" font="default" size="100%">Sci. Comput. Program.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1987</style></year></dates><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">161-177</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record></records></xml>