Graph-Based Data Mining and Social Network Analysis

A special issue of Big Data and Cognitive Computing (ISSN 2504-2289).

Deadline for manuscript submissions: closed (30 April 2023) | Viewed by 27340

Special Issue Editors


E-Mail Website
Guest Editor
Department of Electrical Engineering and Information Technology, University of Naples Federico II, Via Claudio 21, 80125 Naples, Italy
Interests: social network analytics; multimedia recommender systems; big data; artificial intelligence; graph mining; IoT; deep learning
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Department of Electrical Engineering and Information Technology (DIETI), University of Naples Federico II, 21-80125 Naples, Italy
Interests: social network analysis and modelling; designing of artificial intelligence models; deception activities
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

In the last decade, online social networks (OSNs) such as Facebook, Twitter, and Instagram have more and more become an essential part of our life. In particular, the growth of data due to the continuous usage of such networks has focused attention on the development of novel approaches for their effective and efficient analysis. Novel methodologies and techniques are, thus, required to analyze and understand the different social ‘‘ties’’ among users within such communities together with the exchanged information for a large number of applications (e.g., viral marketing, expert finding, community detection, influence or spread diffusion analysis, and so on).

They belong to the “umbrella” term of social network analysis (SNA), whose aim is to investigate social structures using different techniques, considering both social entities’ behavior and their connections. Indeed, these data have a high-dimensional, irregular, and complex structure that can be naturally represented by a graph; thus, in this Special Issue, we focus on graph-based approaches, methods. and tools for SNA which can be exploited for different domains in addition to classical OSNs as well as cultural heritage, e-health, scientific databases, software repositories, etc. In particular, we are interested in the application of graph machine learning techniques for large social network learning and understanding. The aim is to gather solutions, but also lessons learnt, methodologies, and good practices, that researchers and practitioners can use as a basis for their own work concerning the Special Issue topics.

Relevant Topics: Relevant topics of this Special Issue include any aspect of machine learning over graphs, especially for social network analysis. Indicative topics include (but are not restricted to) the following:

  • Machine learning over graphs: kernel-based techniques, clustering methods, scalable algorithms; 
  • Graph neural networks: convolutional, attention, recurrent; 
  • Graph embedding and learning;
  • Knowledge graph representation;
  • Graph machine learning for social network analysis and social computing;
  • Graph machine learning for expert finding and community detection;
  • Graph machine learning for social recommendation;
  • Graph machine learning for viral marketing;
  • Graph machine learning for virus spreading analysis;
  • Graph machine learning for e-health applications;
  • Graph machine learning for cultural heritage;
  • Graph machine learning for software repository mining.

Prof. Dr. Vincenzo Moscato
Dr. Giancarlo Sperlì
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. Big Data and Cognitive Computing is an international peer-reviewed open access monthly 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 1800 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

  • graph machine learning
  • social network analysis
  • graph data mining
  • graph-powered machine learning
  • graph learning

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue polices can be found here.

Published Papers (5 papers)

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

Research

25 pages, 616 KiB  
Article
Modeling, Evaluating, and Applying the eWoM Power of Reddit Posts
by Gianluca Bonifazi, Enrico Corradini, Domenico Ursino and Luca Virgili
Big Data Cogn. Comput. 2023, 7(1), 47; https://doi.org/10.3390/bdcc7010047 - 9 Mar 2023
Cited by 8 | Viewed by 3297
Abstract
Electronic Word of Mouth (eWoM) has been largely studied for social platforms, such as Yelp and TripAdvisor, which are highly investigated in the context of digital marketing. However, it can also have interesting applications in other contexts. Therefore, it can be challenging to [...] Read more.
Electronic Word of Mouth (eWoM) has been largely studied for social platforms, such as Yelp and TripAdvisor, which are highly investigated in the context of digital marketing. However, it can also have interesting applications in other contexts. Therefore, it can be challenging to investigate this phenomenon on generic social platforms, such as Facebook, Twitter, and Reddit. In the past literature, many authors analyzed eWoM on Facebook and Twitter, whereas it was little considered in Reddit. In this paper, we focused exactly on this last platform. In particular, we first propose a model for representing and evaluating the eWoM Power of Reddit posts. Then, we illustrate two possible applications, namely the definition of lifespan templates and the construction of profiles for Reddit posts. Lifespan templates and profiles are ultimately orthogonal to each other and can be jointly employed in several applications. Full article
(This article belongs to the Special Issue Graph-Based Data Mining and Social Network Analysis)
Show Figures

Figure 1

44 pages, 5439 KiB  
Article
Graph-Based Conversation Analysis in Social Media
by Marco Brambilla, Alireza Javadian Sabet, Kalyani Kharmale and Amin Endah Sulistiawati
Big Data Cogn. Comput. 2022, 6(4), 113; https://doi.org/10.3390/bdcc6040113 - 12 Oct 2022
Cited by 5 | Viewed by 6244
Abstract
Social media platforms offer their audience the possibility to reply to posts through comments and reactions. This allows social media users to express their ideas and opinions on shared content, thus opening virtual discussions. Most studies on social networks have focused only on [...] Read more.
Social media platforms offer their audience the possibility to reply to posts through comments and reactions. This allows social media users to express their ideas and opinions on shared content, thus opening virtual discussions. Most studies on social networks have focused only on user relationships or on the shared content, while ignoring the valuable information hidden in the digital conversations, in terms of structure of the discussion and relation between contents, which is essential for understanding online communication behavior. This work proposes a graph-based framework to assess the shape and structure of online conversations. The analysis was composed of two main stages: intent analysis and network generation. Users’ intention was detected using keyword-based classification, followed by the implementation of machine learning-based classification algorithms for uncategorized comments. Afterwards, human-in-the-loop was involved in improving the keyword-based classification. To extract essential information on social media communication patterns among the users, we built conversation graphs using a directed multigraph network and we show our model at work in two real-life experiments. The first experiment used data from a real social media challenge and it was able to categorize 90% of comments with 98% accuracy. The second experiment focused on COVID vaccine-related discussions in online forums and investigated the stance and sentiment to understand how the comments are affected by their parent discussion. Finally, the most popular online discussion patterns were mined and interpreted. We see that the dynamics obtained from conversation graphs are similar to traditional communication activities. Full article
(This article belongs to the Special Issue Graph-Based Data Mining and Social Network Analysis)
Show Figures

Figure 1

35 pages, 1343 KiB  
Article
Predictors of Smartphone Addiction and Social Isolation among Jordanian Children and Adolescents Using SEM and ML
by Evon M. Abu-Taieh, Issam AlHadid, Khalid Kaabneh, Rami S. Alkhawaldeh, Sufian Khwaldeh, Ra’ed Masa’deh and Ala’Aldin Alrowwad
Big Data Cogn. Comput. 2022, 6(3), 92; https://doi.org/10.3390/bdcc6030092 - 2 Sep 2022
Cited by 10 | Viewed by 5265
Abstract
Smartphone addiction has become a major problem for everyone. According to recent studies, a considerable number of children and adolescents are more attracted to smartphones and exhibit addictive behavioral indicators, which are emerging as serious social problems. The main goal of this study [...] Read more.
Smartphone addiction has become a major problem for everyone. According to recent studies, a considerable number of children and adolescents are more attracted to smartphones and exhibit addictive behavioral indicators, which are emerging as serious social problems. The main goal of this study is to identify the determinants that influence children’s smartphone addiction and social isolation among children and adolescents in Jordan. The theoretical foundation of this study model is based on constructs adopted from the Technology Acceptance Model (TAM) (i.e., perceived ease of use and perceived usefulness), with social influence and trust adopted from the TAM extended model along with perceived enjoyment. In terms of methodology, the study uses data from 511 parents who responded via convenient sampling, and the data was collected via a survey questionnaire and used to evaluate the research model. To test the study hypotheses, the empirical validity of the research model was set up, and the data were analyzed with SPSS version 21.0 and AMOS 26 software. Structural equation modeling (SEM), confirmatory factor analysis (CFA), and machine learning (ML) methods were used to test the study hypotheses and validate the properties of the instrument items. The ML methods used are support vector machine (SMO), the bagging reduced error pruning tree (REPTree), artificial neural network (ANN), and random forest. Several major findings were indicated by the results: perceived usefulness, trust, and social influence were significant antecedent behavioral intentions to use the smartphone. Also, findings prove that behavioral intention is statistically supported to have a significant influence on smartphone addiction. Furthermore, the findings confirm that smartphone addiction positively influences social isolation among Jordanian children and adolescents. Yet, perceived ease of use and perceived enjoyment did not have a significant effect on behavioral intention to use the smartphone among Jordanian children and adolescents. The research contributes to the body of knowledge and literature by empirically examining and theorizing the implications of smartphone addiction on social isolation. Further details of the study contribution, as well as research future directions and limitations, are presented in the discussion section. Full article
(This article belongs to the Special Issue Graph-Based Data Mining and Social Network Analysis)
Show Figures

Figure 1

32 pages, 7749 KiB  
Article
CompositeView: A Network-Based Visualization Tool
by Stephen A. Allegri, Kevin McCoy and Cassie S. Mitchell
Big Data Cogn. Comput. 2022, 6(2), 66; https://doi.org/10.3390/bdcc6020066 - 14 Jun 2022
Cited by 5 | Viewed by 5253
Abstract
Large networks are quintessential to bioinformatics, knowledge graphs, social network analysis, and graph-based learning. CompositeView is a Python-based open-source application that improves interactive complex network visualization and extraction of actionable insight. CompositeView utilizes specifically formatted input data to calculate composite scores and display [...] Read more.
Large networks are quintessential to bioinformatics, knowledge graphs, social network analysis, and graph-based learning. CompositeView is a Python-based open-source application that improves interactive complex network visualization and extraction of actionable insight. CompositeView utilizes specifically formatted input data to calculate composite scores and display them using the Cytoscape component of Dash. Composite scores are defined representations of smaller sets of conceptually similar data that, when combined, generate a single score to reduce information overload. Visualized interactive results are user-refined via filtering elements such as node value and edge weight sliders and graph manipulation options (e.g., node color and layout spread). The primary difference between CompositeView and other network visualization tools is its ability to auto-calculate and auto-update composite scores as the user interactively filters or aggregates data. CompositeView was developed to visualize network relevance rankings, but it performs well with non-network data. Three disparate CompositeView use cases are shown: relevance rankings from SemNet 2.0, an open-source knowledge graph relationship ranking software for biomedical literature-based discovery; Human Development Index (HDI) data; and the Framingham cardiovascular study. CompositeView was stress tested to construct reference benchmarks that define breadth and size of data effectively visualized. Finally, CompositeView is compared to Excel, Tableau, Cytoscape, neo4j, NodeXL, and Gephi. Full article
(This article belongs to the Special Issue Graph-Based Data Mining and Social Network Analysis)
Show Figures

Figure 1

42 pages, 679 KiB  
Article
Optimizations for Computing Relatedness in Biomedical Heterogeneous Information Networks: SemNet 2.0
by Anna Kirkpatrick, Chidozie Onyeze, David Kartchner, Stephen Allegri, Davi Nakajima An, Kevin McCoy, Evie Davalbhakta and Cassie S. Mitchell
Big Data Cogn. Comput. 2022, 6(1), 27; https://doi.org/10.3390/bdcc6010027 - 1 Mar 2022
Cited by 8 | Viewed by 4929
Abstract
Literature-based discovery (LBD) summarizes information and generates insight from large text corpuses. The SemNet framework utilizes a large heterogeneous information network or “knowledge graph” of nodes and edges to compute relatedness and rank concepts pertinent to a user-specified target. SemNet provides a way [...] Read more.
Literature-based discovery (LBD) summarizes information and generates insight from large text corpuses. The SemNet framework utilizes a large heterogeneous information network or “knowledge graph” of nodes and edges to compute relatedness and rank concepts pertinent to a user-specified target. SemNet provides a way to perform multi-factorial and multi-scalar analysis of complex disease etiology and therapeutic identification using the 33+ million articles in PubMed. The present work improves the efficacy and efficiency of LBD for end users by augmenting SemNet to create SemNet 2.0. A custom Python data structure replaced reliance on Neo4j to improve knowledge graph query times by several orders of magnitude. Additionally, two randomized algorithms were built to optimize the HeteSim metric calculation for computing metapath similarity. The unsupervised learning algorithm for rank aggregation (ULARA), which ranks concepts with respect to the user-specified target, was reconstructed using derived mathematical proofs of correctness and probabilistic performance guarantees for optimization. The upgraded ULARA is generalizable to other rank aggregation problems outside of SemNet. In summary, SemNet 2.0 is a comprehensive open-source software for significantly faster, more effective, and user-friendly means of automated biomedical LBD. An example case is performed to rank relationships between Alzheimer’s disease and metabolic co-morbidities. Full article
(This article belongs to the Special Issue Graph-Based Data Mining and Social Network Analysis)
Show Figures

Figure 1

Back to TopTop