Social Network Analysis

A special issue of Applied Sciences (ISSN 2076-3417). This special issue belongs to the section "Computing and Artificial Intelligence".

Deadline for manuscript submissions: closed (15 December 2021) | Viewed by 45990

Special Issue Editors


E-Mail Website
Guest Editor
Dipartimento di Informatica, Sapienza Università di Roma, Via Salaria, 113, 00198 Roma, Italy
Interests: Her main interests are in the areas of natural language processing, social networks, machine learning, ontology learning, and data analytics. Main recent application areas are in the domain of recommender systems, e-health, e-learning, and enterprise social networks

E-Mail Website
Guest Editor
Dipartimento di Scienze Giuridiche ed Economiche, Unitelma Sapienza Università di Roma, Regina Elena 295, 00161 Roma, Italy
Interests: ontology Learning; distributional Semantics; word Sense disambiguation/induction; recommender systems; linked open data

Special Issue Information

Dear Colleagues,

Social network analysis (SNA) is a research area of computer science whose purpose is to represent people and their social interactions as graphs and then analyze these graphs using network and graph theory. SNA research is highly interdisciplinary: the best results have been obtained thanks to the collaboration with scientists from other disciplines, such as, for example, sociology, psychology, medicine, and management theory, among others. The objective of this Special Issue is to collect contributions centered on innovative algorithms in the field of computer science and network theory that are clearly linked to contributions from other disciplines.

Prof. Dr. Paola Velardi
Dr. Stefano Faralli
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Applied Sciences is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2400 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • social network analysis
  • graph mining
  • machine learning
  • network theory
  • health blog analytics
  • social recommenders
  • enterprise social networks
  • complex systems

Published Papers (16 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Editorial

Jump to: Research

4 pages, 191 KiB  
Editorial
Special Issue on Social Network Analysis
by Stefano Faralli and Paola Velardi
Appl. Sci. 2022, 12(18), 8993; https://0-doi-org.brum.beds.ac.uk/10.3390/app12188993 - 07 Sep 2022
Cited by 1 | Viewed by 1148
Abstract
Social network analysis (SNA) is a research area of computer science with the purpose to represent people and their social interactions as graphs, and then, analyze these graphs using network and graph theory [...] Full article
(This article belongs to the Special Issue Social Network Analysis)

Research

Jump to: Editorial

25 pages, 7668 KiB  
Article
Leveraging Social Network Analysis for Crowdsourced Software Engineering Research
by Areej Alabduljabbar and Sultan Alyahya
Appl. Sci. 2022, 12(3), 1715; https://0-doi-org.brum.beds.ac.uk/10.3390/app12031715 - 07 Feb 2022
Cited by 3 | Viewed by 1875
Abstract
Crowdsourced software engineering (CSE) is an emerging area that has been gaining much attention in the last few years. It refers to the use of crowdsourcing techniques in software engineering activities, including requirements engineering, implementation, design, testing, and verification. CSE is an alternative [...] Read more.
Crowdsourced software engineering (CSE) is an emerging area that has been gaining much attention in the last few years. It refers to the use of crowdsourcing techniques in software engineering activities, including requirements engineering, implementation, design, testing, and verification. CSE is an alternative to traditional software engineering and uses an open call to which online developers can respond to and obtain work on various tasks, as opposed to the assigning of tasks to in-house developers. The great benefits of CSE have attracted the attention of many researchers, and many studies have recently been carried out in the field. This research aims to analyze publications on CSE using social network analysis (SNA). A total of 509 CSE publications from six popular databases were analyzed to determine the characteristics of the collaborative networks of co-authorship of the research (i.e., the co-authors, institutions involved in co-authorship, and countries involved in co-authorship) and of the citation networks on which the publications of the studies are listed. The findings help identify CSE research productivity, trends, performances, community structures, and relationships between various collaborative patterns to provide a more complete picture of CSE research. Full article
(This article belongs to the Special Issue Social Network Analysis)
Show Figures

Figure 1

12 pages, 1008 KiB  
Article
Deep Link Entropy for Quantifying Edge Significance in Social Networks
by Seval Yurtcicek Ozaydin and Fatih Ozaydin
Appl. Sci. 2021, 11(23), 11182; https://0-doi-org.brum.beds.ac.uk/10.3390/app112311182 - 25 Nov 2021
Cited by 3 | Viewed by 2062
Abstract
Through online political communications, fragmented groups appear around ideological lines, which might form echo chambers if the communications within like-minded groups are dominant over the communications among different-minded groups, potentially contributing to political polarization and extremism. The antidote is the interactions between individuals [...] Read more.
Through online political communications, fragmented groups appear around ideological lines, which might form echo chambers if the communications within like-minded groups are dominant over the communications among different-minded groups, potentially contributing to political polarization and extremism. The antidote is the interactions between individuals who constitute social bridges between different minded groups. Hence, exploring the significance of connections between the individuals of a network is a center of attraction especially for the global connectivity and diffusion in networks. Based on the divergence of probability distributions of pairs of nodes, Link Entropy (LE) is a recently proposed method outperforming the others in quantifying edge significance. In this work, considering that the adjacent nodes of the two nodes of an edge are also in charge in determining its significance, we propose the Deep Link Entropy (DLE) method for a more precise quantification through taking into account the uncertainty distributions of the adjacent nodes as well. We show experimentally that DLE significantly outperforms LE especially in large-scale complex network with several groups or communities. We believe our method contributes to not only online political communications but a wide range of fields from biology to quantum networks, where edge significance has an operational meaning. Full article
(This article belongs to the Special Issue Social Network Analysis)
Show Figures

Figure 1

14 pages, 26639 KiB  
Article
A Novel Deep Neural Network-Based Approach to Measure Scholarly Research Dissemination Using Citations Network
by Naif Radi Aljohani, Ayman Fayoumi and Saeed-Ul Hassan
Appl. Sci. 2021, 11(22), 10970; https://0-doi-org.brum.beds.ac.uk/10.3390/app112210970 - 19 Nov 2021
Cited by 6 | Viewed by 1661
Abstract
We investigated the scientific research dissemination by analyzing the publications and citation data, implying that not all citations are significantly important. Therefore, as alluded to existing state-of-the-art models that employ feature-based techniques to measure the scholarly research dissemination between multiple entities, our model [...] Read more.
We investigated the scientific research dissemination by analyzing the publications and citation data, implying that not all citations are significantly important. Therefore, as alluded to existing state-of-the-art models that employ feature-based techniques to measure the scholarly research dissemination between multiple entities, our model implements the convolutional neural network (CNN) with fastText-based pre-trained embedding vectors, utilizes only the citation context as its input to distinguish between important and non-important citations. Moreover, we speculate using focal-loss and class weight methods to address the inherited class imbalance problems in citation classification datasets. Using a dataset of 10 K annotated citation contexts, we achieved an accuracy of 90.7% along with a 90.6% f1-score, in the case of binary classification. Finally, we present a case study to measure the comprehensiveness of our deployed model on a dataset of 3100 K citations taken from the ACL Anthology Reference Corpus. We employed state-of-the-art graph visualization open-source tool Gephi to analyze the various aspects of citation network graphs, for each respective citation behavior. Full article
(This article belongs to the Special Issue Social Network Analysis)
Show Figures

Figure 1

15 pages, 1844 KiB  
Article
An Information Diffusion Model Based on Explosion Shock Wave Theory on Online Social Networks
by Lin Zhang, Kan Li and Jiamou Liu
Appl. Sci. 2021, 11(21), 9996; https://0-doi-org.brum.beds.ac.uk/10.3390/app11219996 - 26 Oct 2021
Cited by 2 | Viewed by 1923
Abstract
Along with the growing popularity of online social networks, an environment has been set up with information spreading faster and wider than ever before, which has changed the way of information diffusion. Previous empirical research and propagation models have been conducted to illustrate [...] Read more.
Along with the growing popularity of online social networks, an environment has been set up with information spreading faster and wider than ever before, which has changed the way of information diffusion. Previous empirical research and propagation models have been conducted to illustrate how information propagates on online social networks. However, due to the complexity of information diffusion, there are still many important issues yet to be resolved. In order to tackle this problem, most studies have assumed that information is transmitted along the edges on online social networks, while most research goals aim to discover nodes that have been affected by information diffusion. However, we found that processes of information diffusion on online social networks vary from one another; some topics such as people’s livelihood and education are long-acting while some entertainment news is short-lived. The scale of propagation may be similar in the end, but the spreading process would be completely different. With the purpose of modeling the propagation process more realistically, we propose a novel model, the Information Diffusion Model, based on Explosion Shock Wave Theory. The Information Diffusion Model compares the propagation process to the explosion of an information bomb at the source, with the information shock waves progressively spread from near to far. Additionally, we establish rules of information transmission between a pair of individuals. The approach we adopted demonstrates four strengths. First, it models information diffusion on OSNs considering the differences between individuals and individual social behaviors, which takes the individual background knowledge and forgetting factors into account. Second, it holds the point that the attractiveness of information to individuals is related to the value of information. Third, it recognizes the role of community in the diffusion process; with a higher sense of trust established in a community, the spread of information would be more convenient. More importantly, the model we put forth is applicable to different types of real online social network datasets. Many experiments with different settings and specifications are conducted to verify the advantages of the model, and the results obtained are very promising. Full article
(This article belongs to the Special Issue Social Network Analysis)
Show Figures

Figure 1

28 pages, 763 KiB  
Article
FONDUE: A Framework for Node Disambiguation and Deduplication Using Network Embeddings
by Ahmad Mel, Bo Kang, Jefrey Lijffijt and Tijl De Bie
Appl. Sci. 2021, 11(21), 9884; https://0-doi-org.brum.beds.ac.uk/10.3390/app11219884 - 22 Oct 2021
Cited by 3 | Viewed by 1595
Abstract
Data often have a relational nature that is most easily expressed in a network form, with its main components consisting of nodes that represent real objects and links that signify the relations between these objects. Modeling networks is useful for many purposes, but [...] Read more.
Data often have a relational nature that is most easily expressed in a network form, with its main components consisting of nodes that represent real objects and links that signify the relations between these objects. Modeling networks is useful for many purposes, but the efficacy of downstream tasks is often hampered by data quality issues related to their construction. In many constructed networks, ambiguity may arise when a node corresponds to multiple concepts. Similarly, a single entity can be mistakenly represented by several different nodes. In this paper, we formalize both the node disambiguation (NDA) and node deduplication (NDD) tasks to resolve these data quality issues. We then introduce FONDUE, a framework for utilizing network embedding methods for data-driven disambiguation and deduplication of nodes. Given an undirected and unweighted network, FONDUE-NDA identifies nodes that appear to correspond to multiple entities for subsequent splitting and suggests how to split them (node disambiguation), whereas FONDUE-NDD identifies nodes that appear to correspond to same entity for merging (node deduplication), using only the network topology. From controlled experiments on benchmark networks, we find that FONDUE-NDA is substantially and consistently more accurate with lower computational cost in identifying ambiguous nodes, and that FONDUE-NDD is a competitive alternative for node deduplication, when compared to state-of-the-art alternatives. Full article
(This article belongs to the Special Issue Social Network Analysis)
Show Figures

Figure 1

32 pages, 7363 KiB  
Article
I Explain, You Collaborate, He Cheats: An Empirical Study with Social Network Analysis of Study Groups in a Computer Programming Subject
by Beatriz Barros, Ricardo Conejo, Amparo Ruiz-Sepulveda and Francisco Triguero-Ruiz
Appl. Sci. 2021, 11(19), 9328; https://0-doi-org.brum.beds.ac.uk/10.3390/app11199328 - 08 Oct 2021
Cited by 3 | Viewed by 1992
Abstract
Students interact with each other in order to solve computer science programming assignments. Group work is encouraged because it has been proven to be beneficial to the learning process. However, sometimes, collaboration might be confused with dishonest behaviours. This article aimed to quantitatively [...] Read more.
Students interact with each other in order to solve computer science programming assignments. Group work is encouraged because it has been proven to be beneficial to the learning process. However, sometimes, collaboration might be confused with dishonest behaviours. This article aimed to quantitatively discern between both cases. We collected code similarity measures from students over four academic years and analysed them using statistical and social network analyses. Three studies were carried out: an analysis of the knowledge flow to identify dishonest behaviour, an analysis of the structure of the social organisation of study groups and an assessment of the relationship between successful students and social behaviour. Continuous dishonest behaviour in students is not as alarming as many studies suggest, probably due to the strict control, automatic plagiarism detection and high penalties for unethical behaviour. The boundary between both is given by the amount of similar content and regularity along the course. Three types of study groups were identified. We also found that the best performing groups were not made up of the best individual students but of students with different levels of knowledge and stronger relationships. The best students were usually the central nodes of those groups. Full article
(This article belongs to the Special Issue Social Network Analysis)
Show Figures

Figure 1

23 pages, 3950 KiB  
Article
An Approach to Exploring Non-Governmental Development Organizations Interest Groups on Facebook
by Araceli Galiano-Coronil, Juan José Mier-Terán Franco, César Serrano Domínguez and Luis Bayardo Tobar Pesánte
Appl. Sci. 2021, 11(19), 9237; https://0-doi-org.brum.beds.ac.uk/10.3390/app11199237 - 04 Oct 2021
Cited by 2 | Viewed by 2094
Abstract
This paper presents an approach for analyzing the stakeholders from various organizations based on their Facebook activity. On a practical level, the proposed approach has been applied in two of the Non-Governmental Development Organizations (NGDOs) with the largest number of delegations in the [...] Read more.
This paper presents an approach for analyzing the stakeholders from various organizations based on their Facebook activity. On a practical level, the proposed approach has been applied in two of the Non-Governmental Development Organizations (NGDOs) with the largest number of delegations in the province of Cadiz: Red Cross Cadiz, and Caritas Asidonia Jerez. The purposes of the research are to describe the management of marketing activities on Facebook; to identify the network stakeholders, their roles in the communication, and the community generating factors; and to position organizations according to their leadership, activity, and popularity in the network. This study used a mixed-methods research design, combining personal interviews and Social Network Analysis (SNA). The SNA provided insights into the various ways the analyzed NGDOs are active on Facebook, the roles they play in communication, and how communities are generated. Moreover, the SNA made it possible to visualize the interactions between organizations and their stakeholders within the Facebook environment using the Gephi software package. Two factors that generate communities were detected in the results: the organization’s nature and its geographical location. Moreover, two solutions were proposed to determine the organizations’ positioning according to their roles in communication. Consequently, two maps were created, a two-dimensional map with the activity and popularity of the parameters, which shows that just because an NGDO is active does not mean it is popular (in terms of receiving “likes”), and a second three-dimensional graph to which a leadership parameter was added. In this last map, four groups of important actors can be seen, with one group formed by the organizations with the best ratings on the three dimensions, and the other three with a low level of leadership in common but who were different in terms of the popularity and activity dimensions. Full article
(This article belongs to the Special Issue Social Network Analysis)
Show Figures

Figure 1

24 pages, 1901 KiB  
Article
An Enterprise Social Analytics Dashboard to Support Competence Valorization and Diversity Management
by Giorgia Di Tommaso, Stefano Faralli, Mauro Gatti, Michela Iannotta, Giovanni Stilo and Paola Velardi
Appl. Sci. 2021, 11(18), 8385; https://0-doi-org.brum.beds.ac.uk/10.3390/app11188385 - 09 Sep 2021
Cited by 1 | Viewed by 1811
Abstract
This paper describes an Enterprise Social Analytics Dashboard (ESAD) to support human capital management, competence valorization, diversity management, and early detection of potential problems within large, networked organizations. The system can be used by managers for career promotion, team building, and diversity management, [...] Read more.
This paper describes an Enterprise Social Analytics Dashboard (ESAD) to support human capital management, competence valorization, diversity management, and early detection of potential problems within large, networked organizations. The system can be used by managers for career promotion, team building, and diversity management, as well as by company’s social analysts, to monitor social behaviors and information flow in the workplace. Toward this end, we defined a measure of informal leadership which draws on organization theory and on a computational model based on multiplex networks. This model, along with a social network analysis toolkit developed in the context of the present study, enabled the systematic empirical analysis of social behaviors in a three-year dataset of message threads exchanged within a large multinational enterprise, as a function of gender, time, roles, and discussed topics. The results of our empirical analysis demonstrate the power of social analytics in organizations as a tool for human capital management, competence valorization, and early detection of potential problems. Our study clearly shows that Enterprise Social Networks are a favorable environment to highlight women’s leadership qualities and intermediary abilities. The ESAD offers innovative features, such as a sociologically motivated leadership model based on multiplex networks, text mining, and text classification techniques, to extract relevant discussion topics. Full article
(This article belongs to the Special Issue Social Network Analysis)
Show Figures

Figure 1

18 pages, 4473 KiB  
Article
Geometric Deep Lean Learning: Evaluation Using a Twitter Social Network
by Javier Villalba-Diez, Martin Molina and Daniel Schmidt
Appl. Sci. 2021, 11(15), 6777; https://0-doi-org.brum.beds.ac.uk/10.3390/app11156777 - 23 Jul 2021
Cited by 5 | Viewed by 5629
Abstract
The goal of this work is to evaluate a deep learning algorithm that has been designed to predict the topological evolution of dynamic complex non-Euclidean graphs in discrete–time in which links are labeled with communicative messages. This type of graph can represent, for [...] Read more.
The goal of this work is to evaluate a deep learning algorithm that has been designed to predict the topological evolution of dynamic complex non-Euclidean graphs in discrete–time in which links are labeled with communicative messages. This type of graph can represent, for example, social networks or complex organisations such as the networks associated with Industry 4.0. In this paper, we first introduce the formal geometric deep lean learning algorithm in its essential form. We then propose a methodology to systematically mine the data generated in social media Twitter, which resembles these complex topologies. Finally, we present the evaluation of a geometric deep lean learning algorithm that allows for link prediction within such databases. The evaluation results show that this algorithm can provide high accuracy in the link prediction of a retweet social network. Full article
(This article belongs to the Special Issue Social Network Analysis)
Show Figures

Figure 1

18 pages, 1870 KiB  
Article
ADVO: A System to Manage Influencer Marketing Campaigns on Social Networks
by Tai Huynh, Hien D. Nguyen, Ivan Zelinka, Kha V. Nguyen, Vuong T. Pham and Suong N. Hoang
Appl. Sci. 2021, 11(14), 6497; https://0-doi-org.brum.beds.ac.uk/10.3390/app11146497 - 15 Jul 2021
Cited by 7 | Viewed by 4399
Abstract
In the fourth technology revolution, influencer marketing is an essential kind of digital marketing. This marketing uses identified influencers to viral the information of products to target customers. It is useful to support brands exposed to more valuable online consumers. The influencer marketing [...] Read more.
In the fourth technology revolution, influencer marketing is an essential kind of digital marketing. This marketing uses identified influencers to viral the information of products to target customers. It is useful to support brands exposed to more valuable online consumers. The influencer marketing campaign needs a management system to manage on a social network. This system helps to increase the efficiency of a campaign. This paper proposes a management system for the influencer marketing campaign, called the ADVO system. This system provides a tool for collecting data on a social network and detecting potential brand influencers for the marketing campaign. The meaningful measures for users include amplification factors for evaluating the information propagation, the passion point to measure a user’s favorite when it comes to a brand, and the content creation score for determining the ability of post-content creating. The ADVO system helps the brand to make the decision through real-time visual reports of the campaign. It is a foundation to create commercial activities and construct an advocate community of the related brand. Full article
(This article belongs to the Special Issue Social Network Analysis)
Show Figures

Figure 1

26 pages, 477 KiB  
Article
ALPINE: Active Link Prediction Using Network Embedding
by Xi Chen, Bo Kang, Jefrey Lijffijt and Tijl De Bie
Appl. Sci. 2021, 11(11), 5043; https://0-doi-org.brum.beds.ac.uk/10.3390/app11115043 - 29 May 2021
Cited by 5 | Viewed by 2318
Abstract
Many real-world problems can be formalized as predicting links in a partially observed network. Examples include Facebook friendship suggestions, the prediction of protein–protein interactions, and the identification of hidden relationships in a crime network. Several link prediction algorithms, notably those recently introduced using [...] Read more.
Many real-world problems can be formalized as predicting links in a partially observed network. Examples include Facebook friendship suggestions, the prediction of protein–protein interactions, and the identification of hidden relationships in a crime network. Several link prediction algorithms, notably those recently introduced using network embedding, are capable of doing this by just relying on the observed part of the network. Often, whether two nodes are linked can be queried, albeit at a substantial cost (e.g., by questionnaires, wet lab experiments, or undercover work). Such additional information can improve the link prediction accuracy, but owing to the cost, the queries must be made with due consideration. Thus, we argue that an active learning approach is of great potential interest and developed ALPINE (Active Link Prediction usIng Network Embedding), a framework that identifies the most useful link status by estimating the improvement in link prediction accuracy to be gained by querying it. We proposed several query strategies for use in combination with ALPINE, inspired by the optimal experimental design and active learning literature. Experimental results on real data not only showed that ALPINE was scalable and boosted link prediction accuracy with far fewer queries, but also shed light on the relative merits of the strategies, providing actionable guidance for practitioners. Full article
(This article belongs to the Special Issue Social Network Analysis)
Show Figures

Figure 1

18 pages, 3195 KiB  
Article
Framework for Social Media Analysis Based on Hashtag Research
by Ladislav Pilař, Lucie Kvasničková Stanislavská, Roman Kvasnička, Petr Bouda and Jana Pitrová
Appl. Sci. 2021, 11(8), 3697; https://0-doi-org.brum.beds.ac.uk/10.3390/app11083697 - 20 Apr 2021
Cited by 14 | Viewed by 4946
Abstract
Social networks have become a common part of many people’s daily lives. Users spend more and more time on these platforms and create an active and passive digital footprint through their interaction with other subjects. These data have high research potential in many [...] Read more.
Social networks have become a common part of many people’s daily lives. Users spend more and more time on these platforms and create an active and passive digital footprint through their interaction with other subjects. These data have high research potential in many fields, because understanding people’s communication on social media is essential to understanding their attitudes, experiences and behaviours. Social media analysis is a relatively new subject. There is still a need to develop methods and tools for researchers to help solve typical problems associated with this area. A researcher will be able to focus on the subject of research entirely. This article describes the Social Media Analysis based on Hashtag Research (SMAHR) framework, which uses social network analysis methods to explore social media communication through a network of hashtags. The results show that social media analysis based on hashtags provides information applicable to theoretical research and practical strategic marketing and management applications. Full article
(This article belongs to the Special Issue Social Network Analysis)
Show Figures

Figure 1

55 pages, 7853 KiB  
Article
Topology of the World Tourism Web
by Katarina Kostelić and Marko Turk
Appl. Sci. 2021, 11(5), 2253; https://0-doi-org.brum.beds.ac.uk/10.3390/app11052253 - 04 Mar 2021
Cited by 4 | Viewed by 3103
Abstract
The applications of social network analysis to the world tourism network are scarce, and a research update is long overdue. The goal of this research is to examine the topology of the world tourism network and to discuss the meaning of its characteristics [...] Read more.
The applications of social network analysis to the world tourism network are scarce, and a research update is long overdue. The goal of this research is to examine the topology of the world tourism network and to discuss the meaning of its characteristics in light of the current situation. The data used for the analysis comprise 193 target countries, 242 source countries, and 17,022 links, which is an overall 1,448,285,894 travels in 2018. Social network analysis is applied to the data to determine network topological and diffusion properties, as well as the network structure and its regularities (does it behave more as a social or a technological/biological network?). While results presented in this paper give a thorough insight into the world tourism network in the year 2018, they are only a glimpse in comparison to the possibilities for further research. Full article
(This article belongs to the Special Issue Social Network Analysis)
Show Figures

Figure 1

29 pages, 1268 KiB  
Article
On Investigating Both Effectiveness and Efficiency of Embedding Methods in Task of Similarity Computation of Nodes in Graphs
by Masoud Reyhani Hamedani and Sang-Wook Kim
Appl. Sci. 2021, 11(1), 162; https://0-doi-org.brum.beds.ac.uk/10.3390/app11010162 - 26 Dec 2020
Cited by 5 | Viewed by 3036
Abstract
One of the important tasks in a graph is to compute the similarity between two nodes; link-based similarity measures (in short, similarity measures) are well-known and conventional techniques for this task that exploit the relations between nodes (i.e., links) in the graph. Graph [...] Read more.
One of the important tasks in a graph is to compute the similarity between two nodes; link-based similarity measures (in short, similarity measures) are well-known and conventional techniques for this task that exploit the relations between nodes (i.e., links) in the graph. Graph embedding methods (in short, embedding methods) convert nodes in a graph into vectors in a low-dimensional space by preserving social relations among nodes in the original graph. Instead of applying a similarity measure to the graph to compute the similarity between nodes a and b, we can consider the proximity between corresponding vectors of a and b obtained by an embedding method as the similarity between a and b. Although embedding methods have been analyzed in a wide range of machine learning tasks such as link prediction and node classification, they are not investigated in terms of similarity computation of nodes. In this paper, we investigate both effectiveness and efficiency of embedding methods in the task of similarity computation of nodes by comparing them with those of similarity measures. To the best of our knowledge, this is the first work that examines the application of embedding methods in this special task. Based on the results of our extensive experiments with five well-known and publicly available datasets, we found the following observations for embedding methods: (1) with all datasets, they show less effectiveness than similarity measures except for one dataset, (2) they underperform similarity measures with all datasets in terms of efficiency except for one dataset, (3) they have more parameters than similarity measures, thereby leading to a time-consuming parameter tuning process, (4) increasing the number of dimensions does not necessarily improve their effectiveness in computing the similarity of nodes. Full article
(This article belongs to the Special Issue Social Network Analysis)
Show Figures

Figure 1

21 pages, 4993 KiB  
Article
Interaction Strength Analysis to Model Retweet Cascade Graphs
by Paola Zola, Guglielmo Cola, Michele Mazza and Maurizio Tesconi
Appl. Sci. 2020, 10(23), 8394; https://0-doi-org.brum.beds.ac.uk/10.3390/app10238394 - 25 Nov 2020
Cited by 10 | Viewed by 2582
Abstract
Tracking information diffusion is a non-trivial task and it has been widely studied across different domains and platforms. The advent of social media has led to even more challenges, given the higher speed of information propagation and the growing impact of social bots [...] Read more.
Tracking information diffusion is a non-trivial task and it has been widely studied across different domains and platforms. The advent of social media has led to even more challenges, given the higher speed of information propagation and the growing impact of social bots and anomalous accounts. Nevertheless, it is crucial to derive a trustworthy information diffusion graph that is capable of highlighting the importance of specific nodes in spreading the original message. The paper introduces the interaction strength, a novel metric to model retweet cascade graphs by exploring users’ interactions. Initial findings showed the soundness of the approaches based on this new metric with respect to the state-of-the-art model, and its ability to generate a denser graph, revealing crucial nodes that participated in the retweet propagation. Reliable retweet graph generation will enable a better understanding of the diffusion path of a specific tweet. Full article
(This article belongs to the Special Issue Social Network Analysis)
Show Figures

Figure 1

Back to TopTop