Negative link prediction to reduce dropout in Massive Open Online Courses.

In recent years, the rapid growth of Massive Open Online Courses (MOOCs) has attracted much attention for related research. Besides, one of the main challenges in MOOCs is the high dropout or low completion rate. Early dropout prediction algorithms aim the educational institutes to retain the students for the related course. There are several methods for identification of the resigning students. These methods are often based on supervised machine learning, and require student activity records to train and create a prediction model based on the features extracted from the raw data. The performance of graph-based algorithms in various applications to discover the strong or weak relationships between entities using limited data encouraged us to turn to these algorithms for this problem. Objective of this paper is proposing a novel method with low complexity, negative link prediction algorithm, for the first time, utilizing only network topological data for dropout prediction. The idea is based on the assumption that entities with similar network structures are more likely to establish or remove a relation. Therefore, we first convert the data into a graph, mapping entities (students and courses) to nodes and relationships (enrollment data) to links. Then we use graph-based algorithms to predict students' dropout, utilizing just enrollment data. The experimental results demonstrate that the proposed method achieves significant performance compared to baseline ones. However, we test the supervised link prediction idea, and show the competitive and promising results in this case as well. Finally, we present important future research directions to improve the results.

Computational prediction of new therapeutic effects of probiotics.

Probiotics are living microorganisms that provide health benefits to their hosts, potentially aiding in the treatment or prevention of various diseases, including diarrhea, irritable bowel syndrome, ulcerative colitis, and Crohn's disease. Motivated by successful applications of link prediction in medical and biological networks, we applied link prediction to the probiotic-disease network to identify unreported relations. Using data from the Probio database and International Classification of Diseases-10th Revision (ICD-10) resources, we constructed a bipartite graph focused on the relationship between probiotics and diseases. We applied customized link prediction algorithms for this bipartite network, including common neighbors, Jaccard coefficient, and Adamic/Adar ranking formulas. We evaluated the results using Area under the Curve (AUC) and precision metrics. Our analysis revealed that common neighbors outperformed the other methods, with an AUC of 0.96 and precision of 0.6, indicating that basic formulas can predict at least six out of ten probable relations correctly. To support our findings, we conducted an exact search of the top 20 predictions and found six confirming papers on Google Scholar and Science Direct. Evidence suggests that Lactobacillus jensenii may provide prophylactic and therapeutic benefits for gastrointestinal diseases and that Lactobacillus acidophilus may have potential activity against urologic and female genital illnesses. Further investigation of other predictions through additional preclinical and clinical studies is recommended. Future research may focus on deploying more powerful link prediction algorithms to achieve better and more accurate results.

Visibility graph analysis for brain: scoping review.

In the past two decades, network-based analysis has garnered considerable attention for analyzing time series data across various fields. Time series data can be transformed into graphs or networks using different methods, with the visibility graph (VG) being a widely utilized approach. The VG holds extensive applications in comprehending, identifying, and predicting specific characteristics of time series data. Its practicality extends to domains such as medicine, economics, meteorology, tourism, and others. This research presents a scoping review of scholarly articles published in reputable English-language journals and conferences, focusing on VG-based analysis methods related to brain disorders. The aim is to provide a foundation for further and future research endeavors, beginning with an introduction to the VG and its various types. To achieve this, a systematic search and refinement of relevant articles were conducted in two prominent scientific databases: Google Scholar and Scopus. A total of 51 eligible articles were selected for a comprehensive analysis of the topic. These articles categorized based on publication year, type of VG used, rationale for utilization, machine learning algorithms employed, frequently occurring keywords, top authors and universities, evaluation metrics, applied network properties, and brain disorders examined, such as Epilepsy, Alzheimer's disease, Autism, Alcoholism, Sleep disorders, Fatigue, Depression, and other related conditions. Moreover, there are recommendations for future advancements in research, which involve utilizing cutting-edge techniques like graph machine learning and deep learning. Additionally, the exploration of understudied medical conditions such as attention deficit hyperactivity disorder and Parkinson's disease is also suggested.

Reversibility of link prediction and its application to epidemic mitigation.

Current link prediction strategies are about finding new probable strong relations to establish or weak ones to remove. An interesting strategy is utilizing link prediction to prioritize the edges in the network and finding newly probable established relations. In this paper we will introduce and explain RLP, reverse link prediction, as a new paradigm, and use popular basic scoring methods including CN, JC, AA, RA, and PA, as its core to examine. The test cases are nine datasets. Half of them are contact networks in different levels from personal contact to aviation, and another half is for covering different test situations. After reviewing the edge removal based epidemic mitigation methods, we show that RLP can be used to decrease the epidemics spreading speed as a general method with various link prediction algorithms, and here in this paper, preferential attachment (PA) has the best results overall. But the results heavily depend on the nature of the examined networks: regular, scale-free or small-world. We also propose an easy to understand criteria, path count, for comparing the efficacy of epidemics mitigation methods. RLP can be extended to use other link prediction scoring methods in various types of graphs as well.

Computational Prediction of Probable Single Nucleotide Polymorphism-Cancer Relationships.

Genetic variations such as single nucleotide polymorphisms (SNPs) can cause susceptibility to cancer. Although thousands of genetic variants have been identified to be associated with different cancers, the molecular mechanisms of cancer remain unknown. There is not a particular dataset of relationships between cancer and SNPs, as a bipartite network, for computational analysis and prediction. Link prediction as a computational graph analysis method can help us to gain new insight into the network. In this article, after creating a network between cancer and SNPs using SNPedia and Cancer Research UK databases, we evaluated the computational link prediction methods to foresee new SNP-Cancer relationships. Results show that among the popular scoring methods based on network topology, for relation prediction, the preferential attachment (PA) algorithm is the most robust method according to computational and experimental evidence, and some of its computational predictions are corroborated in recent publications. According to the PA predictions, rs1801394-Non-small cell lung cancer, rs4880-Non-small cell lung cancer, and rs1805794-Colorectal cancer are some of the best probable SNP-Cancer associations that have not yet been mentioned in any published article, and they are the most probable candidates for additional laboratory and validation studies. Also, it is feasible to improve the predicting algorithms to produce new predictions in the future.

Predicting brain network changes in Alzheimer's disease with link prediction algorithms.

Link prediction is a promising research area for modeling various types of networks and has mainly focused on predicting missing links. Link prediction methods may be valuable for describing brain connectivity, as it changes in Alzheimer's disease (AD) and its precursor, mild cognitive impairment (MCI). Here, we analyzed 3-tesla whole-brain diffusion-weighted images from 202 participants in the Alzheimer's Disease Neuroimaging Initiative (ADNI) - 50 healthy controls, 72 with earlyMCI (eMCI) and 38 with lateMCI (lMCI) and 42 AD patients. We introduce a novel approach for Mixed Link Prediction (MLP) to test and define the percent of predictability of each heightened stage of dementia from its previous, less impaired stage, in the simplest case. Using well-known link prediction algorithms as the core of MLP, we propose a new approach that predicts stages of cognitive impairment by simultaneously adding and removing links in the brain networks of elderly individuals. We found that the optimal algorithm, called "Adamic and Adar", had the best fit and most accurately predicted the stages of AD from their previous stage. When compared to the other link prediction algorithms, that mainly only predict the added links, our proposed approach can more inclusively simulate the brain changes during disease by both adding and removing links of the network. Our results are also in line with computational neuroimaging and clinical findings and can be improved for better results.