| 1. |
- Stokes, Klara, et al.
(författare)
-
On some clustering approaches for graphs
- 2011
-
Ingår i: Fuzzy Systems (FUZZ), 2011. - : IEEE. - 9781424473151 - 9781424473168 - 9781424473175 ; , s. 409-415
-
Konferensbidrag (refereegranskat)abstract
- In this paper we discuss some tools for graph perturbation with applications to data privacy. We present and analyse two different approaches. One is based on matrix decomposition and the other on graph partitioning. We discuss these methods and show that they belong to two traditions in data protection: noise addition/microaggregation and k-anonymity.
|
|
| 2. |
- Stokes, Klara, et al.
(författare)
-
On the Relationship Between Clustering and Coding Theory
- 2012
-
Ingår i: 2012 IEEE International Conference on Fuzzy Systems. - : IEEE. - 9781467315074 - 9781467315050 - 9781467315067 ; , s. Article number 6250783-
-
Konferensbidrag (refereegranskat)abstract
- In this paper we discuss the relations between clustering and error correcting codes. We show that clustering can be used for constructing error correcting codes. We review the previous works found in the literature about this issue, and propose a modification of a previous work that can be used for code construction from a set of proposed codewords.
|
|
| 3. |
- Stokes, Klara, et al.
(författare)
-
Reidentification and k-anonymity : a model for disclosure risk in graphs
- 2012
-
Ingår i: Soft Computing - A Fusion of Foundations, Methodologies and Applications. - : Springer. - 1432-7643 .- 1433-7479. ; 16:10, s. 1657-1670
-
Tidskriftsartikel (refereegranskat)abstract
- In this article we provide a formal framework for reidentification in general. We define n-confusion as a concept for modeling the anonymity of a database table and we prove that n-confusion is a generalization of k-anonymity. After a short survey on the different available definitions of k-anonymity for graphs we provide a new definition for k-anonymous graph, which we consider to be the correct definition. We provide a description of the k-anonymous graphs, both for the regular and the non-regular case. We also introduce the more flexible concept of (k, l)-anonymous graph. Our definition of (k, l)-anonymous graph is meant to replace a previous definition of (k, l)-anonymous graph, which we here prove to have severe weaknesses. Finally, we provide a set of algorithms for k-anonymization of graphs.
|
|
