K最近邻算法在预制菜产业发展中的应用  

The Application of K-Nearest Neighbor Algorithm in the Development of Prefabricated Vegetable Industry

作　　者：檀巧斌 TAN Qiaobin(Fujian Food Association,Fuzhou,Fujian 350028,China)

机构地区：[1]福建省食品工业协会,福建福州350028

出　　处：《农产品加工》2024年第10期113-116,共4页Farm Products Processing

摘　　要：预制菜是以一种或多种农产品为主要原料,通过标准化流程操作,经过预先加工或预先烹调而成,并最终进行预先包装的成品或半成品菜肴。近年来,该行业快速发展,K最近邻(K-nearest Neighbor,KNN)分类算法被视为基础的分类与回归方法之一,具有较为成熟的理论基础,是机器学习领域中被广泛应用的算法之一。综述了预制菜的发展史、分类、现状,最近邻算法基本原理及K最近邻算法模型在预制菜产业发展中的应用研究,以期对预制菜应用领域科研攻关的方向、产业的发展研究提供参考。Precooked dishes were finished or semi-finished dishes made from one or more agricultural products as the main ingredients.They were processed or cooked in advance through standardized procedures and ultimately packaged in advance.In recent years,this industry has experienced rapid development.The K-nearest Neighbor(KNN)classification algorithm was regarded as one of the basic methods for classification and regression.It has a relatively mature theoretical foundation and was one of the widely used algorithms in the field of machine learning.This paper discussed the development history,classification,and current status of precooked dishes,as well as the basic principles of the nearest neighbor algorithm and the application research of the K-nearest neighbor algorithm model in the development of the precooked dishes dish industry.The aim was to provide references for the direction of scientific research and industrial development in the application field of precooked dishes.

关 键 词：预制菜 最近邻算法 K最近邻算法模型 

分 类 号：TS251.1[轻工技术与工程—农产品加工及贮藏工程]