Publications-Proceedings

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 Intelligent menu planning: Recommending set of recipes by ingredients
作者 Kuo, F.-F.;Li, C.-T.;Shan, Man-Kwan
沈錳坤
貢獻者 資科系
關鍵詞 Co-occurrence; Cooking recipe; Graph-based; Ingredient; Recipe recommendation; Recommendation mechanism; Steiner trees; Forestry; Research; Trees (mathematics); Cooking; Forestry; Mathematics; Research; Trees;ACM Multimedia 2012
日期 2012
上傳時間 11-Jun-2015 14:25:02 (UTC+8)
摘要 With the growth of recipe sharing services, online cooking recipes associated with ingredients and cooking procedures are available. Many recipe sharing sites have devoted to the development of recipe recommendation mechanism. However, there is a need for users to plan menu of meals by ingredients. While most research on food related research has been on recipe recommendation and retrieval, little research has been done on menu planning. In this paper, we investigate an intelligent menu planning mechanism which recommending sets of recipes by user-specified ingredients. Those recipes which are well-accompanied and contain the query ingredients are returned. We propose a graph-based algorithm for menu planning. The proposed approach constructs a recipe graph to capture the co-occurrence relationships between recipes from collection of menus. A menu is generated by approximate Steiner Tree Algorithm on the constructed recipe graph. Evaluation of menu collections from Food.com shows that the proposed approach achieves encouraging results. © 2012 ACM.
關聯 CEA 2012 - Proceedings of the 2012 ACM Workshop on Multimedia for Cooking and Eating Activities, Co-located with ACM Multimedia 20124th Workshop on Multimedia for Cooking and Eating Activities, CEA 2012; Nara; Japan; 2 November 2012 through 2 November 2012; Code 94174
資料類型 conference
DOI http://dx.doi.org/10.1145/2390776.2390778
dc.contributor 資科系
dc.creator (作者) Kuo, F.-F.;Li, C.-T.;Shan, Man-Kwan
dc.creator (作者) 沈錳坤zh_TW
dc.date (日期) 2012
dc.date.accessioned 11-Jun-2015 14:25:02 (UTC+8)-
dc.date.available 11-Jun-2015 14:25:02 (UTC+8)-
dc.date.issued (上傳時間) 11-Jun-2015 14:25:02 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/75694-
dc.description.abstract (摘要) With the growth of recipe sharing services, online cooking recipes associated with ingredients and cooking procedures are available. Many recipe sharing sites have devoted to the development of recipe recommendation mechanism. However, there is a need for users to plan menu of meals by ingredients. While most research on food related research has been on recipe recommendation and retrieval, little research has been done on menu planning. In this paper, we investigate an intelligent menu planning mechanism which recommending sets of recipes by user-specified ingredients. Those recipes which are well-accompanied and contain the query ingredients are returned. We propose a graph-based algorithm for menu planning. The proposed approach constructs a recipe graph to capture the co-occurrence relationships between recipes from collection of menus. A menu is generated by approximate Steiner Tree Algorithm on the constructed recipe graph. Evaluation of menu collections from Food.com shows that the proposed approach achieves encouraging results. © 2012 ACM.
dc.format.extent 176 bytes-
dc.format.mimetype text/html-
dc.relation (關聯) CEA 2012 - Proceedings of the 2012 ACM Workshop on Multimedia for Cooking and Eating Activities, Co-located with ACM Multimedia 20124th Workshop on Multimedia for Cooking and Eating Activities, CEA 2012; Nara; Japan; 2 November 2012 through 2 November 2012; Code 94174
dc.subject (關鍵詞) Co-occurrence; Cooking recipe; Graph-based; Ingredient; Recipe recommendation; Recommendation mechanism; Steiner trees; Forestry; Research; Trees (mathematics); Cooking; Forestry; Mathematics; Research; Trees;ACM Multimedia 2012
dc.title (題名) Intelligent menu planning: Recommending set of recipes by ingredients
dc.type (資料類型) conferenceen
dc.identifier.doi (DOI) 10.1145/2390776.2390778
dc.doi.uri (DOI) http://dx.doi.org/10.1145/2390776.2390778