<?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%">Jisu Kim</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%">Lorenzo Gabrielli</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Digital Footprints of International Migration on Twitter</style></title><secondary-title><style face="normal" font="default" size="100%">International Symposium on Intelligent Data Analysis</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-44584-3_22</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%">Studying migration using traditional data has some limitations. To date, there have been several studies proposing innovative methodologies to measure migration stocks and flows from social big data. Nevertheless, a uniform definition of a migrant is difficult to find as it varies from one work to another depending on the purpose of the study and nature of the dataset used. In this work, a generic methodology is developed to identify migrants within the Twitter population. This describes a migrant as a person who has the current residence different from the nationality. The residence is defined as the location where a user spends most of his/her time in a certain year. The nationality is inferred from linguistic and social connections to a migrant’s country of origin. This methodology is validated first with an internal gold standard dataset and second with two official statistics, and shows strong performance scores and correlation coefficients. Our method has the advantage that it can identify both immigrants and emigrants, regardless of the origin/destination countries. The new methodology can be used to study various aspects of migration, including opinions, integration, attachment, stocks and flows, motivations for migration, etc. Here, we exemplify how trending topics across and throughout different migrant communities can be observed.</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%">Cecilia Panigutti</style></author><author><style face="normal" font="default" size="100%">Perotti, Alan</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%">Doctor XAI: an ontology-based approach to black-box sequential data classification explanations</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency</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://dl.acm.org/doi/pdf/10.1145/3351095.3372855?download=true</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Several recent advancements in Machine Learning involve black-box models: algorithms that do not provide human-understandable explanations in support of their decisions. This limitation hampers the fairness, accountability and transparency of these models; the field of eXplainable Artificial Intelligence (XAI) tries to solve this problem providing human-understandable explanations for black-box models. However, healthcare datasets (and the related learning tasks) often present peculiar features, such as sequential data, multi-label predictions, and links to structured background knowledge. In this paper, we introduce Doctor XAI, a model-agnostic explainability technique able to deal with multi-labeled, sequential, ontology-linked data. We focus on explaining Doctor AI, a multilabel classifier which takes as input the clinical history of a patient in order to predict the next visit. Furthermore, we show how exploiting the temporal dimension in the data and the domain knowledge encoded in the medical ontology improves the quality of the mined explanations.</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%">Bruestle, Stephen</style></author><author><style face="normal" font="default" size="100%">Luca Pappalardo</style></author><author><style face="normal" font="default" size="100%">Riccardo Guidotti</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Defining Geographic Markets from Probabilistic Clusters: A Machine Learning Algorithm Applied to Supermarket Scanner Data</style></title><secondary-title><style face="normal" font="default" size="100%">Available at SSRN 3452058</style></secondary-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>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Calogiuri, Giovanna</style></author><author><style face="normal" font="default" size="100%">Johansen, Patrick Foss</style></author><author><style face="normal" font="default" size="100%">Alessio Rossi</style></author><author><style face="normal" font="default" size="100%">Thurston, Miranda</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Do “girls just wanna have fun”? Participation trends and motivational profiles of women in Norway’s ultimate mass participation ski event</style></title><secondary-title><style face="normal" font="default" size="100%">Frontiers in Psychology</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.frontiersin.org/articles/10.3389/fpsyg.2019.02548/full</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">10</style></volume><pages><style face="normal" font="default" size="100%">2548</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Mass participation sporting events (MPSEs) are viewed as encouraging regular exercise in the population, but concerns have been expressed about the extent to which they are inclusive for women. This study focuses on an iconic cross-country skiing MPSE in Norway, the Birkebeiner race (BR), which includes different variants (main, Friday, half-distance, and women-only races). In order to shed light on women’s participation in this specific MPSE, as well as add to the understanding of women’s MPSEs participation in general, this study was set up to: (i) analyze trends in women’s participation, (ii) examine the characteristics, and (iii) identify key factors characterizing the motivational profile of women in different BR races, with emphasis on the full-distance vs. the women-only races. Entries in the different races throughout the period 1996–2018 were analyzed using an autoregressive model. Information on women’s sociodemographic characteristics, sport and exercise participation, and a range of psychological variables (motives, perceptions, overall satisfaction, and future participation intention) were extracted from a market survey and analyzed using a machine learning (ML) approach (n = 1,149). Additionally, qualitative information generated through open-ended questions was analyzed thematically (n = 116). The relative prevalence of women in the main BR was generally low (&lt; 20%). While the other variants contributed to boosting women’s participation in the overall event, a future increment of women in the main BR was predicted, with women’s ratings possibly matching the men’s by the year 2034. Across all races, most of the women were physically active, of medium-high income, and living in the most urbanized region of Norway. Satisfaction and future participation intention were relatively high, especially among the participants in the women-only races. “Exercise goal” was the predominant participation motive. The participants in women-only races assigned greater importance to social aspects, and perceived the race as a tradition, whereas those in the full-distance races were younger and gave more importance to performance aspects. These findings corroborate known trends and challenges in MPSE participation, but also contribute to greater understanding in this under-researched field. Further research is needed in order to gain more knowledge on how to foster women’s participation in MPSEs.</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%">Sarmento, Rui Portocarrero</style></author><author><style face="normal" font="default" size="100%">Lemos, Luís</style></author><author><style face="normal" font="default" size="100%">Cordeiro, Mário</style></author><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Cardoso, Douglas</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">DynComm R Package–Dynamic Community Detection for Evolving Networks</style></title><secondary-title><style face="normal" font="default" size="100%">arXiv preprint arXiv:1905.01498</style></secondary-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>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>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Lorenzo Gabrielli</style></author><author><style face="normal" font="default" size="100%">Daniele Fadda</style></author><author><style face="normal" font="default" size="100%">Giulio Rossetti</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Piccinini, Leonardo</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%">Patrizia Lattarulo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Discovering Mobility Functional Areas: A Mobility Data Analysis Approach</style></title><secondary-title><style face="normal" font="default" size="100%">International Workshop on Complex Networks</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_27</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%">How do we measure the borders of urban areas and therefore decide which are the functional units of the territory? Nowadays, we typically do that just looking at census data, while in this work we aim to identify functional areas for mobility in a completely data-driven way. Our solution makes use of human mobility data (vehicle trajectories) and consists in an agglomerative process which gradually groups together those municipalities that maximize internal vehicular traffic while minimizing external one. The approach is tested against a dataset of trips involving individuals of an Italian Region, obtaining a new territorial division which allows us to identify mobility attractors. Leveraging such partitioning and external knowledge, we show that our method outperforms the state-of-the-art algorithms. Indeed, the outcome of our approach is of great value to public administrations for creating synergies within the aggregations of the territories obtained.</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%">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>34</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fabio Beltram</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%">Data Science a Game-changer for Science and Innovation</style></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><publisher><style face="normal" font="default" size="100%">G7 Academy</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Digital technology is ubiquitous and very much part of public and private organizations and of individuals’ lives. People and things are becoming increasingly interconnected. Smartphones, smart buildings, smart factories, smart cities, autonomous vehicles and other smart environments and devices are filled with digital sensors, all of them creating an abundance of data. Governance and health care collect, generate and use data in an unprecedented quantity. New high- throughput scientific instruments and methods, like telescopes, satellites, accelerators, supercomputers, sensor networks and gene sequencing methods as well as large scale simulations generate massive amounts of data. Often referred to as data deluge, or Big Data, massive datasets revolutionize the way research is carried out, resulting in the emergence of a new, fourth paradigm of science based on data-intensive computing and data driven discovery4. Accordingly, the path to the solution of the problem of sustainable development will lead through Big Data, as maintaining the whole complexity of our modern society, including communication and traffic services, manufacturing, trade and commerce, financial services, health security, science, education and policy making requires this novel approach.
The new availability of huge amounts of data, along with advanced tools of exploratory data analysis, data mining/machine learning, and data visualization, and scalable infrastructures, has produced a spectacular change in the scientific method: all this is Data Science. This paper describes the main issues around Data Science as it will play out in the coming years in science and society. It focus on the scientific, technical and ethical challenges (A), on its role for disruptive innovation for science, industry, policy and people (B), on its scientific, technological and educational challenges (C) and finally, on the quantitative expectations of its economic impact (D). In our work we could count on many reports and studies on the subject, particularly on the BDVA5 and ERCIM6 reports.</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%">Filippo Simini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Data-driven generation of spatio-temporal routines in human mobility</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%">2017</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Dec</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1007/s10618-017-0548-4</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 generation of realistic spatio-temporal trajectories of human mobility is of fundamental importance in a wide range of applications, such as the developing of protocols for mobile ad-hoc networks or what-if analysis in urban ecosystems. Current generative algorithms fail in accurately reproducing the individuals' recurrent schedules and at the same time in accounting for the possibility that individuals may break the routine during periods of variable duration. In this article we present Ditras (DIary-based TRAjectory Simulator), a framework to simulate the spatio-temporal patterns of human mobility. Ditras operates in two steps: the generation of a mobility diary and the translation of the mobility diary into a mobility trajectory. We propose a data-driven algorithm which constructs a diary generator from real data, capturing the tendency of individuals to follow or break their routine. We also propose a trajectory generator based on the concept of preferential exploration and preferential return. We instantiate Ditras with the proposed diary and trajectory generators and compare the resulting algorithm with real data and synthetic data produced by other generative algorithms, built by instantiating Ditras with several combinations of diary and trajectory generators. We show that the proposed algorithm reproduces the statistical properties of real trajectories in the most accurate way, making a step forward the understanding of the origin of the spatio-temporal patterns of human mobility.</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%">Barbara Furletti</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author><author><style face="normal" font="default" size="100%">Paolo Cintia</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%">Discovering and Understanding City Events with Big Data: The Case of Rome</style></title><secondary-title><style face="normal" font="default" size="100%">Information</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%">06/2017</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.3390/info8030074</style></url></web-urls></urls><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%">74</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The increasing availability of large amounts of data and digital footprints has given rise
to ambitious research challenges in many fields, which spans from medical research, financial and
commercial world, to people and environmental monitoring. Whereas traditional data sources and
census fail in capturing actual and up-to-date behaviors, Big Data integrate the missing knowledge
providing useful and hidden information to analysts and decision makers. With this paper, we focus
on the identification of city events by analyzing mobile phone data (Call Detail Record), and we study
and evaluate the impact of these events over the typical city dynamics. We present an analytical
process able to discover, understand and characterize city events from Call Detail Record, designing
a distributed computation to implement Sociometer, that is a profiling tool to categorize phone users.
The methodology provides an useful tool for city mobility manager to manage the events and taking
future decisions on specific classes of users, i.e., residents, commuters and tourists.</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>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Bessiere, Christian</style></author><author><style face="normal" font="default" size="100%">De Raedt, Luc</style></author><author><style face="normal" font="default" size="100%">Lars Kotthoff</style></author><author><style face="normal" font="default" size="100%">Siegfried Nijssen</style></author><author><style face="normal" font="default" size="100%">Barry O'Sullivan</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%">Data Mining and Constraint Programming - Foundations of a Cross-Disciplinary Approach.</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">A successful integration of constraint programming and data mining has the potential to lead to a new ICT paradigm with far reaching implications. It could change the face of data mining and machine learning, as well as constraint programming technology. It would not only allow one to use data mining techniques in constraint programming to identify and update constraints and optimization criteria, but also to employ constraints and criteria in data mining and machine learning in order to discover models compatible with prior knowledge.
This book reports on some key results obtained on this integrated and cross- disciplinary approach within the European FP7 FET Open project no. 284715 on “Inductive Constraint Programming” and a number of associated workshops and Dagstuhl seminars. The book is structured in five parts: background; learning to model; learning to solve; constraint programming for data mining; and showcases. </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%">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%">Data Mining and Constraints: An Overview</style></title><secondary-title><style face="normal" font="default" size="100%">Data Mining and Constraint Programming</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%">Springer International Publishing</style></publisher><pages><style face="normal" font="default" size="100%">25–48</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This paper provides an overview of the current state-of-the-art on using constraints in knowledge discovery and data mining. The use of constraints requires mechanisms for defining and evaluating them during the knowledge extraction process. We give a structured account of three main groups of constraints based on the specific context in which they are defined and used. The aim is to provide a complete view on constraints as a building block of data mining 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%">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>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%">Martin Crane</style></author><author><style face="normal" font="default" size="100%">Heather J Ruskin</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Data Integration for Microarrays: Enhanced Inference for Gene Regulatory Networks</style></title><secondary-title><style face="normal" font="default" size="100%">Microarrays</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.mdpi.com/2076-3905/4/2/255</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%">255–269</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%">Barbara Furletti</style></author><author><style face="normal" font="default" size="100%">Lorenzo Gabrielli</style></author><author><style face="normal" font="default" size="100%">Roberto Trasarti</style></author><author><style face="normal" font="default" size="100%">Zbigniew Smoreda</style></author><author><style face="normal" font="default" size="100%">Maarten Vanhoof</style></author><author><style face="normal" font="default" size="100%">Cezary Ziemlicki</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Detecting and understanding big events in big cities</style></title><secondary-title><style face="normal" font="default" size="100%">NetMob</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year><pub-dates><date><style  face="normal" font="default" size="100%">04/2015</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.netmob.org/assets/img/netmob15_book_of_abstracts_posters.pdf</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Boston</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Recent studies have shown the great potential of big data such as mobile phone location data to model human behavior. Big data allow to analyze people presence in a territory in a fast and effective way with respect to the classical surveys (diaries or questionnaires). One of the drawbacks of these collection systems is incompleteness of the users' traces; people are localized only when they are using their phones. In this work we define a data mining method for identifying people presence and understanding the impact of big events in big cities. We exploit the ability of the Sociometer for classifying mobile phone users in mobility categories through their presence profile. The experiment in cooperation with Orange Telecom has been conduced in Paris during the event F^ete de la Musique using a
privacy preserving protocol.</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>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Aldinucci, Marco</style></author><author><style face="normal" font="default" size="100%">Salvatore Ruggieri</style></author><author><style face="normal" font="default" size="100%">Torquati, Massimo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Decision tree building on multi-core using FastFlow</style></title><secondary-title><style face="normal" font="default" size="100%">Concurrency and Computation: Practice and Experience</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%">3</style></number><volume><style face="normal" font="default" size="100%">26</style></volume><pages><style face="normal" font="default" size="100%">800–820</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The whole computer hardware industry embraced the multi-core. The extreme optimisation of sequential algorithms is then no longer sufficient to squeeze the real machine power, which can be only exploited via thread-level parallelism. Decision tree algorithms exhibit natural concurrency that makes them suitable to be parallelised. This paper presents an in-depth study of the parallelisation of an implementation of the C4.5 algorithm for multi-core architectures. We characterise elapsed time lower bounds for the forms of parallelisations adopted and achieve close to optimal performance. Our implementation is based on the FastFlow parallel programming environment, and it requires minimal changes to the original sequential code. Copyright © 2013 John Wiley &amp; Sons, Ltd.</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%">Ana-Maria Olteanu-Raimond</style></author><author><style face="normal" font="default" size="100%">Mirco Nanni</style></author><author><style face="normal" font="default" size="100%">Thomas Couronné</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%">Zbigniew Smoreda</style></author><author><style face="normal" font="default" size="100%">Cezary Ziemlicki</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Discovering urban and country dynamics from mobile phone data with spatial correlation patterns</style></title><secondary-title><style face="normal" font="default" size="100%">Telecommunications Policy</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Urban dynamics</style></keyword></keywords><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://www.sciencedirect.com/science/article/pii/S0308596113002012</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">-</style></pages><abstract><style face="normal" font="default" size="100%">Abstract Mobile communication technologies pervade our society and existing wireless networks are able to sense the movement of people, generating large volumes of data related to human activities, such as mobile phone call records. At the present, this kind of data is collected and stored by telecom operators infrastructures mainly for billing reasons, yet it represents a major source of information in the study of human mobility. In this paper, we propose an analytical process aimed at extracting interconnections between different areas of the city that emerge from highly correlated temporal variations of population local densities. To accomplish this objective, we propose a process based on two analytical tools: (i) a method to estimate the presence of people in different geographical areas; and (ii) a method to extract time- and space-constrained sequential patterns capable to capture correlations among geographical areas in terms of significant co-variations of the estimated presence. The methods are presented and combined in order to deal with two real scenarios of different spatial scale: the Paris Region and the whole France.</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%">Salvatore Ruggieri</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Data Anonymity Meets Non-discrimination</style></title><secondary-title><style face="normal" font="default" size="100%">Data Mining Workshops (ICDMW), 2013 IEEE 13th International Conference on</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</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></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%">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%">The discovery of discrimination</style></title><secondary-title><style face="normal" font="default" size="100%">Discrimination and privacy in the information society</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pages><style face="normal" font="default" size="100%">91–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>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Andrea Romei</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%">Discrimination discovery in scientific project evaluation: A case study</style></title><secondary-title><style face="normal" font="default" size="100%">Expert Systems with Applications</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><number><style face="normal" font="default" size="100%">15</style></number><volume><style face="normal" font="default" size="100%">40</style></volume><pages><style face="normal" font="default" size="100%">6064–6079</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%">Davy Janssens</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</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%">S Rinzivillo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Data Science for Simulating the Era of Electric Vehicles</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></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 Coscia</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></authors></contributors><titles><title><style face="normal" font="default" size="100%">DEMON: a Local-First Discovery Method for Overlapping Communities</style></title><secondary-title><style face="normal" font="default" size="100%">KDD 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></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 Coscia</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></authors></contributors><titles><title><style face="normal" font="default" size="100%">DEMON: a local-first discovery method for overlapping communities</style></title><secondary-title><style face="normal" font="default" size="100%">The 18th {ACM} {SIGKDD} International Conference on Knowledge Discovery and Data Mining, {KDD} '12, Beijing, China, August 12-16, 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://doi.acm.org/10.1145/2339530.2339630</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>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>6</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Tomei, Gabriele</style></author><author><style face="normal" font="default" size="100%">Michela Natilli</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Dinamiche di impoverimento. Meccanismi, traiettorie ed effetti in un contesto locale</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><publisher><style face="normal" font="default" size="100%">Carocci Editore</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%">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%">Miriam Baglioni</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%">DAMSEL: A System for Progressive Querying and Reasoning on Movement Data</style></title><secondary-title><style face="normal" font="default" size="100%">DEXA Workshops</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%">452-456</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%">Daniel Ornellana, Chiara Renso</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Developing a Spatial Knowledge Representation for Pedestrian Interactions</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%">MOVEMENT-AWARE APPLICATIONS FOR SUSTAINABLE MOBILITY: TECHNOLOGIES AND APPROACHES, Monica Wachowicz Editor, IGI Publisher, To appear \subsection{Conferenze e Workshop}</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%">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>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Davide Bacciu</style></author><author><style face="normal" font="default" size="100%">Andrea Bellandi</style></author><author><style face="normal" font="default" size="100%">Barbara Furletti</style></author><author><style face="normal" font="default" size="100%">Valerio Grossi</style></author><author><style face="normal" font="default" size="100%">Andrea Romei</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Discovering Strategic Behaviour in Multi- Agent Scenarios by Ontology-Driven Mining</style></title><secondary-title><style face="normal" font="default" size="100%">Advances in Robotics, Automation and Control</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%">http://www.intechopen.com/books/advances_in_robotics_automation_and_control/discovering_strategic_behaviors_in_multi-agent_scenarios_by_ontology-driven_mining</style></url></web-urls></urls><isbn><style face="normal" font="default" size="100%">978-953-7619-16-9</style></isbn></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%">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%">Discrimination-aware data mining</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%">2008</style></year></dates><pages><style face="normal" font="default" size="100%">560-568</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%">Barbara Furletti</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%">DrC4.5: Improving C4.5 by means of Prior Knowledge</style></title><secondary-title><style face="normal" font="default" size="100%">ACM Symposium on Applied Computing</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dl.acm.org/ft_gateway.cfm?id=1066787&amp;ftid=311609&amp;dwn=1&amp;CFID=96873366&amp;CFTOKEN=59233511</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><pub-location><style face="normal" font="default" size="100%">Santa Fe, New Mexico, USA</style></pub-location><isbn><style face="normal" font="default" size="100%">1-58113-964-0</style></isbn></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%">Mirco Nanni</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%">Deductive and Inductive Reasoning on Spatio-Temporal Data</style></title><secondary-title><style face="normal" font="default" size="100%">INAP/WLP</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%">98-115</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%">Mirco Nanni</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%">Deductive and Inductive Reasoning on Trajectories</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%">2004</style></year></dates><pages><style face="normal" font="default" size="100%">98-105</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%">V. Bacarella</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</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%">Discovery of ads web hosts through traffic data analysis</style></title><secondary-title><style face="normal" font="default" size="100%">DMKD</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-81</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%">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>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>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%">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%">Dynamic Composition of Parameterised Logic Modules</style></title><secondary-title><style face="normal" font="default" size="100%">Computer Languages</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%">211–242</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">25(4):.</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%">Antonio Brogi</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%">Dynamic composition of parameterised logic modules</style></title><secondary-title><style face="normal" font="default" size="100%">Comput. Lang.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">25</style></volume><pages><style face="normal" font="default" size="100%">211-242</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%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Datalog with Non-Deterministic Choice Computers NDB-PTIME</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%">1998</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">35</style></volume><pages><style face="normal" font="default" size="100%">79-101</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%">Marilisa E. Carboni</style></author><author><style face="normal" font="default" size="100%">V. Foddai</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%">Declarative Reconstruction of Updates in Logic Databases: a Compilative Approach</style></title><secondary-title><style face="normal" font="default" size="100%">GULP-PRODE</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1995</style></year></dates><pages><style face="normal" font="default" size="100%">169-182</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%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">V. Foddai</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%">Declarative Reconstruction of Updates in Logic Databases: A Compilative Approach</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%">1995</style></year></dates><pages><style face="normal" font="default" size="100%">3-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>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%">Luca Corciulo</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%">Datalog with Non-Deterministic Choice Computes NDB-PTIME</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%">1993</style></year></dates><pages><style face="normal" font="default" size="100%">49-66</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%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Declarative Semantics for Pruning Operators in Logic Programming</style></title><secondary-title><style face="normal" font="default" size="100%">LPNMR</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%">27-37</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record></records></xml>