基于频繁模式的套餐关联分析与推荐  

Package Association Analysis and Recommendation Based on Frequent Mode

作　　者：刘芳宇 李嘉豪 张琳琳 LIU Fang-Yu;LI Jia-hao;ZHANG Lin-lin(Computer School,University of South China,Hengyang 421000)

机构地区：[1]南华大学计算机学院

出　　处：《现代计算机》2019年第23期35-39,50,共6页Modern Computer

摘　　要：在酒店历史订单数据的基础上,进行菜品套餐间的频繁模式关联分析。根据历史订购事务数据构建FP-Tree,利用FP_Growth算法递归发现所有满足条件的关联规则。利用逆向思维把关联推导条件作为套餐推荐结果,实现一次性将整个套餐菜品全部推荐出来。Based on the historical order data of the hotel,carries out the frequent pattern association analysis of the food package.FP-Tree is con?structed based on historical order transaction data,and all association rules satisfying the conditions are found recursively using the FP_Growth algorithm.Using the reverse thinking to use the relevant derivation conditions as the recommendation result of the package,and finally,the entire package menu is recommended at one time.

关 键 词：频繁模式 关联规则 APRIORI算法 FP_GROWTH算法 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]