scholarly journals Directed closure coefficient and its patterns

PLoS ONE ◽  
2021 ◽  
Vol 16 (6) ◽  
pp. e0253822
Author(s):  
Mingshan Jia ◽  
Bogdan Gabrys ◽  
Katarzyna Musial
Keyword(s):  
Network Analysis ◽  
Complex Networks ◽  
Link Prediction ◽  
Clustering Coefficient ◽  
Directed Networks ◽  
Distinctive Features ◽  
Prediction Task ◽  
Significant Element ◽  
Node Level ◽  
End Node

The triangle structure, being a fundamental and significant element, underlies many theories and techniques in studying complex networks. The formation of triangles is typically measured by the clustering coefficient, in which the focal node is the centre-node in an open triad. In contrast, the recently proposed closure coefficient measures triangle formation from an end-node perspective and has been proven to be a useful feature in network analysis. Here, we extend it by proposing the directed closure coefficient that measures the formation of directed triangles. By distinguishing the direction of the closing edge in building triangles, we further introduce the source closure coefficient and the target closure coefficient. Then, by categorising particular types of directed triangles (e.g., head-of-path), we propose four closure patterns. Through multiple experiments on 24 directed networks from six domains, we demonstrate that at network-level, the four closure patterns are distinctive features in classifying network types, while at node-level, adding the source and target closure coefficients leads to significant improvement in link prediction task in most types of directed networks.

A degree-related and link clustering coefficient approach for link prediction in complex networks

2021 ◽  
Vol 94 (1) ◽  
Author(s):  
Meixi Wang ◽  
Xuyang Lou ◽  
Baotong Cui
Keyword(s):  
Complex Networks ◽  
Link Prediction ◽  
Clustering Coefficient

scholarly journals Community detection in complex networks using link prediction

2018 ◽  
Vol 32 (01) ◽  
pp. 1850004 ◽  
Author(s):  
Hui-Min Cheng ◽  
Yi-Zi Ning ◽  
Zhao Yin ◽  
Chao Yan ◽  
Xin Liu ◽  
...  
Keyword(s):  
Network Analysis ◽  
Complex Networks ◽  
Community Detection ◽  
Link Prediction ◽  
Detection Algorithm ◽  
The Other ◽  
Data Sets ◽  
Topological Structures ◽  
Benchmark Data ◽  
Community Detection Algorithm

Community detection and link prediction are both of great significance in network analysis, which provide very valuable insights into topological structures of the network from different perspectives. In this paper, we propose a novel community detection algorithm with inclusion of link prediction, motivated by the question whether link prediction can be devoted to improving the accuracy of community partition. For link prediction, we propose two novel indices to compute the similarity between each pair of nodes, one of which aims to add missing links, and the other tries to remove spurious edges. Extensive experiments are conducted on benchmark data sets, and the results of our proposed algorithm are compared with two classes of baselines. In conclusion, our proposed algorithm is competitive, revealing that link prediction does improve the precision of community detection.

ANALISIS PERINGKAT TOP BRAND OJEK ONLINE MENGGUNAKAN JEJARING SOSIAL PERCAKAPAN TWITTER

2019 ◽  
Vol 24 (2) ◽  
pp. 88-104
Author(s):  
Ilham Aminudin ◽  
Dyah Anggraini
Keyword(s):  
Social Media ◽  
Social Network ◽  
Social Network Analysis ◽  
Network Analysis ◽  
Path Length ◽  
Average Path Length ◽  
Average Degree ◽  
Clustering Coefficient ◽  
R Programming

Banyak bisnis mulai muncul dengan melibatkan pengembangan teknologi internet. Salah satunya adalah bisnis di aplikasi berbasis penyedia layanan di bidang moda transportasi berbasis online yang ternyata dapat memberikan solusi dan menjawab berbagai kekhawatiran publik tentang layanan transportasi umum. Kemacetan lalu lintas di kota-kota besar dan ketegangan publik dengan keamanan transportasi umum diselesaikan dengan adanya aplikasi transportasi online seperti Grab dan Gojek yang memberikan kemudahan dan kenyamanan bagi penggunanya Penelitian ini dilakukan untuk menganalisa keaktifan percakapan brand jasa transportasi online di jejaring sosial Twitter berdasarkan properti jaringan. Penelitian dilakukan dengan dengan mengambil data dari percakapan pengguna di social media Twitter dengan cara crawling menggunakan Bahasa pemrograman R programming dan software R Studio dan pembuatan model jaringan dengan software Gephy. Setelah itu data dianalisis menggunakan metode social network analysis yang terdiri berdasarkan properti jaringan yaitu size, density, modularity, diameter, average degree, average path length, dan clustering coefficient dan nantinya hasil analisis akan dibandingkan dari setiap properti jaringan kedua brand jasa transportasi Online dan ditentukan strategi dalam meningkatkan dan mempertahankan keaktifan serta tingkat kehadiran brand jasa transportasi online, Grab dan Gojek.

scholarly journals Analysis of Air Mean Temperature Anomalies by Using Horizontal Visibility Graphs

Entropy ◽  
2021 ◽  
Vol 23 (2) ◽  
pp. 207
Author(s):  
Javier Gómez-Gómez ◽  
Rafael Carmona-Cabezas ◽  
Elena Sánchez-López ◽  
Eduardo Gutiérrez de Ravé ◽  
Francisco José Jiménez-Hornero
Keyword(s):  
Complex Networks ◽  
Global Climate ◽  
Spatial Relation ◽  
Clustering Coefficient ◽  
Horizontal Visibility ◽  
Climate Conditions ◽  
Mean Values ◽  
Intrinsic Nature ◽  
Temperature Anomalies ◽  
Mean Temperature

The last decades have been successively warmer at the Earth’s surface. An increasing interest in climate variability is appearing, and many research works have investigated the main effects on different climate variables. Some of them apply complex networks approaches to explore the spatial relation between distinct grid points or stations. In this work, the authors investigate whether topological properties change over several years. To this aim, we explore the application of the horizontal visibility graph (HVG) approach which maps a time series into a complex network. Data used in this study include a 60-year period of daily mean temperature anomalies in several stations over the Iberian Peninsula (Spain). Average degree, degree distribution exponent, and global clustering coefficient were analyzed. Interestingly, results show that they agree on a lack of significant trends, unlike annual mean values of anomalies, which present a characteristic upward trend. The main conclusions obtained are that complex networks structures and nonlinear features, such as weak correlations, appear not to be affected by rising temperatures derived from global climate conditions. Furthermore, different locations present a similar behavior and the intrinsic nature of these signals seems to be well described by network parameters.

scholarly journals Visualization of clinical teaching citations using social network analysis

2021 ◽  
Vol 21 (1) ◽  
Author(s):  
Hakimeh Hazrati ◽  
Shoaleh Bigdeli ◽  
Seyed Kamran Soltani Arabshahi ◽  
Vahideh Zarea Gavgani ◽  
Nafiseh Vahed
Keyword(s):  
Social Network ◽  
Social Network Analysis ◽  
Network Analysis ◽  
Research Collaboration ◽  
Clinical Teaching ◽  
Clustering Coefficient ◽  
Knowledge Network ◽  
Research Network ◽  
Centrality Measures ◽  
The Usa

Abstract Background Analyzing the previous research literature in the field of clinical teaching has potential to show the trend and future direction of this field. This study aimed to visualize the co-authorship networks and scientific map of research outputs of clinical teaching and medical education by Social Network Analysis (SNA). Methods We Identified 1229 publications on clinical teaching through a systematic search strategy in the Scopus (Elsevier), Web of Science (Clarivate Analytics) and Medline (NCBI/NLM) through PubMed from the year 1980 to 2018.The Ravar PreMap, Netdraw, UCINet and VOSviewer software were used for data visualization and analysis. Results Based on the findings of study the network of clinical teaching was weak in term of cohesion and the density in the co-authorship networks of authors (clustering coefficient (CC): 0.749, density: 0.0238) and collaboration of countries (CC: 0.655, density: 0.176). In regard to centrality measures; the most influential authors in the co-authorship network was Rosenbaum ME, from the USA (0.048). More, the USA, the UK, Canada, Australia and the Netherlands have central role in collaboration countries network and has the vertex co-authorship with other that participated in publishing articles in clinical teaching. Analysis of background and affiliation of authors showed that co-authorship between clinical researchers in medicine filed is weak. Nineteen subject clusters were identified in the clinical teaching research network, seven of which were related to the expected competencies of clinical teaching and three related to clinical teaching skills. Conclusions In order to improve the cohesion of the authorship network of clinical teaching, it is essential to improve research collaboration and co-authorship between new researchers and those who have better closeness or geodisk path with others, especially those with the clinical background. To reach to a dense and powerful topology in the knowledge network of this field encouraging policies to be made for international and national collaboration between clinicians and clinical teaching specialists. In addition, humanitarian and clinical reasoning need to be considered in clinical teaching as of new direction in the field from thematic aspects.

scholarly journals A novel similarity measure for missing link prediction in social networks

2020 ◽  
Vol 19 (2) ◽  
pp. 1071
Author(s):  
Gogulamudi Naga Chandrika ◽  
E. Srinivasa Reddy
Keyword(s):  
Social Networks ◽  
Complex Networks ◽  
Similarity Measure ◽  
Network Theory ◽  
Link Prediction ◽  
Prediction Methods ◽  
Missing Link ◽  
The Social ◽  
Hidden Patterns ◽  
Over Time

<p><span>Social Networks progress over time by the addition of new nodes and links, form associations with one community to the other community. Over a few decades, the fast expansion of Social Networks has attracted many researchers to pay more attention towards complex networks, the collection of social data, understand the social behaviors of complex networks and predict future conflicts. Thus, Link prediction is imperative to do research with social networks and network theory. The objective of this research is to find the hidden patterns and uncovered missing links over complex networks. Here, we developed a new similarity measure to predict missing links over social networks. The new method is computed on common neighbors with node-to-node distance to get better accuracy of missing link prediction. </span><span>We tested the proposed measure on a variety of real-world linked datasets which are formed from various linked social networks. The proposed approach performance is compared with contemporary link prediction methods. Our measure makes very effective and intuitive in predicting disappeared links in linked social networks.</span></p>

Community detection in complex networks by using membrane algorithm

2018 ◽  
Vol 29 (01) ◽  
pp. 1850003 ◽  
Author(s):  
Chuang Liu ◽  
Linan Fan ◽  
Zhou Liu ◽  
Xiang Dai ◽  
Jiamei Xu ◽  
...  
Keyword(s):  
Network Analysis ◽  
Complex Networks ◽  
Community Detection ◽  
Membrane Structure ◽  
Superior Performance ◽  
Membrane Systems ◽  
Membrane Algorithm ◽  
Differential Evolutionary Algorithm ◽  
Network Modularity

Community detection in complex networks is a key problem of network analysis. In this paper, a new membrane algorithm is proposed to solve the community detection in complex networks. The proposed algorithm is based on membrane systems, which consists of objects, reaction rules, and a membrane structure. Each object represents a candidate partition of a complex network, and the quality of objects is evaluated according to network modularity. The reaction rules include evolutionary rules and communication rules. Evolutionary rules are responsible for improving the quality of objects, which employ the differential evolutionary algorithm to evolve objects. Communication rules implement the information exchanged among membranes. Finally, the proposed algorithm is evaluated on synthetic, real-world networks with real partitions known and the large-scaled networks with real partitions unknown. The experimental results indicate the superior performance of the proposed algorithm in comparison with other experimental algorithms.

Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient

2018 ◽  
Vol 32 (06) ◽  
pp. 1850118 ◽  
Author(s):  
Mengtian Li ◽  
Ruisheng Zhang ◽  
Rongjing Hu ◽  
Fan Yang ◽  
Yabing Yao ◽  
...  
Keyword(s):  
Complex Networks ◽  
Nearest Neighbors ◽  
Sir Model ◽  
Clustering Coefficient ◽  
Degree Centrality ◽  
Competitive Performance ◽  
Spreading Process ◽  
Degree Sum ◽  
Local Degree ◽  
Crucial Problem

Identifying influential spreaders is a crucial problem that can help authorities to control the spreading process in complex networks. Based on the classical degree centrality (DC), several improved measures have been presented. However, these measures cannot rank spreaders accurately. In this paper, we first calculate the sum of the degrees of the nearest neighbors of a given node, and based on the calculated sum, a novel centrality named clustered local-degree (CLD) is proposed, which combines the sum and the clustering coefficients of nodes to rank spreaders. By assuming that the spreading process in networks follows the susceptible–infectious–recovered (SIR) model, we perform extensive simulations on a series of real networks to compare the performances between the CLD centrality and other six measures. The results show that the CLD centrality has a competitive performance in distinguishing the spreading ability of nodes, and exposes the best performance to identify influential spreaders accurately.

Complex Networks and Network Analysis

2012 ◽  
pp. 195-210
Keyword(s):  
Network Analysis ◽  
Complex Networks
Sign in / Sign up

Export Citation Format

Share Document