Total views : 340
Complexity and Similarity of Recipes based on Entropy Measurement
Background/Objective: New cuisines are being constantly created by people and shared on the internet. Cooking is usually classified and evaluated by subjective factors such as the personal cooking ability. Methods/Statistical Analysis: In this paper, we define the objective method for measuring the recipe complexity using the probabilistic entropy measurement. Through the cooking ingredients and cooking verbs in a recipe, we measure the recipe complexity in terms of the recipe preparation and the recipe procedure. And we calculate the recipe similarity by the entropy of common ingredients and construct the social network of recipes that observes the whole correlation between recipes. Findings: As a result, the most difficult recipe in the cooking preparation is ‘Braised Dongtae Seafood’ that needs 27 ingredients. And the easiest recipe is ‘Boiled Potato’ that only needs 3 ingredients: ‘Potato’, Salt’ and ‘Sugar’. In the cooking procedure, ‘Jeolla-Province Mosi-Songpyeon’ is the most difficult recipe that uses 18 verb types and 28 verbs. The easiest recipe is ‘Healthy Silk-Fowl Soup’ that only uses ‘Boil’ to cook. Through the recipe network, we can measure the distance of the recipes and minimize the effort in ingredient preparation and cooking procedure when we planed the cooking schedule to prepare for many dishes. Application/Improvements: If we plan to cook a schedule, the easy path to cook could be indicated by the shortest path between the recipes in the network.
Entropy, Ingredient, Recipe Complexity, Recipe Network.
- Papadimitriou A, Symeonidis P, Manolopoulos Y. Fast and accurate link prediction in social networking systems. Journal of Systems and Software. 2012; 85(1):2119 –32.
- Bliss CA, Frank MR, Danforth CM, Dodds PS. An evolutionary algorithm approach to link prediction in dynamic social networks. Journal of Computational Science. 2014; 5(1):750–64.
- Ahnert SE. Generalized power graph compression reveals dominant relationship patterns in complex networks. Scientific Reports. 2014; 4(4385):1–6.
- Wang L, Li Q, Li N, Dong G, Yang Y. Substructure similarity measurement in Chinese recipes. Proc. of World Wide Web. 2008; 979–88.
- Teng C, Lin Y, Adamic L. Recipe recommendation using ingredient networks. Proc. of 4th Annual ACM Web Science Conference. 2012; 298–307.
- Freyne J, Berkovsky S. Intelligent food planning: personalized recipe recommendation. Proc. of Intelligent User Interfaces. 2010; 221–4.
- Ueda M, Takahata M, Nakajima S.sass User’s food preference extraction for personalized cooking recipe recommendation. Proceedings of 2nd Workshop on Semantic Personalized Information Management. 2011; 98–105.
- Kuo F, Li C, Shan M, Lee S. Intelligent menu planning: recommending set of recipes by ingredients. Proc. of the ACM Multimedia Workshop on Multimedia for Cooking and Eating Activities. 2012; 1–6.
- Shidochi Y, Takahashi T, Ide I, Murase H. Finding replaceable materials in cooking recipe texts considering characteristic cooking actions. Proceedings of 9th ACM Multimedia Workshop on Multimedia for Cooking and Eating Activities. 2009; 9–14.
- Geleijnse G, Nachtigall P, Kaam PV, Wijgergangs L. A personalized recipe advice system to promote healthful choices. Proceedings of 16th Intelligent User Interfaces. 2011; 437–8.
- Ahn YY, Ahnert SE, Bagrow JP, Barabasi AL. Flavor network and the principles of food pairing. Nature Scientific Reports. 2011; 1–21.
- Ueda M, Asanuma S, Miyawaki Y, Nakajima S. Recipe recommendation method by considering the user’s preference and ingredient quantity of target recipe. Proceedings of the International Multi-Conference of Engineers and Computer Scientists. 2014; 1(1):12–4.
- Kim SD, Lee YJ, Kang SH, Cho HG, Yoon SM. Constructing cookery network based on ingredient entropy measure. Indian Journal of Science and Tchnology. 2015; 8(23):1–9.
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.