Predicting onset of disease progression using temporal disease occurrence networks

被引:6
作者
Choudhary, G. I. [1 ]
Franti, P. [1 ]
机构
[1] Univ Eastern Finland, Sch Comp, Kuopio, Finland
基金
芬兰科学院;
关键词
Chronic Disease; Data Mining; Disease Progression Network; Disease Future Risk Prediction; Health Informatics; Network Theory;
D O I
10.1016/j.ijmedinf.2023.105068
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Objective: Early recognition and prevention are crucial for reducing the risk of disease progression. This study aimed to develop a novel technique based on a temporal disease occurrence network to analyze and predict disease progression.Methods: This study used a total of 3.9 million patient records. Patient health records were transformed into temporal disease occurrence networks, and a supervised depth first search was used to find frequent disease sequences to predict the onset of disease progression. The diseases represented nodes in the network and paths between nodes represented edges that co-occurred in a patient cohort with temporal order. The node and edge level attributes contained meta-information about patients' gender, age group, and identity as labels where the disease occurred. The node and edge level attributes guided the depth first search to identify frequent disease occurrences in specific genders and age groups. The patient history was used to match the most frequent disease occurrences and then the obtained sequences were merged together to generate a ranked list of diseases with their conditional probability and relative risk. Results: The study found that the proposed method had improved performance compared to other methods. Specifically, when predicting a single disease, the method achieved an area under the receiver operating characteristic curve (AUC) of 0.65 and an F1-score of 0.11. When predicting a set of diseases relative to ground truth, the method achieved an AUC of 0.68 and an F1-score of 0.13. Conclusion: The ranked list generated by the proposed method, which includes the probability of occurrence and relative risk score, can provide physicians with valuable information about the sequential development of diseases in patients. This information can help physicians to take preventive measures in a timely manner, based on the best available information.
引用
收藏
页数:11
相关论文
共 39 条
[1]   Missing Link Prediction using Common Neighbor and Centrality based Parameterized Algorithm [J].
Ahmad, Iftikhar ;
Akhtar, Muhammad Usman ;
Noor, Salma ;
Shahnaz, Ambreen .
SCIENTIFIC REPORTS, 2020, 10 (01)
[2]  
Backstrom L., 2011, P 4 ACM INT C WEB SE, P635
[3]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[4]   Fast unfolding of communities in large networks [J].
Blondel, Vincent D. ;
Guillaume, Jean-Loup ;
Lambiotte, Renaud ;
Lefebvre, Etienne .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
[5]   Intelligent information: A national system for monitoring clinical performance [J].
Bottle, Alex ;
Aylin, Paul .
HEALTH SERVICES RESEARCH, 2008, 43 (01) :10-31
[6]   The anatomy of a large-scale hypertextual Web search engine [J].
Brin, S ;
Page, L .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117
[7]  
Davis D., 2008, Predicting individual disease risk based on medical history, P769
[8]   Time to CARE: a collaborative engine for practical disease prediction [J].
Davis, Darcy A. ;
Chawla, Nitesh V. ;
Christakis, Nicholas A. ;
Barabasi, Albert-Laszlo .
DATA MINING AND KNOWLEDGE DISCOVERY, 2010, 20 (03) :388-415
[9]   Algorithmic prediction of individual diseases [J].
Ding, Runkang ;
Jiang, Fan ;
Xie, Jingui ;
Yu, Yugang .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2017, 55 (03) :750-768
[10]   COPD comorbidities network [J].
Divo, Miguel J. ;
Casanova, Ciro ;
Marin, Jose M. ;
Pinto-Plata, Victor M. ;
de-Torres, Juan P. ;
Zulueta, Javier J. ;
Cabrera, Carlos ;
Zagaceta, Jorge ;
Sanchez-Salcedo, Pablo ;
Berto, Juan ;
Baz Davila, Rebeca ;
Alcaide, Ana B. ;
Cote, Claudia ;
Celli, Bartolome R. .
EUROPEAN RESPIRATORY JOURNAL, 2015, 46 (03) :640-650