A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
In this paper, a method for anonymization of social networks by clustering of k-edge-connected subgraphs (SACK) is presented. Previous anonymization algorithms do not consider distribution of nodes in social network graph according to their attributes. SACk tries to focus on this aspect that probability of existence of an edge between two nodes is related to their attributes and this leads to a graph with connected subgraphs. Using connected subgraphs in anonymization process this methoddoi:10.5120/13412-1067 fatcat:3rq7j2yqb5earb6dwbpwfgfm2m