<?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%">Resce, Pierpaolo</style></author><author><style face="normal" font="default" size="100%">Vorwerk, Lukas</style></author><author><style face="normal" font="default" size="100%">Han, Zhiwei</style></author><author><style face="normal" font="default" size="100%">Cornacchia, Giuliano</style></author><author><style face="normal" font="default" size="100%">Alamdari, Omid Isfahani</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%">Weimer, Daniel</style></author><author><style face="normal" font="default" size="100%">Liu, Yuanting</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Connected Vehicle Simulation Framework for Parking Occupancy Prediction (Demo Paper)</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.3560995</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%">This paper demonstrates a simulation framework that collects data about connected vehicles' locations and surroundings in a realistic traffic scenario. Our focus lies on the capability to detect parking spots and their occupancy status. We use this data to train machine learning models that predict parking occupancy levels of specific areas in the city center of San Francisco. By comparing their performance to a given ground truth, our results show that it is possible to use simulated connected vehicle data as a base for prototyping meaningful AI-based applications.</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%">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>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%">Qureshi, Bilal</style></author><author><style face="normal" font="default" size="100%">Kamiran, Faisal</style></author><author><style face="normal" font="default" size="100%">Karim, Asim</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></authors></contributors><titles><title><style face="normal" font="default" size="100%">Causal inference for social discrimination reasoning</style></title><short-title><style face="normal" font="default" size="100%">Journal of Intelligent Information 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/04/01</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/article/10.1007/s10844-019-00580-x</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">54</style></volume><pages><style face="normal" font="default" size="100%">425 - 437</style></pages><isbn><style face="normal" font="default" size="100%">1573-7675</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The discovery of discriminatory bias in human or automated decision making is a task of increasing importance and difficulty, exacerbated by the pervasive use of machine learning and data mining. Currently, discrimination discovery largely relies upon correlation analysis of decisions records, disregarding the impact of confounding biases. We present a method for causal discrimination discovery based on propensity score analysis, a statistical tool for filtering out the effect of confounding variables. We introduce causal measures of discrimination which quantify the effect of group membership on the decisions, and highlight causal discrimination/favoritism patterns by learning regression trees over the novel measures. We validate our approach on two real world datasets. Our proposed framework for causal discrimination has the potential to enhance the transparency of machine learning with tools for detecting discriminatory bias both in the training data and in the learning algorithms.</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%">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%">Qureshi, Bilal</style></author><author><style face="normal" font="default" size="100%">Kamiran, Faisal</style></author><author><style face="normal" font="default" size="100%">Karim, Asim</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></authors></contributors><titles><title><style face="normal" font="default" size="100%">Causal inference for social discrimination reasoning</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Intelligent Information 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://link.springer.com/article/10.1007/s10844-019-00580-x</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">1–13</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The discovery of discriminatory bias in human or automated decision making is a task of increasing importance and difficulty, exacerbated by the pervasive use of machine learning and data mining. Currently, discrimination discovery largely relies upon correlation analysis of decisions records, disregarding the impact of confounding biases. We present a method for causal discrimination discovery based on propensity score analysis, a statistical tool for filtering out the effect of confounding variables. We introduce causal measures of discrimination which quantify the effect of group membership on the decisions, and highlight causal discrimination/favoritism patterns by learning regression trees over the novel measures. We validate our approach on two real world datasets. Our proposed framework for causal discrimination has the potential to enhance the transparency of machine learning with tools for detecting discriminatory bias both in the training data and in the learning algorithms.</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>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Cazabet, Rémy</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%">Challenges in community discovery on temporal networks</style></title><secondary-title><style face="normal" font="default" size="100%">Temporal Network Theory</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-23495-9_10</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pages><style face="normal" font="default" size="100%">181–197</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Community discovery is one of the most studied problems in network science. In recent years, many works have focused on discovering communities in temporal networks, thus identifying dynamic communities. Interestingly, dynamic communities are not mere sequences of static ones; new challenges arise from their dynamic nature. Despite the large number of algorithms introduced in the literature, some of these challenges have been overlooked or little studied until recently. In this chapter, we will discuss some of these challenges and recent propositions to tackle them. We will, among other topics, discuss of community events in gradually evolving networks, on the notion of identity through change and the ship of Theseus paradox, on dynamic communities in different types of networks including link streams, on the smoothness of dynamic communities, and on the different types of complexity of algorithms for their discovery. We will also list available tools and libraries adapted to work with this problem.</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%">Salvatore Citraro</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%">A complex network approach to semantic spaces: How meaning organizes itself</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%">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%">Giulio Rossetti</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%">Community Discovery in Dynamic Networks: a Survey</style></title><secondary-title><style face="normal" font="default" size="100%">Journal ACM Computing Surveys</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/citation.cfm?id=3172867</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">51</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Networks built to model real world phenomena are characeterised by some properties that have attracted the attention of the scientific community: (i) they are organised according to community structure and (ii) their structure evolves with time. Many researchers have worked on methods that can efficiently unveil substructures in complex networks, giving birth to the field of community discovery. A novel and challenging problem started capturing researcher interest recently: the identification of evolving communities. To model the evolution of a system, dynamic networks can be used: nodes and edges are mutable and their presence, or absence, deeply impacts the community structure that composes them. The aim of this survey is to present the distinctive features and challenges of dynamic community discovery, and propose a classification of published approaches. As a &quot;user manual&quot;, this work organizes state of art methodologies into a taxonomy, based on their rationale, and their specific instanciation. Given a desired definition of network dynamics, community characteristics and analytical needs, this survey will support researchers to identify the set of approaches that best fit their needs. The proposed classification could also help researchers to choose in which direction should future research be oriented. </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%">Qureshi, Bilal</style></author><author><style face="normal" font="default" size="100%">Kamiran, Faisal</style></author><author><style face="normal" font="default" size="100%">Karim, Asim</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%">Causal Discrimination Discovery Through Propensity Score Analysis</style></title><secondary-title><style face="normal" font="default" size="100%">arXiv preprint arXiv:1608.03735</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%">https://arxiv.org/abs/1608.03735</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Social discrimination is considered illegal and unethical in the modern world. Such discrimination is often implicit in observed decisions' datasets, and anti-discrimination organizations seek to discover cases of discrimination and to understand the reasons behind them. Previous work in this direction adopted simple observational data analysis; however, this can produce biased results due to the effect of confounding variables. In this paper, we propose a causal discrimination discovery and understanding approach based on propensity score analysis. The propensity score is an effective statistical tool for filtering out the effect of confounding variables. We employ propensity score weighting to balance the distribution of individuals from protected and unprotected groups w.r.t. the confounding variables. For each individual in the dataset, we quantify its causal discrimination or favoritism with a neighborhood-based measure calculated on the balanced distributions. Subsequently, the causal discrimination/favoritism patterns are understood by learning a regression tree. Our approach avoids common pitfalls in observational data analysis and make its results legally admissible. We demonstrate the results of our approach on two discrimination datasets.</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%">Luong, Binh Thanh</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%">Classification Rule Mining Supported by Ontology for Discrimination Discovery</style></title><secondary-title><style face="normal" font="default" size="100%">Data Mining Workshops (ICDMW), 2016 IEEE 16th 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%">Discrimination discovery from data consists of designing data mining methods for the actual discovery of discriminatory situations and practices hidden in a large amount of historical decision records. Approaches based on classification rule mining consider items at a flat concept level, with no exploitation of background knowledge on the hierarchical and inter-relational structure of domains. On the other hand, ontologies are a widespread and ever increasing means for expressing such a knowledge. In this paper, we propose a framework for discrimination discovery from ontologies, where contexts of prima-facie evidence of discrimination are summarized in the form of generalized classification rules at different levels of abstraction. Throughout the paper, we adopt a motivating and intriguing case study based on discriminatory tariffs applied by the U. S. Harmonized Tariff Schedules on imported goods.</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%">Barbara Furletti</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></authors></contributors><titles><title><style face="normal" font="default" size="100%">City users’ classification with mobile phone data</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Big Data</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%">11/2015</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Santa Clara (CA) - USA</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Nowadays mobile phone data are an actual proxy for studying the users’ social life and urban dynamics. In this paper we present the Sociometer, and analytical framework aimed at classifying mobile phone users into behavioral categories by means of their call habits. The analytical process starts from spatio-temporal profiles, learns the different behaviors, and returns annotated profiles. After the description of the methodology and its evaluation, we present an application of the Sociometer for studying city users of one small and one big city, evaluating the impact of big events in these cities.</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%">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>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Vinicius Monteiro de Lira</style></author><author><style face="normal" font="default" size="100%">Valéria Cesário Times</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</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%">ComeWithMe: An Activity-Oriented Carpooling Approach</style></title><secondary-title><style face="normal" font="default" size="100%">2015 {IEEE} 18th International Conference on Intelligent Transportation Systems</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%">09/2015</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1109/itsc.2015.414</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Institute of Electrical {&amp;} Electronics Engineers ({IEEE})</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The interest in carpooling is increasing due to the need to reduce traffic and noise pollution. Most of the available approaches and systems are route oriented, where driver and passengers are matched when the destination location is the same. ComeWithMe offers a new perspective: the destination is the intended activity instead of a location. This novel matching method is aimed to boost the possibilities of rides if passenger reaches a different location maintaining the activity. We conducted experiments using a real data set of trajectories and our results showed that the proposed matching algorithm improved the traditional carpooling approach in more than 80%.</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%">Luca Pappalardo</style></author><author><style face="normal" font="default" size="100%">Riivo Kikas</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%">Marlon Dumas</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Community-centric analysis of user engagement in Skype social network</style></title><secondary-title><style face="normal" font="default" size="100%">International conference on Advances in Social Network Analysis and Mining</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://dl.acm.org/citation.cfm?doid=2808797.2809384</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><isbn><style face="normal" font="default" size="100%">978-1-4503-3854-7</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%">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>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Lucia Passaro</style></author><author><style face="normal" font="default" size="100%">Lebani, Gianluca E</style></author><author><style face="normal" font="default" size="100%">Pollacci, Laura</style></author><author><style face="normal" font="default" size="100%">Chersoni, Emmanuele</style></author><author><style face="normal" font="default" size="100%">Lenci, Alessandro</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The CoLing Lab system for Sentiment Polarity Classification of tweets</style></title><secondary-title><style face="normal" font="default" size="100%">First Italian Conference on Computational Linguistics CLiC-it 2014 &amp; Fourth International Workshop EVALITA 2014</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%">II</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><num-vols><style face="normal" font="default" size="100%">2</style></num-vols></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%">Salvatore Ruggieri</style></author><author><style face="normal" font="default" size="100%">Eirinakis, Pavlos</style></author><author><style face="normal" font="default" size="100%">Subramani, K</style></author><author><style face="normal" font="default" size="100%">Wojciechowski, Piotr</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">On the complexity of quantified linear systems</style></title><secondary-title><style face="normal" font="default" size="100%">Theoretical Computer 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%">518</style></volume><pages><style face="normal" font="default" size="100%">128–134</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 explore the computational complexity of the conjunctive fragment of the first-order theory of linear arithmetic. Quantified propositional formulas of linear inequalities with (k−1) quantifier alternations are log-space complete in ΣkP or ΠkP depending on the initial quantifier. We show that when we restrict ourselves to quantified conjunctions of linear inequalities, i.e., quantified linear systems, the complexity classes collapse to polynomial time. In other words, the presence of universal quantifiers does not alter the complexity of the linear programming problem, which is known to be in P. Our result reinforces the importance of sentence formats from the perspective of computational 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%">Alina Sirbu</style></author><author><style face="normal" font="default" size="100%">Vittorio Loreto</style></author><author><style face="normal" font="default" size="100%">Vito D P Servedio</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%">Cohesion, consensus and extreme information in opinion dynamics</style></title><secondary-title><style face="normal" font="default" size="100%">Advances in Complex Systems</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://www.worldscientific.com/doi/abs/10.1142/S0219525913500355</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">06</style></number><volume><style face="normal" font="default" size="100%">16</style></volume><pages><style face="normal" font="default" size="100%">1350035</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 Pappalardo</style></author><author><style face="normal" font="default" size="100%">Filippo Simini</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%">Comparing General Mobility and Mobility by Car</style></title><secondary-title><style face="normal" font="default" size="100%">Computational Intelligence and 11th Brazilian Congress on Computational Intelligence (BRICS-CCI CBIC), 2013 BRICS Congress on</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%">Sept</style></date></pub-dates></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%">Vania Bogorny</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Artur Ribeiro de Aquino</style></author><author><style face="normal" font="default" size="100%">Fernando de Lucca Siqueira</style></author><author><style face="normal" font="default" size="100%">Luis Otavio Alvares</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">CONSTAnT - A Conceptual Data Model for Semantic Trajectories of Moving Objects </style></title><secondary-title><style face="normal" font="default" size="100%">Transaction in GIS</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%">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%">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%">A classification for community discovery methods in complex networks</style></title><secondary-title><style face="normal" font="default" size="100%">Statistical Analysis and Data Mining</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%">5</style></number><volume><style face="normal" font="default" size="100%">4</style></volume><pages><style face="normal" font="default" size="100%">512-546</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%">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>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%">Heather J Ruskin</style></author><author><style face="normal" font="default" size="100%">Martin Crane</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Comparison of evolutionary algorithms in gene regulatory network model inference.</style></title><secondary-title><style face="normal" font="default" size="100%">BMC Bioinformatics</style></secondary-title><alt-title><style face="normal" font="default" size="100%">BMC Bioinformatics</style></alt-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2010</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">11</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%">&lt;p&gt;&lt;b&gt;BACKGROUND: &lt;/b&gt;The evolution of high throughput technologies that measure gene expression levels has created a data base for inferring GRNs (a process also known as reverse engineering of GRNs). However, the nature of these data has made this process very difficult. At the moment, several methods of discovering qualitative causal relationships between genes with high accuracy from microarray data exist, but large scale quantitative analysis on real biological datasets cannot be performed, to date, as existing approaches are not suitable for real microarray data which are noisy and insufficient.&lt;/p&gt;&lt;p&gt;&lt;b&gt;RESULTS: &lt;/b&gt;This paper performs an analysis of several existing evolutionary algorithms for quantitative gene regulatory network modelling. The aim is to present the techniques used and offer a comprehensive comparison of approaches, under a common framework. Algorithms are applied to both synthetic and real gene expression data from DNA microarrays, and ability to reproduce biological behaviour, scalability and robustness to noise are assessed and compared.&lt;/p&gt;&lt;p&gt;&lt;b&gt;CONCLUSIONS: &lt;/b&gt;Presented is a comparison framework for assessment of evolutionary algorithms, used to infer gene regulatory networks. Promising methods are identified and a platform for development of appropriate model formalisms is established.&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%">Alina Sirbu</style></author><author><style face="normal" font="default" size="100%">Heather J Ruskin</style></author><author><style face="normal" font="default" size="100%">Martin Crane</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Cross-platform microarray data normalisation for regulatory network inference.</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%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2010</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">5</style></volume><pages><style face="normal" font="default" size="100%">e13822</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;&lt;b&gt;BACKGROUND: &lt;/b&gt;Inferring Gene Regulatory Networks (GRNs) from time course microarray data suffers from the dimensionality problem created by the short length of available time series compared to the large number of genes in the network. To overcome this, data integration from diverse sources is mandatory. Microarray data from different sources and platforms are publicly available, but integration is not straightforward, due to platform and experimental differences.&lt;/p&gt;&lt;p&gt;&lt;b&gt;METHODS: &lt;/b&gt;We analyse here different normalisation approaches for microarray data integration, in the context of reverse engineering of GRN quantitative models. We introduce two preprocessing approaches based on existing normalisation techniques and provide a comprehensive comparison of normalised datasets.&lt;/p&gt;&lt;p&gt;&lt;b&gt;CONCLUSIONS: &lt;/b&gt;Results identify a method based on a combination of Loess normalisation and iterative K-means as best for time series normalisation for this problem.&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%">Francesco Bonchi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Claudio Lucchese</style></author><author><style face="normal" font="default" size="100%">Salvatore Orlando</style></author><author><style face="normal" font="default" size="100%">Raffaele Perego</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 constraint-based querying system for exploratory pattern discovery</style></title><secondary-title><style face="normal" font="default" size="100%">Inf. Syst.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">34</style></volume><pages><style face="normal" font="default" size="100%">3-27</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%">Francesco Bonchi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Claudio Lucchese</style></author><author><style face="normal" font="default" size="100%">Salvatore Orlando</style></author><author><style face="normal" font="default" size="100%">Raffaele Perego</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 constraint-based querying system for exploratory pattern discovery</style></title><secondary-title><style face="normal" font="default" size="100%">Inf. Syst.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">34</style></volume><pages><style face="normal" font="default" size="100%">3-27</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%">Valerio Grossi</style></author><author><style face="normal" font="default" size="100%">Andrea Romei</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%">A Case Study in Sequential Pattern Mining for IT-Operational Risk</style></title><secondary-title><style face="normal" font="default" size="100%">ECML/PKDD (1)</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%">424-439</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%">Monica Wachowicz</style></author><author><style face="normal" font="default" size="100%">Arend Ligtenberg</style></author><author><style face="normal" font="default" size="100%">Chiara Renso</style></author><author><style face="normal" font="default" size="100%">Seda F. Gürses</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Characterising the Next Generation of Mobile Applications Through a Privacy-Aware Geographic Knowledge Discovery Process</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><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><pages><style face="normal" font="default" size="100%">39-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%">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%">Francesco Bonchi</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Claudio Lucchese</style></author><author><style face="normal" font="default" size="100%">Salvatore Orlando</style></author><author><style face="normal" font="default" size="100%">Raffaele Perego</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%">ConQueSt: a Constraint-based Querying System for Exploratory Pattern Discovery</style></title><secondary-title><style face="normal" font="default" size="100%">ICDE</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><pages><style face="normal" font="default" size="100%">159</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%">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>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%">Jan-Georg Smaus</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Characterisations of Termination in Logic Programming</style></title><secondary-title><style face="normal" font="default" size="100%">Program Development in Computational Logic</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%">376-431</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%">S Rinzivillo</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%">Classification in Geographical Information Systems</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%">2004</style></year></dates><pages><style face="normal" font="default" size="100%">374-385</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%">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>17</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%">Jan-Georg Smaus</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Classes of terminating logic programs</style></title><secondary-title><style face="normal" font="default" size="100%">TPLP</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</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%">369-418</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>17</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%">Jan-Georg Smaus</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Classes of Terminating Logic Programs</style></title><secondary-title><style face="normal" font="default" size="100%">CoRR</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><volume><style face="normal" font="default" size="100%">cs.LO/0106</style></volume><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%">Fosca Giannotti</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%">Complex Reasoning on Geographical 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%">331-338</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%">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%">Complex Reasoning on Geographical 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%">331-338</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%">Patrizia Asirelli</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%">The Constraint Operator of MedLan: Its Efficient Implementation and Use</style></title><secondary-title><style face="normal" font="default" size="100%">IICIS</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%">41-55</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%">Krzysztof R. Apt</style></author><author><style face="normal" font="default" size="100%">Maurizio Gabbrielli</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 Closer Look at Declarative Interpretations</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%">1996</style></year></dates><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">28</style></volume><pages><style face="normal" font="default" size="100%">147-180</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%">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%">A Case Study in Logic Program Verification: the Vanilla Metainterpreter</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%">643-654</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>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></records></xml>