Long-term care plan recommendation for older adults with disabilities: a bipartite graph transformer and self-supervised approach.

IF 4.7 2区 医学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Chunlong Miao, Jingjing Luo, Yan Liang, Hong Liang, Yuhui Cen, Shijie Guo, Hongliu Yu
{"title":"Long-term care plan recommendation for older adults with disabilities: a bipartite graph transformer and self-supervised approach.","authors":"Chunlong Miao, Jingjing Luo, Yan Liang, Hong Liang, Yuhui Cen, Shijie Guo, Hongliu Yu","doi":"10.1093/jamia/ocae327","DOIUrl":null,"url":null,"abstract":"<p><strong>Background: </strong>With the global population aging and advancements in the medical system, long-term care in healthcare institutions and home settings has become essential for older adults with disabilities. However, the diverse and scattered care requirements of these individuals make developing effective long-term care plans heavily reliant on professional nursing staff, and even experienced caregivers may make mistakes or face confusion during the care plan development process. Consequently, there is a rigid demand for intelligent systems that can recommend comprehensive long-term care plans for older adults with disabilities who have stable clinical conditions.</p><p><strong>Objective: </strong>This study aims to utilize deep learning methods to recommend comprehensive care plans for the older adults with disabilities.</p><p><strong>Methods: </strong>We model the care data of older adults with disabilities using a bipartite graph. Additionally, we employ a prediction-based graph self-supervised learning (SSL) method to mine deep representations of graph nodes. Furthermore, we propose a novel graph Transformer architecture that incorporates eigenvector centrality to augment node features and uses graph structural information as references for the self-attention mechanism. Ultimately, we present the Bipartite Graph Transformer (BiT) model to provide personalized long-term care plan recommendation.</p><p><strong>Results: </strong>We constructed a bipartite graph comprising of 1917 nodes and 195 240 edges derived from real-world care data. The proposed model demonstrates outstanding performance, achieving an overall F1 score of 0.905 for care plan recommendations. Each care service item reached an average F1 score of 0.897, indicating that the BiT model is capable of accurately selecting services and effectively balancing the trade-off between incorrect and missed selections.</p><p><strong>Discussion: </strong>The BiT model proposed in this paper demonstrates strong potential for improving long-term care plan recommendations by leveraging bipartite graph modeling and graph SSL. This approach addresses the challenges of manual care planning, such as inefficiency, bias, and errors, by offering personalized and data-driven recommendations. While the model excels in common care items, its performance on rare or complex services could be enhanced with further refinement. These findings highlight the model's ability to provide scalable, AI-driven solutions to optimize care planning, though future research should explore its applicability across diverse healthcare settings and service types.</p><p><strong>Conclusions: </strong>Compared to previous research, the novel model proposed in this article effectively learns latent topology in bipartite graphs and achieves superior recommendation performance. Our study demonstrates the applicability of SSL and graph transformers in recommending long-term care plans for older adults with disabilities.</p>","PeriodicalId":50016,"journal":{"name":"Journal of the American Medical Informatics Association","volume":" ","pages":""},"PeriodicalIF":4.7000,"publicationDate":"2025-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the American Medical Informatics Association","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1093/jamia/ocae327","RegionNum":2,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Background: With the global population aging and advancements in the medical system, long-term care in healthcare institutions and home settings has become essential for older adults with disabilities. However, the diverse and scattered care requirements of these individuals make developing effective long-term care plans heavily reliant on professional nursing staff, and even experienced caregivers may make mistakes or face confusion during the care plan development process. Consequently, there is a rigid demand for intelligent systems that can recommend comprehensive long-term care plans for older adults with disabilities who have stable clinical conditions.

Objective: This study aims to utilize deep learning methods to recommend comprehensive care plans for the older adults with disabilities.

Methods: We model the care data of older adults with disabilities using a bipartite graph. Additionally, we employ a prediction-based graph self-supervised learning (SSL) method to mine deep representations of graph nodes. Furthermore, we propose a novel graph Transformer architecture that incorporates eigenvector centrality to augment node features and uses graph structural information as references for the self-attention mechanism. Ultimately, we present the Bipartite Graph Transformer (BiT) model to provide personalized long-term care plan recommendation.

Results: We constructed a bipartite graph comprising of 1917 nodes and 195 240 edges derived from real-world care data. The proposed model demonstrates outstanding performance, achieving an overall F1 score of 0.905 for care plan recommendations. Each care service item reached an average F1 score of 0.897, indicating that the BiT model is capable of accurately selecting services and effectively balancing the trade-off between incorrect and missed selections.

Discussion: The BiT model proposed in this paper demonstrates strong potential for improving long-term care plan recommendations by leveraging bipartite graph modeling and graph SSL. This approach addresses the challenges of manual care planning, such as inefficiency, bias, and errors, by offering personalized and data-driven recommendations. While the model excels in common care items, its performance on rare or complex services could be enhanced with further refinement. These findings highlight the model's ability to provide scalable, AI-driven solutions to optimize care planning, though future research should explore its applicability across diverse healthcare settings and service types.

Conclusions: Compared to previous research, the novel model proposed in this article effectively learns latent topology in bipartite graphs and achieves superior recommendation performance. Our study demonstrates the applicability of SSL and graph transformers in recommending long-term care plans for older adults with disabilities.

求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of the American Medical Informatics Association
Journal of the American Medical Informatics Association 医学-计算机:跨学科应用
CiteScore
14.50
自引率
7.80%
发文量
230
审稿时长
3-8 weeks
期刊介绍: JAMIA is AMIA''s premier peer-reviewed journal for biomedical and health informatics. Covering the full spectrum of activities in the field, JAMIA includes informatics articles in the areas of clinical care, clinical research, translational science, implementation science, imaging, education, consumer health, public health, and policy. JAMIA''s articles describe innovative informatics research and systems that help to advance biomedical science and to promote health. Case reports, perspectives and reviews also help readers stay connected with the most important informatics developments in implementation, policy and education.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信