Preserving structural properties in anonymization of social networks

A social network is a collection of social entities and the relations among them. Collection and sharing of such network data for analysis raise significant privacy concerns for the involved individuals, especially when human users are involved. To address such privacy concerns, several techniques,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Masoumzadeh, A, Joshi, J
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 10
container_issue
container_start_page 1
container_title
container_volume
creator Masoumzadeh, A
Joshi, J
description A social network is a collection of social entities and the relations among them. Collection and sharing of such network data for analysis raise significant privacy concerns for the involved individuals, especially when human users are involved. To address such privacy concerns, several techniques, such as k-anonymity based approaches, have been proposed in the literature. However, such approaches introduce a large amount of distortion to the original social network graphs, thus raising serious questions about their utility for useful social network analysis. Consequently, these techniques may never be applied in practice. In this paper, we emphasize the use of network structural semantics in the social network analysis theory to address this problem. We propose an approach for enhancing anonymization techniques that preserves the structural semantics of the original social network by using the notion of roles and positions. We present experimental results that demonstrate that our approach can significantly help in preserving graph and social network theoretic properties of the original social networks, and hence improve utility of the anonymized data.
doi_str_mv 10.4108/icst.collaboratecom.2010.7
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5767000</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5767000</ieee_id><sourcerecordid>5767000</sourcerecordid><originalsourceid>FETCH-LOGICAL-i1427-a0202d15a8403cd084cf45463bd7e328778a469a88f1c1c038a045c829ffd5c23</originalsourceid><addsrcrecordid>eNotj7tKBDEYRmMhKOs8gU2wn_HPPSllvcKCFlov2Uwi0ZlkSLLK-vQuaPUV53DgQ-iKwMAJ6Ovoahtcnia7y8U27_I8UDhSdYI6o7SRzBgjKJdnqKv1AwCIkVoROEe3L8VXX75iese1lb1r-2InvJS8-NKirzgmbFNOhzn-2BZzwjngml08Wsm371w-6wU6DXaqvvvfFXq7v3tdP_ab54en9c2mj4RT1VugQEcirObA3Aiau8AFl2w3Ks-oVkpbLo3VOhBHHDBtgQunqQlhFI6yFbr860bv_XYpcbblsBVKquMl9gv2jE-h</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Preserving structural properties in anonymization of social networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Masoumzadeh, A ; Joshi, J</creator><creatorcontrib>Masoumzadeh, A ; Joshi, J</creatorcontrib><description>A social network is a collection of social entities and the relations among them. Collection and sharing of such network data for analysis raise significant privacy concerns for the involved individuals, especially when human users are involved. To address such privacy concerns, several techniques, such as k-anonymity based approaches, have been proposed in the literature. However, such approaches introduce a large amount of distortion to the original social network graphs, thus raising serious questions about their utility for useful social network analysis. Consequently, these techniques may never be applied in practice. In this paper, we emphasize the use of network structural semantics in the social network analysis theory to address this problem. We propose an approach for enhancing anonymization techniques that preserves the structural semantics of the original social network by using the notion of roles and positions. We present experimental results that demonstrate that our approach can significantly help in preserving graph and social network theoretic properties of the original social networks, and hence improve utility of the anonymized data.</description><identifier>EISBN: 9789639995246</identifier><identifier>EISBN: 0984589325</identifier><identifier>EISBN: 963999524X</identifier><identifier>EISBN: 9780984589326</identifier><identifier>DOI: 10.4108/icst.collaboratecom.2010.7</identifier><language>eng</language><publisher>IEEE</publisher><subject>Educational institutions ; Partitioning algorithms</subject><ispartof>6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010), 2010, p.1-10</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5767000$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,2052,27906,54901</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5767000$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Masoumzadeh, A</creatorcontrib><creatorcontrib>Joshi, J</creatorcontrib><title>Preserving structural properties in anonymization of social networks</title><title>6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)</title><addtitle>COLCOM</addtitle><description>A social network is a collection of social entities and the relations among them. Collection and sharing of such network data for analysis raise significant privacy concerns for the involved individuals, especially when human users are involved. To address such privacy concerns, several techniques, such as k-anonymity based approaches, have been proposed in the literature. However, such approaches introduce a large amount of distortion to the original social network graphs, thus raising serious questions about their utility for useful social network analysis. Consequently, these techniques may never be applied in practice. In this paper, we emphasize the use of network structural semantics in the social network analysis theory to address this problem. We propose an approach for enhancing anonymization techniques that preserves the structural semantics of the original social network by using the notion of roles and positions. We present experimental results that demonstrate that our approach can significantly help in preserving graph and social network theoretic properties of the original social networks, and hence improve utility of the anonymized data.</description><subject>Educational institutions</subject><subject>Partitioning algorithms</subject><isbn>9789639995246</isbn><isbn>0984589325</isbn><isbn>963999524X</isbn><isbn>9780984589326</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj7tKBDEYRmMhKOs8gU2wn_HPPSllvcKCFlov2Uwi0ZlkSLLK-vQuaPUV53DgQ-iKwMAJ6Ovoahtcnia7y8U27_I8UDhSdYI6o7SRzBgjKJdnqKv1AwCIkVoROEe3L8VXX75iese1lb1r-2InvJS8-NKirzgmbFNOhzn-2BZzwjngml08Wsm371w-6wU6DXaqvvvfFXq7v3tdP_ab54en9c2mj4RT1VugQEcirObA3Aiau8AFl2w3Ks-oVkpbLo3VOhBHHDBtgQunqQlhFI6yFbr860bv_XYpcbblsBVKquMl9gv2jE-h</recordid><startdate>201010</startdate><enddate>201010</enddate><creator>Masoumzadeh, A</creator><creator>Joshi, J</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201010</creationdate><title>Preserving structural properties in anonymization of social networks</title><author>Masoumzadeh, A ; Joshi, J</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i1427-a0202d15a8403cd084cf45463bd7e328778a469a88f1c1c038a045c829ffd5c23</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Educational institutions</topic><topic>Partitioning algorithms</topic><toplevel>online_resources</toplevel><creatorcontrib>Masoumzadeh, A</creatorcontrib><creatorcontrib>Joshi, J</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Masoumzadeh, A</au><au>Joshi, J</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Preserving structural properties in anonymization of social networks</atitle><btitle>6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)</btitle><stitle>COLCOM</stitle><date>2010-10</date><risdate>2010</risdate><spage>1</spage><epage>10</epage><pages>1-10</pages><eisbn>9789639995246</eisbn><eisbn>0984589325</eisbn><eisbn>963999524X</eisbn><eisbn>9780984589326</eisbn><abstract>A social network is a collection of social entities and the relations among them. Collection and sharing of such network data for analysis raise significant privacy concerns for the involved individuals, especially when human users are involved. To address such privacy concerns, several techniques, such as k-anonymity based approaches, have been proposed in the literature. However, such approaches introduce a large amount of distortion to the original social network graphs, thus raising serious questions about their utility for useful social network analysis. Consequently, these techniques may never be applied in practice. In this paper, we emphasize the use of network structural semantics in the social network analysis theory to address this problem. We propose an approach for enhancing anonymization techniques that preserves the structural semantics of the original social network by using the notion of roles and positions. We present experimental results that demonstrate that our approach can significantly help in preserving graph and social network theoretic properties of the original social networks, and hence improve utility of the anonymized data.</abstract><pub>IEEE</pub><doi>10.4108/icst.collaboratecom.2010.7</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier EISBN: 9789639995246
ispartof 6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010), 2010, p.1-10
issn
language eng
recordid cdi_ieee_primary_5767000
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Educational institutions
Partitioning algorithms
title Preserving structural properties in anonymization of social networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T20%3A17%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Preserving%20structural%20properties%20in%20anonymization%20of%20social%20networks&rft.btitle=6th%20International%20Conference%20on%20Collaborative%20Computing:%20Networking,%20Applications%20and%20Worksharing%20(CollaborateCom%202010)&rft.au=Masoumzadeh,%20A&rft.date=2010-10&rft.spage=1&rft.epage=10&rft.pages=1-10&rft_id=info:doi/10.4108/icst.collaboratecom.2010.7&rft_dat=%3Cieee_6IE%3E5767000%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9789639995246&rft.eisbn_list=0984589325&rft.eisbn_list=963999524X&rft.eisbn_list=9780984589326&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5767000&rfr_iscdi=true