2019
DOI: 10.9734/ajrcos/2019/v3i330092
|View full text |Cite
|
Sign up to set email alerts
|

Privacy Preserving in Social Networks Using Combining Cuckoo Optimization Algorithm and Graph Clustering for Anonymization

Abstract: Recently, social networks have received dramatic interest. The speed of the development and expansion of the Internet has created a new topic of research called social networks or online virtual communities on the Internet. Today, social networking sites such as Facebook, Twitter, Instagram and so forth are dramatically used by many people. Since people publish a lot of information about themselves on these networks, this information may be attacked by the intruders, so the need of preserving privacy is necess… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…Some research recommends the DP concept be used in recommendation in SN applications [43], high-dimensional PPDP [44], frequent sequence pattern mining without degrading user's privacy [45], and privacy preserving collaborative filtering [46]. Researchers have extended the traditional anonymization concepts for anonymizing SN users' graph G by either guaranteeing k-degree, k-edges, vertex and edge modification, clustering, and ℓdiverse sensitive node label retention [17,[47][48][49]. Despite the success of these privacy techniques, in most cases, either individual user private information is inferred through the community's detection, group membership, and friendship information, or users' community privacy breached if a group of users largely share the same SA value.…”
Section: Background and Related Workmentioning
confidence: 99%
“…Some research recommends the DP concept be used in recommendation in SN applications [43], high-dimensional PPDP [44], frequent sequence pattern mining without degrading user's privacy [45], and privacy preserving collaborative filtering [46]. Researchers have extended the traditional anonymization concepts for anonymizing SN users' graph G by either guaranteeing k-degree, k-edges, vertex and edge modification, clustering, and ℓdiverse sensitive node label retention [17,[47][48][49]. Despite the success of these privacy techniques, in most cases, either individual user private information is inferred through the community's detection, group membership, and friendship information, or users' community privacy breached if a group of users largely share the same SA value.…”
Section: Background and Related Workmentioning
confidence: 99%