Parallel and distributed paradigms for community detection in social networks: A methodological review

Naik, Debadatta; Ramesh, Dharavath; Gandomi, Amir H.; Gorojanam, Naveen Babu

doi:10.1016/j.eswa.2021.115956

Cited by 26 publications

(2 citation statements)

References 111 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With the passage of time, the services of OSNs are expanding in both scale and scope. For example, OSNs enable the formation of communities of like-minded people where people can interact and share their activities/events [223]. OSNs enable information sharing at a much faster pace than any other medium by identifying and delivering information to influential people [224].…”

Section: Major Developments In Privacy Preservation In Application-sp...mentioning

confidence: 99%

A Comprehensive Analysis of Privacy-Preserving Solutions Developed for Online Social Networks

2022

View full text Add to dashboard Cite

Owning to the massive growth in internet connectivity, smartphone technology, and digital tools, the use of various online social networks (OSNs) has significantly increased. On the one hand, the use of OSNs enables people to share their experiences and information. On the other hand, this ever-growing use of OSNs enables adversaries to launch various privacy attacks to compromise users’ accounts as well as to steal other sensitive information via statistical matching. In general, a privacy attack is carried out by the exercise of linking personal data available on the OSN site and social graphs (or statistics) published by the OSN service providers. The problem of securing user personal information for mitigating privacy attacks in OSNs environments is a challenging research problem. Recently, many privacy-preserving solutions have been proposed to secure users’ data available over OSNs from prying eyes. However, a systematic overview of the research dynamics of OSN privacy, and findings of the latest privacy-preserving approaches from a broader perspective, remain unexplored in the current literature. Furthermore, the significance of artificial intelligence (AI) techniques in the OSN privacy area has not been highlighted by previous research. To cover this gap, we present a comprehensive analysis of the state-of-the-art solutions that have been proposed to address privacy issues in OSNs. Specifically, we classify the existing privacy-preserving solutions into two main categories: privacy-preserving graph publishing (PPGP) and privacy preservation in application-specific scenarios of the OSNs. Then, we introduce a high-level taxonomy that encompasses common as well as AI-based privacy-preserving approaches that have proposed ways to combat the privacy issues in PPGP. In line with these works, we discuss many state-of-the-art privacy-preserving solutions that have been proposed for application-specific scenarios (e.g., information diffusion, community clustering, influence analysis, friend recommendation, etc.) of OSNs. In addition, we discuss the various latest de-anonymization methods (common and AI-based) that have been developed to infer either identity or sensitive information of OSN users from the published graph. Finally, some challenges of preserving the privacy of OSNs (i.e., social graph data) from malevolent adversaries are presented, and promising avenues for future research are suggested.

show abstract

Section: Major Developments In Privacy Preservation In Application-sp...mentioning

confidence: 99%

A Comprehensive Analysis of Privacy-Preserving Solutions Developed for Online Social Networks

2022

View full text Add to dashboard Cite

show abstract

“…In reality networks, malware can be found by extracting rich feature information and structure [4]. However, traditional community detection algorithms suffer from poor accuracy and high computational cost and are difficult to apply to high-dimensional graph structures [5]. In addition, how to better combine network structure with node features for node clustering is still a challenging problem.…”

Section: Introductionmentioning

confidence: 99%

Hypergraph network embedding for community detection

Xiang,

You,

Wang

et al. 2024

J Supercomput

View full text Add to dashboard Cite

Using attribute graphs for node embedding to detect community structure has become a popular research topic. However, most of the existing algorithms mainly focus on the network structure and node features, which ignore the higher-order relationships between nodes. In addition, only adopting the original graph structure will suffer from sparsity problems, and will also result in sub-optimal node clustering performance. In this paper, we propose a hypergraph network embedding (HGNE) for community detection to solve the above problems. Firstly, we construct potential connections based on the shared feature information of the nodes. By fusing the original topology with feature-based potential connections, both the explicit and implicit relationships are encoded into the node representations, thus alleviating the sparsity problem. Secondly, for integrating the higher-order relationship, we adopt hypergraph convolution to encode the higherorder correlations. To constrain the quality of the node embedding, the spectral hypergraph embedding loss is utilized. Furthermore, we design a dual-contrast mechanism, which draws similar nodes closer by comparing the representations of different views. This mechanism can efficiently prevent multi-node classes from distorting less-node classes. Finally, the dual-contrast mechanism is jointly optimized with self-training clustering to obtain more robust node representations, thus improving the clustering results. Extensive experiments on five datasets indicate the superiority and effectiveness of HGNE.

show abstract