<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author><author><style face="normal" font="default" size="100%">Ruggero G. Pensa</style></author><author><style face="normal" font="default" size="100%">Fabio Pinelli</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Anonymity preserving sequential pattern mining</style></title><secondary-title><style face="normal" font="default" size="100%">Artif. Intell. Law</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/s10506-014-9154-6</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">22</style></volume><pages><style face="normal" font="default" size="100%">141–173</style></pages><abstract><style face="normal" font="default" size="100%">The increasing availability of personal data of a sequential nature, such as time-stamped transaction or location data, enables increasingly sophisticated sequential pattern mining techniques. However, privacy is at risk if it is possible to reconstruct the identity of individuals from sequential data. Therefore, it is important to develop privacy-preserving techniques that support publishing of really anonymous data, without altering the analysis results significantly. In this paper we propose to apply the Privacy-by-design paradigm for designing a technological framework to counter the threats of undesirable, unlawful effects of privacy violation on sequence data, without obstructing the knowledge discovery opportunities of data mining technologies. First, we introduce a k-anonymity framework for sequence data, by defining the sequence linking attack model and its associated countermeasure, a k-anonymity notion for sequence datasets, which provides a formal protection against the attack. Second, we instantiate this framework and provide a specific method for constructing the k-anonymous version of a sequence dataset, which preserves the results of sequential pattern mining, together with several basic statistics and other analytical properties of the original data, including the clustering structure. A comprehensive experimental study on realistic datasets of process-logs, web-logs and GPS tracks is carried out, which empirically shows how, in our proposed method, the protection of privacy meets analytical utility.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ruggero G. Pensa</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Fabio Pinelli</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Anonymous Sequences from Trajectory Data</style></title><secondary-title><style face="normal" font="default" size="100%">17th Italian Symposium on Advanced Database Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><edition><style face="normal" font="default" size="100%">17</style></edition><pub-location><style face="normal" font="default" size="100%">Camogli, Italy</style></pub-location></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michele Coscia</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Ruggero G. Pensa</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Social Network Analysis as Knowledge Discovery Process: A Case Study on Digital Bibliography</style></title><secondary-title><style face="normal" font="default" size="100%">ASONAM</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><pages><style face="normal" font="default" size="100%">279-283</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michele Coscia</style></author><author><style face="normal" font="default" size="100%">Fosca Giannotti</style></author><author><style face="normal" font="default" size="100%">Ruggero G. Pensa</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Social Network Analysis as Knowledge Discovery Process: A Case Study on Digital Bibliography</style></title><secondary-title><style face="normal" font="default" size="100%">ASONAM</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><pages><style face="normal" font="default" size="100%">279-283</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%">Ruggero G. Pensa</style></author><author><style face="normal" font="default" size="100%">Anna Monreale</style></author><author><style face="normal" font="default" size="100%">Fabio Pinelli</style></author><author><style face="normal" font="default" size="100%">Dino Pedreschi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Pattern-Preserving k-Anonymization of Sequences and its Application to Mobility Data Mining</style></title><secondary-title><style face="normal" font="default" size="100%">PiLBA</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://air.unimi.it/retrieve/handle/2434/52786/106397/ProceedingsPiLBA08.pdf#page=44</style></url></web-urls></urls><abstract><style face="normal" font="default" size="100%">Sequential pattern mining is a major research field in knowledge
discovery and data mining. Thanks to the increasing availability of
transaction data, it is now possible to provide new and improved services
based on users’ and customers’ behavior. However, this puts the citizen’s
privacy at risk. Thus, it is important to develop new privacy-preserving
data mining techniques that do not alter the analysis results significantly.
In this paper we propose a new approach for anonymizing sequential
data by hiding infrequent, and thus potentially sensible, subsequences.
Our approach guarantees that the disclosed data are k-anonymous and
preserve the quality of extracted patterns. An application to a real-world
moving object database is presented, which shows the effectiveness of our
approach also in complex contexts.</style></abstract></record></records></xml>