Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 15
Encontrada(s) 1 página(s)

e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Ethnicity and neighbourhood attainment in England and Wales: A study of second generations' spatial integration

  • Zuccotti, Carolina Viviana
Ethnic minorities' spatial concentration and their predominance in deprived areas are two well-known patterns that characterise Britain's social landscape. However, little is known about ethnic minorities' opportunities for spatial integration, especially those of the second generations. Using a large-scale longitudinal data set of England and Wales covering a 40-year period (1971-2011), in combination with aggregated census data, the article examines ethnic inequalities in access to neighbourhoods with varying levels of ethnic concentration and deprivation. On equality of individual, social origin, and childhood neighbourhood characteristics, second generation ethnic minorities are less likely than White British individuals to reside in "whiter" and less deprived neighbourhoods. For most minorities, these differences reduce among those with higher education and a higher social class, in line with weak place stratification/ethnic enclave. Growing up in areas with high ethnic concentration and high deprivation has a particularly strong "retention effect" among second generation Asians. The study shows that ethnic spatial segregation is, in part, the product of time-persisting ethnic inequalities in the access to neighbourhoods and that these inequalities are conditioned both by childhood and by adult resources., The research leading to these results has received funding from the European Union's 7th Framework Programme (FP7/2007-2013) under grant agreement n° 262608, DwB - Data without Boundaries.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Spherical microaggregation: Anonymizing sparse vector spaces

  • Abril, Daniel
  • Navarro-Arribas, Guillermo
  • Torra, Vicenç
Unstructured texts are a very popular data type and still widely unexplored in the privacy preserving data mining field. We consider the problem of providing public information about a set of confidential documents. To that end we have developed a method to protect a Vector Space Model (VSM), to make it public even if the documents it represents are private. This method is inspired by microaggregation, a popular protection method from statistical disclosure control, and adapted to work with sparse and high dimensional data sets. © 2014 Elsevier Ltd. All rights reserved., Partial supports by the Spanish MEC projects (ARES-CONSOLIDER INGENIO 2010 CSD2007-00004, COPRIVACY TIN2011- 27076-C03-03 and N-KHRONOUS TIN2010-15764) and by the EC (FP7/2007-2013) Data without Boundaries (grant agreement number 262608) are acknowledged. The work contributed by the first author was carried out as part of the Computer Science Ph.D. program of the Universitat Autonoma de Barcelona (UAB), Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

A Simple Experiment to Guide the Design of a Preference Model

  • Armengol, Eva
  • Puyol-Gruart, Josep
Preferences are part of every day life driving to choice and action. We consider that there is a gap between preferences expressed by people and those we can find in the repositories. In this paper we explore a small set of preferences in the domain of movies, given by humans, in order to understand the expressive possibilities of some languages appearing in the literature: conditional logics and reward logics. After some experiments we contribute with a proposal for reasoning about preferences. © 2015 The authors and IOS Press. All rights reserved., The authors also acknowledge support by the Spanish MICINN projects EdeTRI (TIN2012-39348-C02-01), and MILESS (TIN2013-45039-P), the European Project DwB (GA Number 262608), and the grant 2009SGR-1434 from the Generalitat de Catalunya., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Graphic sequences, distances and k-degree anonymity

  • Salas, Julian
  • Torra, Vicenç
In this paper we study conditions to approximate a given graph by a regular one. We obtain optimal conditions for a few metrics such as the edge rotation distance for graphs, the rectilinear and the Euclidean distance over degree sequences. Then, we require the approximation to have at least k copies of each value in the degree sequence, this is a property proceeding from data privacy that is called k-degree anonymity. We give a sufficient condition in order for a degree sequence to be graphic that depends only on its length and its maximum and minimum degrees. Using this condition we give an optimal solution of k-degree anonymity for the Euclidean distance when the sum of the degrees in the anonymized degree sequence is even. We present algorithms that may be used for obtaining all the mentioned anonymizations. © 2015 Elsevier B.V. All rights reserved., Partial support by the Spanish MEC projects ARES (CONSOLIDER INGENIO 2010 CSD 2007-00004), ICWT (TIN2012-32757) and COPRIVACY (TIN2011-27076-C03-03) is acknowledged. Partial support of the European Project DwB (GrantAgreement Number 262608) is also acknowledged., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

Generalization-Based k-Anonymization

  • Armengol, Eva
  • Torra, Vicenç
Microaggregation is an anonymization technique consisting on partitioning the data into clusters no smaller than k elements and then replacing the whole cluster by its prototypical representant. Most of microaggregation techniques work on numerical attributes. However, many data sets are described by heterogeneous types of data, i.e., nu- merical and categorical attributes. In this paper we propose a new mi- croaggregation method for achieving a compliant k-anonymous masked file for categorical microdata based on generalization. The goal is to build a generalized description satisfied by at least k domain objects and to replace these domain objects by the description. The way to construct that generalization is similar that the one used in growing decision trees. Records that cannot be generalized satisfactorily are discarded, therefore some information is lost. In the experiments we performed we prove that the new approach gives good results. © Springer International Publishing Switzerland 2015., This research is partially funded by the Spanish MICINN projects COGNITIO (TIN-2012-38450-C03-03), EdeTRI (TIN2012-39348-C02-01) and COPRIVACY (TIN2011-27076-C03-03), the grant 2009-SGR-1434 from the Generalitat de Catalunya, and the European Project DwB (Grant Agreement Number 262608), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

An evolutionary algorithm to enhance multivariate Post-Randomization Method (PRAM) protections

  • Marés, Jordi
  • Torra, Vicenç
The amount of public statistical information available is growing and more accurate protection methods are needed in order to achieve data confidentiality. The Post-Randomization Method (PRAM) protection method was introduced in 1997 as a very powerful method for categorical microdata, but it is still not widely used. This method has a Markov matrix as a parameter. The main problem of the application of this method is that it is difficult to find a good Markov matrix that performs changes in the microdata file producing low loss of valuable information and low risk of disclosure of sensitive data. In this paper we present a methodology that helps us to find a matrix to perform better protections. This is achieved by using an evolutionary algorithm with integrated Information Loss and Disclosure Risk measures. Experiments using three different datasets are also presented in order to empirically evaluate the application of this technique. © 2014 Elsevier Inc. All rights reserved., This work has been done under the PhD in Computer Science program of the Universitat Autònoma de Barcelona (UAB). It is also partially supported by the Spanish MEC ARES-CONSOLIDER INGENIO 2010 CSD2007-00004, and COPRIVACY TIN2011-27076-C03-03. The research leading to these results has also received funding from the European Union’s Seventh Framework Programme (FP7/2007-2013) under Grant Agreement Num. 262608., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

Aprendizaje supervisado para el enlace de registros a través de la media ponderada

  • Abril, Daniel
  • Navarro-Arribas, Guillermo
  • Torra, Vicenç
En el área de la privacidad de datos, las técnicas para el enlace de registros son utilizadas para evaluar el riesgo de revelación de un conjunto de datos protegido. La idea principal detrás de estas técnicas es enlazar registros que hacen referencia a un mismo individuo, entre diferentes bases de datos. En este trabajo se presenta una variación del enlace de registros basada en una media ponderada para calcular distancias entre registros. Mediante el uso de un método supervisado de aprendizaje nuestra propuesta permite determinar cuáles son los pesos que maximizan el número de enlaces entre los registros de la base de datos original y su versión protegida. El resultado de este trabajo se aplica en la estimación del riesgo de revelación de datos protegidos., Esta investigacion esta parcialmente financiada por el MICINN (proyectos ARES-CONSOLIDER INGENIO 2010 CSD2007-00004, TIN2010-15764 y TIN2011-27076-C03-03) y por by the EC (FP7/2007-2013) Data without Boundaries (numero de subvencion 262608). Algunos de los resultados presentados en este artıculo han sido obtenidos gracias al Centro de Supercomputacion de Galicia (CESGA). El trabajo contribuido por el primer autor ha sido parte de un programa de doctorado en Informatica de la Universidad Autonoma de Barcelona (UAB)., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Supervised learning using a symmetric bilinear form for record linkage

  • Abril, Daniel
  • Torra, Vicenç
  • Navarro-Arribas, Guillermo
© 2014 Elsevier B.V. All rights reserved. Record Linkage is used to link records of two different files corresponding to the same individuals. These algorithms are used for database integration. In data privacy, these algorithms are used to evaluate the disclosure risk of a protected data set by linking records that belong to the same individual. The degree of success when linking the original (unprotected data) with the protected data gives an estimation of the disclosure risk. In this paper we propose a new parameterized aggregation operator and a supervised learning method for disclosure risk assessment. The parameterized operator is a symmetric bilinear form and the supervised learning method is formalized as an optimization problem. The target of the optimization problem is to find the values of the aggregation parameters that maximize the number of re-identification (or correct links). We evaluate and compare our proposal with other non-parametrized variations of record linkage, such as those using the Mahalanobis distance and the Euclidean distance (one of the most used approaches for this purpose). Additionally, we also compare it with other previously presented parameterized aggregation operators for record linkage such as the weighted mean and the Choquet integral. From these comparisons we show how the proposed aggregation operator is able to overcome or at least achieve similar results than the other parameterized operators. We also study which are the necessary optimization problem conditions to consider the described aggregation functions as metric functions., Partial supports by the Spanish MICINN (projects ARES-CONSOLIDER INGENIO 2010 CSD2007-00004, TIN2010-15764 and TIN2011-27076-C03-03) and by the European Commission (EC) (FP7/2007-2013) Data without Boundaries (Grant agreement number 262608) are acknowledged. Some results described in this paper have been obtained using the Centro de Supercomputación de Galicia (CESGA). This partial support is gratefully acknowledged.The work contributed by the first author was carried out as part of the Computer Science Ph.D. program of the Universitat Autònoma de Barcelona (UAB), Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Data privacy using an evolutionary algorithm for invariant PRAM matrices

  • Marés, Jordi
  • Shlomo, Natalie
Dissemination of data with sensitive information has an implicit risk of unauthorized disclosure. Several masking methods have been developed in order to protect the data without the loss of too much information. One such method is the Post Randomization Method (PRAM) based on perturbations of a categorical variable according to a Markov probability transition matrix. The method has the drawback that it is difficult to find an optimal transition matrix to perform perturbations and maximize data utility. An evolutionary algorithm which generates an optimal probability transition matrix is proposed. Optimality is with respect to a pre-defined fitness function dependent on the aspects of the data that need to be preserved following perturbation. The algorithm embeds two properties: the invariance of the transition matrix to preserve marginal totals in expectation, and the control of diagonal probabilities which determine the amount of perturbation. Experimental results using a real data set are presented in order to illustrate and empirically evaluate the application of this algorithm. © 2014 Elsevier Ireland Ltd. All rights reserved., This work has been carried out under the Ph.D. in Computer Science program of the Universitat Autònoma de Barcelona (UAB). It is also partially supported by the Spanish MECARES-CONSOLIDER INGENIO2010 CSD2007-00004, and COPRIVACY TIN2011-27076-03-03. The research was also funded by the European Union’s Seventh Framework infrastructure research grant:262608, Data Without Boundaries (DwB)., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

On the protection of social networks user's information

  • Marés, Jordi
  • Torra, Vicenç
Social networks have become an essential ingredient of interpersonal communication in the modern world. They enable users to express and share common interests, comment upon everyday events with all the people with whom they are connected. Indeed, the growth of social media has been rapid and has resulted in the adoption of social networks to meet specific communities of interest. However, this shared information space can prove to be dangerous in respect of user privacy issues. In addition to explicit >posts> there is much implicit semantic information that is not explicitly given in the posts that the user shares. For these and other reasons, the protection of information pertaining to each user needs to be supported. In this paper, we present a novel approach wherein the extraction of implicit and explicit information is derived from a small sample of a popular social network (Twitter) that seeks also to preserve user's privacy whilst maintaining information utility. © 2013 Elsevier B.V. All rights reserved., This work has been done under the PhD in Computer Science program of the Universitat Autònoma de Barcelona (UAB). It is also partially supported by the Spanish MEC ARES-CONSOLIDER INGENIO 2010 CSD2007-00004, and COPRIVACY TIN2011-27076-C03-03. The research leading to these results has also received funding from the European Union’s Seventh Framework Programme (FP7/2007-2013) under Grant Agreement Num. 262608, Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Improving record linkage with supervised learning for disclosure risk assessment

  • Abril, Daniel
  • Navarro-Arribas, Guillermo
  • Torra, Vicenç
In data privacy, record linkage can be used as an estimator of the disclosure risk of protected data. To model the worst case scenario one normally attempts to link records from the original data to the protected data. In this paper we introduce a parametrization of record linkage in terms of a weighted mean and its weights, and provide a supervised learning method to determine the optimum weights for the linkage process. That is, the parameters yielding a maximal record linkage between the protected and original data. We compare our method to standard record linkage with data from several protection methods widely used in statistical disclosure control, and study the results taking into account the performance in the linkage process, and its computational effort. © 2011 Elsevier B.V. All rights reserved., Partial support by the Spanish MICINN (projects TSI2007-65406-C03-02, TIN2010-15764, ARES-CONSOLIDER INGENIO 2010 CSD2007-00004), and European Commission (project Data without Boundaries (DwB), Grant Agreement Number 262608) is acknowledged., Peer Reviewed
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Supervised learning using a symmetric bilinear form for record linkage

  • Abril Castellano, Daniel
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
Record Linkage is used to link records of two different files corresponding to the same individuals. These algorithms are used for database integration. In data privacy, these algorithms are used to evaluate the disclosure risk of a protected data set by linking records that belong to the same individual. The degree of success when linking the original (unprotected data) with the protected data gives an estimation of the disclosure risk. In this paper we propose a new parameterized aggregation operator and a supervised learning method for disclosure risk assessment. The parameterized operator is a symmetric bilinear form and the supervised learning method is formalized as an optimization problem. The target of the optimization problem is to find the values of the aggregation parameters that maximize the number of re-identification (or correct links). We evaluate and compare our proposal with other non-parametrized variations of record linkage, such as those using the Mahalanobis distance and the Euclidean distance (one of the most used approaches for this purpose). Additionally, we also compare it with other previously presented parameterized aggregation operators for record linkage such as the weighted mean and the Choquet integral. From these comparisons we show how the proposed aggregation operator is able to overcome or at least achieve similar results than the other parameterized operators. We also study which are the necessary optimization problem conditions to consider the described aggregation functions as metric functions.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Spherical microaggregation, anonymizing sparse vector spaces

  • Abril Castellano, Daniel
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
  • Torra i Reventós, Vicenç|||0000-0002-0368-8037
Unstructured texts are a very popular data type and still widely unexplored in the privacy preserving data mining field. We consider the problem of providing public information about a set of confidential documents. To that end we have developed a method to protect a Vector Space Model (VSM), to make it public even if the documents it represents are private. This method is inspired by microaggregation, a popular protection method from statistical disclosure control, and adapted to work with sparse and high dimensional data sets.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Data privacy

  • Torra i Reventós, Vicenç|||0000-0002-0368-8037
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
Data privacy studies methods, tools, and theory to avoid the disclosure of sensitive information. Its origin is in statistics with the goal to ensure the confidentiality of data gathered from census and questionnaires. The topic was latter introduced in computer science and more particularly in data mining, where due to the large amount of data currently available, has attracted the interest of researchers, practitioners, and companies. In this paper we will review the main topics related to data privacy and privacy-enhancing technologies.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A bloom filter based model for decentralized authorization

  • Foley, Simon N.
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
A decentralized authorization mechanism is proposed that uses Bloom filters to implement authorization delegation. This lightweight mechanism is unlike conventional approaches that typically rely on public key certificates to implement distributed delegation. In taking an approach based on one-way hash functions, the mechanism may be preferable for use in computationally constrained environments where public-key cryptography is not desirable.