Indirect estimation of pediatric reference interval via density graph deep embedded clustering

被引:0
|
作者
Zheng, Jianguo [1 ]
Tang, Yongqiang [1 ]
Peng, Xiaoxia [2 ]
Zhao, Jun [3 ]
Chen, Rui [1 ]
Yan, Ruohua [2 ]
Peng, Yaguang [2 ]
Zhang, Wensheng [1 ]
机构
[1] Chinese Acad Sci, Inst Automat, State Key Lab Multimodal Artificial Intelligence, Beijing 100190, Peoples R China
[2] Capital Med Univ, Beijing Childrens Hosp, Natl Ctr Childrens Hlth, Ctr Clin Epidemiol & Evidence Based Med, Beijing, Peoples R China
[3] Capital Med Univ, Beijing Childrens Hosp, Natl Ctr Childrens Hlth, Informat Ctr, Beijing, Peoples R China
基金
中国国家自然科学基金;
关键词
Reference interval; Indirect estimation; Machine learning; Deep neural networks; Graph clustering; LABORATORY DATA-BASES; BLOOD-COUNT; ALGORITHM;
D O I
10.1016/j.compbiomed.2023.107852
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Establishing reference intervals (RIs) for pediatric patients is crucial in clinical decision-making, and there is a critical gap of pediatric RIs in China. However, the direct sampling technique for establishing RIs is resource-intensive and ethically challenging. Indirect estimation methods, such as unsupervised clustering algorithms, have emerged as potential alternatives for predicting reference intervals. This study introduces deep graph clustering methods into indirect estimation of pediatric reference intervals. Specifically, we propose a Density Graph Deep Embedded Clustering (DGDEC) algorithm, which incorporates a density feature extractor to enhance sample representation and provides additional perspectives for distinguishing different levels of health status among populations. Additionally, we construct an adjacency matrix by computing the similarity between samples after feature enhancement. The DGDEC algorithm leverages the adjacency matrix to capture the interrelationships between patients and divides patients into different groups, thereby estimating reference intervals for the potential healthy population. The experimental results demonstrate that when compared to other indirect estimation techniques, our method ensures the predicted pediatric reference intervals in different age and gender groups are closer to the true values while maintaining good generalization performance. Additionally, through ablation experiments, our study confirms that the similarity between patients and the multi-scale density features of samples can effectively describe the potential health status of patients.
引用
收藏
页数:10
相关论文
共 50 条
  • [11] An advancement in clustering via nonparametric density estimation
    Giovanna Menardi
    Adelchi Azzalini
    Statistics and Computing, 2014, 24 : 753 - 767
  • [12] An advancement in clustering via nonparametric density estimation
    Menardi, Giovanna
    Azzalini, Adelchi
    STATISTICS AND COMPUTING, 2014, 24 (05) : 753 - 767
  • [13] Data Driven SVBRDF Estimation Using Deep Embedded Clustering
    Kim, Yong Hwi
    Lee, Kwan H.
    ELECTRONICS, 2022, 11 (19)
  • [14] RIbench: A Proposed Benchmark for the Standardized Evaluation of Indirect Methods for Reference Interval Estimation
    Ammer, Tatjana
    Schuetzenmeister, Andre
    Prokosch, Hans-Ulrich
    Zierk, Jakob
    Rank, Christopher M.
    Rauh, Manfred
    CLINICAL CHEMISTRY, 2022, 68 (11) : 1410 - 1424
  • [15] A Scalable Deep Network for Graph Clustering via Personalized PageRank
    Zhao, Yulin
    Li, Xunkai
    Zhu, Yinlin
    Li, Jin
    Wang, Shuo
    Jiang, Bin
    APPLIED SCIENCES-BASEL, 2022, 12 (11):
  • [16] Towards Faster Deep Graph Clustering via Efficient Graph Auto-Encode
    Ding, Shifei
    Wu, Benyu
    Ding, Ling
    Xu, Xiao
    Guo, Lili
    Liao, Hongmei
    Wu, Xindong
    ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2024, 18 (08)
  • [17] Dip-based Deep Embedded Clustering with k-Estimation
    Leiber, Collin
    Bauer, Lena G. M.
    Schelling, Benjamin
    Boehm, Christian
    Plant, Claudia
    KDD '21: PROCEEDINGS OF THE 27TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2021, : 903 - 913
  • [18] Deep Multi-Graph Clustering via Attentive Cross-Graph Association
    Luo, Dongsheng
    Ni, Jingchao
    Wang, Suhang
    Bian, Yuchen
    Yu, Xiong
    Zhang, Xiang
    PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (WSDM '20), 2020, : 393 - 401
  • [19] Deep graph clustering via mutual information maximization and mixture model
    Ahmadi, Maedeh
    Safayani, Mehran
    Mirzaei, Abdolreza
    KNOWLEDGE AND INFORMATION SYSTEMS, 2024, 66 (08) : 4549 - 4572
  • [20] Learning Multimodal Taxonomy via Variational Deep Graph Embedding and Clustering
    Zhang, Huaiwen
    Fang, Quan
    Qian, Shengsheng
    Xu, Changsheng
    PROCEEDINGS OF THE 2018 ACM MULTIMEDIA CONFERENCE (MM'18), 2018, : 681 - 689