=Paper=
{{Paper
|id=None
|storemode=property
|title=None
|pdfUrl=https://ceur-ws.org/Vol-841/talkTruta.pdf
|volume=Vol-841
}}
==None==
<pdf width="1500px">https://ceur-ws.org/Vol-841/talkTruta.pdf</pdf>
<pre>
           K-Anonymity in Social Networks: A Clustering Approach

                                         Traian Marius Truta

                                  Associate Professor of Computer Science
                                       Northen Kentucky University


                                                         besides the attribute values that characterize
                                                         them, also have relationships with other
                                                         entities, the risk of disclosure increases. In this
                                                         talk we present a greedy algorithm for
                                                         anonymizing a social network and a measure
                                                         that quantifies the information loss in the
                                                         anonymization       process     due    to     edge
                                                         generalization.



                                                         Biographical Sketch
                                                         Traian Marius Truta is an associate professor of
                                                         Computer Science at Northern Kentucky
                                                         University. He received his Ph.D. in computer
                                                         science from Wayne State University in 2004.
Abstract                                                 His major areas of expertise are data privacy
The proliferation of social networks, where              and anonymity, privacy in statistical databases,
individuals share private information, has               and data management. He has served on the
caused, in the last few years, a growth in the           program committee of various conferences
volume of sensitive data being stored in these           such as International Conference on Database
networks. As users subscribe to more services            and Expert Systems Applications (DEXA), Pacific-
and connect more with their friends, families,           Asia Conference on Knowledge Discovery and
and colleagues, the desire to use this                   Data Mining (PAKDD), ACM Symposium of
information from the networks has increased.             Applied Computing (SAC), and International
Online social interaction has become very                Symposium on Data, Privacy, and E-Commerce
popular around the globe and most sociologists           (ISDPE). He received the Yahoo Research! Best
agree that this will not fade away. Social               Paper Award for Privacy, Security, and Trust in
network sites gather confidential information            KDD 2008 (PinKDD) for the paper “A Clustering
from their users (for instance, the social               Approach for Data and Structural Anonymity in
network      site     PacientsLikeMe      collects       Social Networks” in 2008. For more
confidential health information) and, as a result,       information, including the list of research
social network data has begun to be analyzed             publications             please             see:
from a different, specific privacy perspective.          http://www.nku.edu/~trutat1/research.html.
Since the individual entities in social networks,

</pre>