Adaptive Constraint Relaxation in Personalized Nutrition Recommendations: An LLM-Driven Knowledge Graph Retrieval Approach.

AMIA ... Annual Symposium proceedings. AMIA Symposium Pub Date : 2025-05-22 eCollection Date: 2024-01-01
Pengfei Zhang, Mohbat Fnu, Yutong Song, Oshani Seneviratne, Zhongqi Yang, Iman Azimi, Amir M Rahmani
{"title":"Adaptive Constraint Relaxation in Personalized Nutrition Recommendations: An LLM-Driven Knowledge Graph Retrieval Approach.","authors":"Pengfei Zhang, Mohbat Fnu, Yutong Song, Oshani Seneviratne, Zhongqi Yang, Iman Azimi, Amir M Rahmani","doi":"","DOIUrl":null,"url":null,"abstract":"<p><p>Personalized food recommendation systems must balance various constraints, including medical guidelines, nutritional needs, and individual preferences. However, existing methods often struggle with overly restrictive queries, frequently failing to generate recommendations when no exact match exists. To address this challenge, we propose an adaptive knowledge graph (KG) retrieval framework that integrates Large Language Models (LLMs) for intelligent constraint relaxation. Our approach dynamically prioritizes constraints, ensuring that critical dietary requirements remain intact while selectively relaxing less essential ones. By leveraging LLM-driven constraint analysis and structured relaxation strategies, our system significantly enhances recommendation coverage without compromising key dietary needs, while maintaining optimal recommendation performance. Experimental results on both the original and the extended-constraint dataset demonstrate that our method successfully retrieves recommendations in cases where previous approaches fail, achieving higher retrieval accuracy and a balanced tradeoff between flexibility and adherence to dietary constraints. The code is public available at https://github.com/zpf0117b2/adaptiveRetrieval.</p>","PeriodicalId":72180,"journal":{"name":"AMIA ... Annual Symposium proceedings. AMIA Symposium","volume":"2024 ","pages":"1529-1538"},"PeriodicalIF":0.0000,"publicationDate":"2025-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12919543/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"AMIA ... Annual Symposium proceedings. AMIA Symposium","FirstCategoryId":"1085","ListUrlMain":"","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/1/1 0:00:00","PubModel":"eCollection","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Personalized food recommendation systems must balance various constraints, including medical guidelines, nutritional needs, and individual preferences. However, existing methods often struggle with overly restrictive queries, frequently failing to generate recommendations when no exact match exists. To address this challenge, we propose an adaptive knowledge graph (KG) retrieval framework that integrates Large Language Models (LLMs) for intelligent constraint relaxation. Our approach dynamically prioritizes constraints, ensuring that critical dietary requirements remain intact while selectively relaxing less essential ones. By leveraging LLM-driven constraint analysis and structured relaxation strategies, our system significantly enhances recommendation coverage without compromising key dietary needs, while maintaining optimal recommendation performance. Experimental results on both the original and the extended-constraint dataset demonstrate that our method successfully retrieves recommendations in cases where previous approaches fail, achieving higher retrieval accuracy and a balanced tradeoff between flexibility and adherence to dietary constraints. The code is public available at https://github.com/zpf0117b2/adaptiveRetrieval.

个性化营养建议中的自适应约束放松:llm驱动的知识图谱检索方法。
个性化食物推荐系统必须平衡各种限制因素,包括医疗指南、营养需求和个人偏好。然而,现有的方法经常与过于严格的查询作斗争,在不存在精确匹配的情况下经常无法生成推荐。为了解决这一挑战,我们提出了一个自适应知识图(KG)检索框架,该框架集成了大型语言模型(llm),用于智能约束放松。我们的方法动态地优先考虑约束,确保关键的饮食要求保持不变,同时有选择地放松不太重要的要求。通过利用llm驱动的约束分析和结构化放松策略,我们的系统在不影响关键饮食需求的情况下显著提高了推荐覆盖率,同时保持了最佳推荐性能。在原始和扩展约束数据集上的实验结果表明,我们的方法在以前的方法失败的情况下成功地检索了推荐,实现了更高的检索精度,并在灵活性和遵守饮食约束之间取得了平衡。该代码可在https://github.com/zpf0117b2/adaptiveRetrieval上公开获取。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书