Browsing by Subject "Graph neural networks"

Now showing 1 - 4 of 4
  • Thumbnail Image
    Item
    Improving the Robustness of Artificial Neural Networks via Bayesian Approaches
    (2023-08) Zhuang, Jun; Al Hasan, Mohammad; Mukhopadhyay, Snehasis; Mohler, George; Tuceryan, Mihran
    Artificial neural networks (ANNs) have achieved extraordinary performance in various domains in recent years. However, some studies reveal that ANNs may be vulnerable in three aspects: label scarcity, perturbations, and open-set emerging classes. Noisy labeling and self-supervised learning approaches address the label scarcity issues, but most of the work couldn't handle the perturbations. Adversarial training methods, topological denoising methods, and mechanism designing methods aim to mitigate the negative effects caused by perturbations. However, adversarial training methods can barely train a robust model under the circumstance of extensive label scarcity; topological denoising methods are not efficient on dynamic data structures; and mechanism designing methods often depend on heuristic explorations. Detection-based methods devote to identifying novel or anomaly instances for further downstream tasks. Nonetheless, such instances may belong to open-set new emerging classes. To embrace the aforementioned challenges, we address the robustness issues of ANNs from two aspects. First, we propose a series of Bayesian label transition models to improve the robustness of Graph Neural Networks (GNNs) in the presence of label scarcity and perturbations in the graph domain. Second, we propose a new non-exhaustive learning model, named NE-GM-GAN, to handle both open-set problems and class-imbalance issues in network intrusion datasets. Extensive experiments with several datasets demonstrate that our proposed models can effectively improve the robustness of ANNs.
  • Thumbnail Image
    Item
    Patient-GAT: Sarcopenia Prediction using Multi-modal Data Fusion and Weighted Graph Attention Networks
    (Association for Computing Machinery, 2023) Xiao, Cary; Imel, Erik A.; Pham, Nam; Luo, Xiao; Medicine, School of Medicine
    Graph Attention Networks (GAT) have been extensively used to perform node-level classification on data that can be represented as a graph. However, few papers have investigated the effectiveness of using GAT on graph representations of patient similarity networks. This paper proposes Patient-GAT, a novel method to predict chronic health conditions by first integrating multi-modal data fusion to generate patient vector representations using imputed lab variables with other structured data. This data representation is then used to construct a patient network by measuring patient similarity, finally applying GAT to the patient network for disease prediction. We demonstrated our framework by predicting sarcopenia using real-world EHRs obtained from the Indiana Network for Patient Care. We evaluated the performance of our system by comparing it to other baseline models, showing that our model outperforms other methods. In addition, we studied the contribution of the temporal representation of the lab data and discussed the interpretability of this model by analyzing the attention coefficients of the trained Patient-GAT model. Our code can be found on Github.
  • Thumbnail Image
    Item
    Robust Node Classification on Graphs: Jointly from Bayesian Label Transition and Topology-based Label Propagation
    (ACM, 2022-10-17) Zhuang, Jun; Al Hasan, Mohammad; Computer and Information Science, School of Science
    Node classification using Graph Neural Networks (GNNs) has been widely applied in various real-world scenarios. However, in recent years, compelling evidence emerges that the performance of GNN-based node classification may deteriorate substantially by topological perturbation, such as random connections or adversarial attacks. Various solutions, such as topological denoising methods and mechanism design methods, have been proposed to develop robust GNN-based node classifiers but none of these works can fully address the problems related to topological perturbations. Recently, the Bayesian label transition model is proposed to tackle this issue but its slow convergence may lead to inferior performance. In this work, we propose a new label inference model, namely LInDT, which integrates both Bayesian label transition and topology-based label propagation for improving the robustness of GNNs against topological perturbations. LInDT is superior to existing label transition methods as it improves the label prediction of uncertain nodes by utilizing neighborhood-based label propagation leading to better convergence of label inference. Besides, LIndT adopts asymmetric Dirichlet distribution as a prior, which also helps it to improve label inference. Extensive experiments on five graph datasets demonstrate the superiority of LInDT for GNN-based node classification under three scenarios of topological perturbations.
  • Thumbnail Image
    Item
    SymptomGraph: Identifying Symptom Clusters from Narrative Clinical Notes using Graph Clustering
    (ACM, 2023) Tahabi, Fattah Muhammad; Storey, Susan; Luo, Xiao; Electrical and Computer Engineering, School of Engineering and Technology
    Patients with cancer or other chronic diseases often experience different symptoms before or after treatments. The symptoms could be physical, gastrointestinal, psychological, or cognitive (memory loss), or other types. Previous research focuses on understanding the individual symptoms or symptom correlations by collecting data through symptom surveys and using traditional statistical methods to analyze the symptoms, such as principal component analysis or factor analysis. This research proposes a computational system, SymptomGraph, to identify the symptom clusters in the narrative text of written clinical notes in electronic health records (EHR). SymptomGraph is developed to use a set of natural language processing (NLP) and artificial intelligence (AI) methods to first extract the clinician-documented symptoms from clinical notes. Then, a semantic symptom expression clustering method is used to discover a set of typical symptoms. A symptom graph is built based on the co-occurrences of the symptoms. Finally, a graph clustering algorithm is developed to discover the symptom clusters. Although SymptomGraph is applied to the narrative clinical notes, it can be adapted to analyze symptom survey data. We applied Symptom-Graph on a colorectal cancer patient with and without diabetes (Type 2) data set to detect the patient symptom clusters one year after the chemotherapy. Our results show that SymptomGraph can identify the typical symptom clusters of colorectal cancer patients’ post-chemotherapy. The results also show that colorectal cancer patients with diabetes often show more symptoms of peripheral neuropathy, younger patients have mental dysfunctions of alcohol or tobacco abuse, and patients at later cancer stages show more memory loss symptoms. Our system can be generalized to extract and analyze symptom clusters of other chronic diseases or acute diseases like COVID-19.