Wang Ruomei, Guo Wei, Wang Yongjie, Zhou Xin, Leung Jonathan Cyril, Yan Shuo, Cui Lizhen
Shandong University, Jinan, 250210, China.
Nanyang Technological University, Singapore.
Methods. 2024 Sep;229:41-48. doi: 10.1016/j.ymeth.2024.06.003. Epub 2024 Jun 14.
Graph neural networks (GNNs) have gained significant attention in disease prediction where the latent embeddings of patients are modeled as nodes and the similarities among patients are represented through edges. The graph structure, which determines how information is aggregated and propagated, plays a crucial role in graph learning. Recent approaches typically create graphs based on patients' latent embeddings, which may not accurately reflect their real-world closeness. Our analysis reveals that raw data, such as demographic attributes and laboratory results, offers a wealth of information for assessing patient similarities and can serve as a compensatory measure for graphs constructed exclusively from latent embeddings. In this study, we first construct adaptive graphs from both latent representations and raw data respectively, and then merge these graphs via weighted summation. Given that the graphs may contain extraneous and noisy connections, we apply degree-sensitive edge pruning and kNN sparsification techniques to selectively sparsify and prune these edges. We conducted intensive experiments on two diagnostic prediction datasets, and the results demonstrate that our proposed method surpasses current state-of-the-art techniques.
图神经网络(GNN)在疾病预测中受到了广泛关注,其中患者的潜在嵌入被建模为节点,患者之间的相似性通过边来表示。决定信息如何聚合和传播的图结构在图学习中起着至关重要的作用。最近的方法通常基于患者的潜在嵌入创建图,这可能无法准确反映他们在现实世界中的亲近程度。我们的分析表明,诸如人口统计学属性和实验室结果等原始数据为评估患者相似性提供了丰富的信息,并且可以作为仅从潜在嵌入构建的图的一种补偿措施。在本研究中,我们首先分别从潜在表示和原始数据构建自适应图,然后通过加权求和合并这些图。鉴于图可能包含无关和噪声连接,我们应用度敏感边剪枝和kNN稀疏化技术来选择性地稀疏和修剪这些边。我们在两个诊断预测数据集上进行了深入实验,结果表明我们提出的方法优于当前的先进技术。