scholarly journals ANGEL: efficient, and effective, node-centric community discovery in static and dynamic networks

2020 ◽  
Vol 5 (1) ◽  
Author(s):  
Giulio Rossetti
Keyword(s):  
Social Network ◽  
Dynamic Networks ◽  
Community Discovery ◽  
Social Network Data ◽  
Challenging Tasks ◽  
Interesting Family ◽  
Effectiveness And Efficiency ◽  
Art Community ◽  
Real World Datasets ◽  
Discovery Algorithms

Abstract Community discovery is one of the most challenging tasks in social network analysis. During the last decades, several algorithms have been proposed with the aim of identifying communities in complex networks, each one searching for mesoscale topologies having different and peculiar characteristics. Among such vast literature, an interesting family of Community Discovery algorithms, designed for the analysis of social network data, is represented by overlapping, node-centric approaches. In this work, following such line of research, we propose Angel, an algorithm that aims to lower the computational complexity of previous solutions while ensuring the identification of high-quality overlapping partitions. We compare Angel, both on synthetic and real-world datasets, against state of the art community discovery algorithms designed for the same community definition. Our experiments underline the effectiveness and efficiency of the proposed methodology, confirmed by its ability to constantly outperform the identified competitors.

Grouping of Nodes in Social Networks Based on Multiphase Approach

2019 ◽  
Vol 12 (1) ◽  
pp. 25-33
Author(s):  
Parimala M. Boobalan
Keyword(s):  
Social Networks ◽  
Structural Similarity ◽  
Large Datasets ◽  
The Other ◽  
Jaccard Coefficient ◽  
Community Discovery ◽  
Extensive Analysis ◽  
Clustering Quality ◽  
Effectiveness And Efficiency ◽  
Real World Datasets

Background: Recent advances in the field of information and social network has led to the problem of community detection that has got much attention among the researchers. Objective: This paper focus on community discovery, a fundamental task in network analysis by balancing both attribute and structural similarity. The attribute similarity is evaluated using the Jaccard coefficient and Structural similarity is achieved through modularity. Methods: The proposed algorithm is designed for identifying communities in social networks by fusing attribute and structural similarity. The algorithm retains the node which has high influence on the other nodes within the neighbourhood and subsequently groups the objects based on the similarity of the information among the nodes. The extensive analysis is performed on real world datasets like Facebook, DBLP, Twitter and Flickr with different sizes that demonstrates the effectiveness and efficiency of the proposed algorithm over the other algorithms. Results: The results depicts that the generated clusters have a good balance between the structural and attribute with high intracluster similarity and less intracluster similarity. The algorithm helps to achieve faster runtime for moderately-sized datasets and better runtime for large datasets with superior clustering quality.

Partial k-Anonymity for Privacy-Preserving Social Network Data Publishing

2017 ◽  
Vol 27 (01) ◽  
pp. 71-90 ◽  
Author(s):  
Peng Liu ◽  
Yan Bai ◽  
Lie Wang ◽  
Xianxian Li
Keyword(s):  
Social Network ◽  
Data Privacy ◽  
Privacy Preserving ◽  
Data Publishing ◽  
Published Data ◽  
Network Data ◽  
Social Network Data ◽  
Label Information ◽  
Real World Datasets ◽  
Randomization Algorithms

With the popularity of social networks, privacy issues with regard to publishing social network data have gained intensive focus from academia. We analyzed the current privacy-preserving techniques for publishing social network data and defined a privacy-preserving model with privacy guarantee [Formula: see text]. With our definitions, the existing privacy-preserving methods, [Formula: see text]-anonymity and randomization can be combined together to protect data privacy. We also considered the privacy threat with label information and modify the [Formula: see text]-anonymity technique of tabular data to protect the published data from being attacked by the combination of two types of background knowledge, the structural and label knowledge. We devised a partial [Formula: see text]-anonymity algorithm and implemented it in Python and open source packages. We compared the algorithm with related [Formula: see text]-anonymity and random techniques on three real-world datasets. The experimental results show that the partial [Formula: see text]-anonymity algorithm preserves more data utilities than the [Formula: see text]-anonymity and randomization algorithms.

Abstract #1249: Novel Use of Physician Social Network Data to Map the Gap in the Endocrinology Workforce

2015 ◽  
Vol 21 ◽  
pp. 301
Author(s):  
Armand Krikorian ◽  
Lily Peng ◽  
Zubair Ilyas ◽  
Joumana Chaiban
Keyword(s):  
Social Network ◽  
Network Data ◽  
Social Network Data

The Multilevel p2 Model

Methodology ◽  
2006 ◽  
Vol 2 (1) ◽  
pp. 42-47 ◽  
Author(s):  
Bonne J. H. Zijlstra ◽  
Marijtje A. J. van Duijn ◽  
Tom A. B. Snijders
Keyword(s):  
Social Network ◽  
Network Data ◽  
Mcmc Algorithm ◽  
Independent Observation ◽  
Single Observation ◽  
Multiple Networks ◽  
Social Network Data ◽  
Multiple Observations ◽  
Practical Support ◽  
The Social

The p 2 model is a random effects model with covariates for the analysis of binary directed social network data coming from a single observation of a social network. Here, a multilevel variant of the p 2 model is proposed for the case of multiple observations of social networks, for example, in a sample of schools. The multilevel p 2 model defines an identical p 2 model for each independent observation of the social network, where parameters are allowed to vary across the multiple networks. The multilevel p 2 model is estimated with a Bayesian Markov Chain Monte Carlo (MCMC) algorithm that was implemented in free software for the statistical analysis of complete social network data, called StOCNET. The new model is illustrated with a study on the received practical support by Dutch high school pupils of different ethnic backgrounds.

scholarly journals Social network data of Swiss farmers related to agricultural climate change mitigation

Data in Brief ◽  
2021 ◽  
Vol 35 ◽  
pp. 106898
Author(s):  
Cordelia Sophie Kreft ◽  
Mario Angst ◽  
Robert Huber ◽  
Robert Finger
Keyword(s):  
Climate Change ◽  
Social Network ◽  
Climate Change Mitigation ◽  
Network Data ◽  
Social Network Data ◽  
Change Mitigation

scholarly journals Social Networks and Loneliness During the COVID-19 Pandemic

2021 ◽  
Vol 7 ◽  
pp. 237802312098525
Author(s):  
Balazs Kovacs ◽  
Nicholas Caplan ◽  
Samuel Grob ◽  
Marissa King
Keyword(s):  
Social Network ◽  
Social Isolation ◽  
Close Relationships ◽  
Network Size ◽  
Global Network ◽  
Network Data ◽  
Network Characteristics ◽  
Face To Face ◽  
Social Network Data ◽  
Social Network Size

We utilize longitudinal social network data collected pre–COVID-19 in June 2019 and compare them with data collected in the midst of COVID in June 2020. We find significant decreases in network density and global network size following a period of profound social isolation. While there is an overall increase in loneliness during this era, certain social network characteristics of individuals are associated with smaller increases in loneliness. Specifically, we find that people with fewer than five “very close” relationships report increases in loneliness. We further find that face-to-face interactions, as well as the duration and frequency of interactions with very close ties, are associated with smaller increases in loneliness during the pandemic. We also report on factors that do not moderate the effect of social isolation on perceived loneliness, such as gender, age, or overall social network size.

scholarly journals Multityped Community Discovery in Time-Evolving Heterogeneous Information Networks Based on Tensor Decomposition

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Jibing Wu ◽  
Lianfei Yu ◽  
Qun Zhang ◽  
Peiteng Shi ◽  
Lihua Liu ◽  
...  
Keyword(s):  
Real World ◽  
Tensor Decomposition ◽  
Information Networks ◽  
Community Discovery ◽  
Star Network ◽  
Heterogeneous Information ◽  
Heterogeneous Information Networks ◽  
General Network ◽  
Real World Datasets ◽  
Discovery Method

The heterogeneous information networks are omnipresent in real-world applications, which consist of multiple types of objects with various rich semantic meaningful links among them. Community discovery is an effective method to extract the hidden structures in networks. Usually, heterogeneous information networks are time-evolving, whose objects and links are dynamic and varying gradually. In such time-evolving heterogeneous information networks, community discovery is a challenging topic and quite more difficult than that in traditional static homogeneous information networks. In contrast to communities in traditional approaches, which only contain one type of objects and links, communities in heterogeneous information networks contain multiple types of dynamic objects and links. Recently, some studies focus on dynamic heterogeneous information networks and achieve some satisfactory results. However, they assume that heterogeneous information networks usually follow some simple schemas, such as bityped network and star network schema. In this paper, we propose a multityped community discovery method for time-evolving heterogeneous information networks with general network schemas. A tensor decomposition framework, which integrates tensor CP factorization with a temporal evolution regularization term, is designed to model the multityped communities and address their evolution. Experimental results on both synthetic and real-world datasets demonstrate the efficiency of our framework.

Sign in / Sign up

Export Citation Format

Share Document