• No results found

SACK: Anonymization of Social Networks by Clustering of K edge connected Subgraphs

N/A
N/A
Protected

Academic year: 2020

Share "SACK: Anonymization of Social Networks by Clustering of K edge connected Subgraphs"

Copied!
7
0
0

Loading.... (view fulltext now)

Full text

Loading

Figure

Fig 1. Flowchart of SACK
Fig 5. Network SN after some iteration (a) and its corresponding clustering (b)
Fig 7. SACK algorithm

References

Related documents

We invite unpublished novel, original, empirical and high quality research work pertaining to recent developments & practices in the areas of Computer Science

They note that “the positive effects of HCHRPs on employee outcomes more than compensated for the negative impact of work load” (Gould-Williams et al., 2004, p.937). We have

11.1 - Stormwater Management – This objective provides a basis in the comprehensive plan for Williston’s stormwater management plan. 11.2 - Stream Restoration – The

Cost Savings / Benefits: Leasing underutilized space in the Human Services Building to Michigan Works is contributing state funds in the amount of $55,000 annually to help

Bayesian: Markov-Chain Monte Carlo  Used to generate the pool of plausible trees in?.

The methodology adopted in the four climatological regions enabled the investigation and analyses of: (a) the variability in individual time to peak ( T Pxi ) values derived

We have shown that results of Formal Concept Analysis increase on one hand the performance of data mining algorithms, and improve on the other hand the visualization of the

Crimes committed in the cyberspace by the criminals are known as cyber crimes such as Phishing, Spamming, Spoofing, Cyber Terrorism, Cyber Stalking, Electronic Spam Emails and