检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华南农业大学数学与信息学院,广东广州510642 [2]广州泰迪智能科技有限公司,广东广州510670
出 处:《广西科技大学学报》2017年第3期117-123,131,共8页Journal of Guangxi University of Science and Technology
基 金:广东省大学生创新创业训练计划项目(201610564338)资助
摘 要:为了节省客户的点餐时间,方便客户从海量菜品中找到理想的菜品,本文尝试将关联规则与餐饮服务相结合.通过引入FP-tree关联规则算法,并利用得到的菜品推荐公式中的关联度指标,再综合商家利益最大化、热销菜品等因素及其重要程度创建菜品推荐综合评分公式.基于综合评分对各菜品进行推荐排序,排序结果最终以移动方式推送给顾客,实现菜品动态推荐服务.With the advent of the information era, the relationship between e-commerce and data mining becomes closer, and personalized recommendation service gradually walks into our daily life. In order to save the time of ordering dishes, and to help customers find their favorite dishes from numerous dishes, this paper attempts to develop an intelligent recommendation system for catering service based on the association rules. We establish the comprehensive score formula of dish selection by introducing the FP-tree association rules, using the correlation index of the recommended formula and synthesizing some factors such as the maximum of benefits, hot dishes, etc.The dishes recommendation service is based on the rank of comprehensive score and the sorted results are finally pushed to the customer in a mobile way.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229