基于K均值聚类算法的图书商品推荐仿真系统

研究推荐仿真系统是电子商务个性化服务中的重要技术,基于内容的推荐和协同过滤是推荐系统的重要方法.在实际应用中存在着特征提取困难、计算量大的难题.为了准确提取信息,增加可信度,提出了一种基于K均值聚类和关联规则的推荐方法.可以根据每个用户的购买记录采用改进的K均值算法进行客户细分,将具有相似购买倾向的用户划分为一类;对每个类的用户的购买记录进行关联规则挖掘,建立个性化知识库.依据个性化知识库和用户的购买记录,生成推荐结果.以某电子商务网站中的图书商品为例进行了仿真实验.仿真结果表明,方法具有较高的运算效率而且推荐结果具有合理性和准确性.     

网上购物平台多推荐融合算法研究

推荐系统能帮助用户有效解决信息过载问题,现已被广泛应用于各大网上的购物平台.对用户而言,好的推荐算法能够帮助其从海量商品中快速准确发现符合自己需求的商品;对商家而言,及时呈现给用户恰当的物品能帮助商家实现精准营销,发掘长尾商品并推荐给感兴趣的用户以提高销售额.协同过滤、基于内容推荐是目前应用成熟的推荐方法,但这些方法存在数据疏散、冷启动、可扩展性差和多媒体信息特征难以提取等问题.因此,文中提出基于融合LR-GBDT-XGBOOST的个性化推荐算法,可有效缓解上述问题.在阿里巴巴天池大数据竞赛公开数据集上进行实验,结果显示,该算法降低了推荐稀疏性,提高了推荐精度.     

基于商品特征的个性化推荐算法

针对现有个性化商品推荐算法精度不高、新商品不能及时推荐等缺点,提出了一种基于商品特征、用户购买日志及用户实时浏览行为的个性化推荐算法。算法首先根据客户的在线浏览情况获取当前客户的购买倾向,然后将客户的购买日志与商品特征数据库进行对比分析,获得客户对商品特征的偏爱度及推荐参照组,依据特征实体的相似度矩阵进行特征推荐组推荐,最后结合当前的购买倾向向客户推荐商品。     

基于热扩散影响力传播的社交网络个性化推荐算法

有针对性地为用户提供推荐,提高互联网信息利用率是个性化推荐系统的主要目标.文中基于热扩散传播概率模型,结合用户在社交网络中隐含的跟随关系,提出基于热扩散影响力传播的社交网络个性化推荐算法.首先,算法将现实生活中人与人的朋友关系转化为购物网络中用户与用户的跟随关系,构建异构信息网络图,计算用户之间的复合相似度.然后,利用基于热扩散概率模型模拟社会网络中影响力的传播过程,计算社交网络中用户的跟随概率分数并精确排序,筛选与目标用户相似的邻近用户.最后,根据目标邻近用户对各个产品的评分,将评分较高、具有潜在兴趣的产品推荐给目标用户,实现个性化的用户推荐.在公开数据集上与现有的个性化推荐算法进行对比,实验表明,文中算法具有较好的精确度和多样化的推荐效果.     

基于内容与协同过滤的混合推荐算法在数字科技馆中的应用

推荐系统作为一种筛选信息的工具，可以更加有效地解决“信息过载”问题，以个性化的方式提供满足用户需求的内容。本文根据基于内容的推荐算法和基于用户的协同过滤算法优缺点，将两种算法相结合，构建出基于混合算法的推荐系统，改善了数据稀疏性问题。具体介绍了混合推荐系统的设计思路和实现方法，在中国数字科技馆网站建设中进行应用。解决了网站科普资源个性化匹配不精准、优质资源曝光度不够等问题。     

基于区块链的保险产品推荐模型

我国的保险市场正在经历快速发展时期,客户、保险主体和产品的多样性使得产品推荐成为一个热点问题.然而,精准的产品推荐面临着隐私保护问题和可信问题带来的技术挑战.本文首先对客户与保险公司的需求匹配问题进行了分析,然后基于区块链技术提出了一个新的保险产品推荐模型,客户和保险公司可以将对方需要的隐私信息安全地提交给推荐模型进行需求匹配,从而实现了更为精准的产品推荐.实验表明该模型可以在保护隐私的同时,实现产品推荐过程的安全可信和透明公正.     

电影推荐系统的设计与实现

采用Python作为主要开发语言,利用Scrapy抓取电影信息作为基础数据集,设计实现了一个电影推荐系统。该系统采用基于用户的协同过滤算法实现电影推荐,并包括以下几个主要功能:用户注册、用户登录、电影大厅(提供电影筛选服务)、标签管理、电影的个性化推荐、影评、详细影片信息查看、个人喜好列表维护、个人信息修改等,为用户提供个性化的电影推荐服务。     

远程培训中个性化学习资源推荐算法

本文提出一种基于标签的多因素推荐算法.用户可以根据自己的需求,进行因素自定义和优先级排序,算法先根据用户初始化信息选取资源,随后分析用户行为数据更新用户所属的群及用户的喜好,再通过用户与项目相似度计算、项目关联度计算为用户推荐所需资源.算法模型采用分类组合得出结果,降低了相似度计算的复杂度.将算法应用于企业远程培训平台的个性化学习模式中,结果表明,该算法较好地改善了用户个性化学习资源的推荐效果.     

基于上下文感知和个性化度量嵌入的下一个兴趣点推荐

随着基于位置的社交网络推荐系统的逐步发展,兴趣点推荐成为了研究热门。兴趣点推荐的研究旨在为用户推荐兴趣点,并且为商家提供广告投放和潜在客户发掘等服务。由于用户签到行为的数据具有高稀疏性,为兴趣点推荐带来很大的挑战。许多研究工作结合地理影响、时间效应、社会相关性等方面的因素来提高兴趣点推荐的性能。然而,在大多数兴趣点推荐的工作中,用户访问的周期性习惯和伴随用户偏好的上下文情境信息没有被深度地挖掘。而且,下一个兴趣点推荐中一直存在着数据的高稀疏度。基于以上考虑,针对用户签到的数据稀疏性问题,将用户周期性行为模式归结为上下文情境信息,提出了一种基于上下文感知的个性化度量嵌入推荐算法,同时将用户签到的上下文情境信息考虑进来,从而丰富有效数据,缓解数据稀疏性问题,提高推荐的准确率,并且进一步优化算法,降低时间复杂度。在两个真实数据集上的实验分析表明,本文提出的算法具有更好的推荐效果。     

基于协同过滤算法的求职推荐系统设计与实现

我国高等教育和网络招聘的迅速发展，为社会带来了大量的求职需求。如何提高人岗匹配的精准性与效率是关键问题。通过对协同过滤算法进行研究，同时根据用户的特征和喜好构建其个人偏好模型，设计了基于协同过滤算法的求职推荐系统，为用户推荐匹配的岗位和精准个性化的职业路线。     

Exploiting long‐term and short‐term preferences and RFID trajectories in shop recommendation

Shop recommendation in large shopping malls is useful in the mobile internet era. With the maturity of indoor positioning technology, customers' indoor trajectories can be captured by radio frequency identification devices readers, which provides a new way to analyze customers' potential preferences. In this paper, we design three methods for the top‐N shop recommendation problem. The first method is an improved matrix factorization method fusing estimated prior customer preference matrix that is constructed by Session‐based Temporal Graph computing. The second method is a Bayesian personalized ranking method based on the first method. The third method is by tensor decomposition combined with Session‐based Temporal Graph. Besides, we exploit customer history radio frequency identification devices trajectory information to find customers' frequent paths and revise predicted rating values to improve recommendation accuracy. Our methods are effective in modeling customers' temporal dynamics. At the same time, our approach considers repeated recommendation of the same shop by designing rating update rules. The test dataset is formed by JoyCity customer behavior records. JoyCity is a large‐scale modern shopping center in downtown Shanghai, China. The results show that our approaches are effective and outperform previous state‐of‐the‐art approaches. Copyright © 2016 John Wiley & Sons, Ltd.     

基于物品的改进协同过滤算法及应用

针对电视产品信息资源量过载导致用户选择困难的问题,本文主要研究了基于物品的协同过滤算法在电视产品推荐系统中的改进及应用,将个性化推荐技术和电视产品系统有机结合来满足用户和运营商的需求.在推荐过程中,首先收集用户的偏好建立数据模型,以用户观看电视产品的时长作为用户偏好的显式特征,然后在传统的协同过滤算法中引入点播金额权重进行改进,并采用欧几里德距离法计算物品相似度,最后根据邻居集合预测目标用户对电视产品的观看时长,得到推荐结果.实验表明,通过引入点播金额权重这一改进能够提高推荐的准确性.     

Ontology-based personalized couple clustering for heterogeneous product recommendation in mobile marketing

Plethora of cellular phones has been increasingly driving the spread of e-commerce mechanisms running on mobile devices. For instance, mobile marketing fulfills the wireless delivery (to the devices of mobile users) of the recommended product information and even one-to-one recommendations. One-to-one recommendation not only reduces the time that customers have to expend to for attaining appropriate products, but also is a method to engender customer values and develop the long-term customer relationships. This paper presents a one-to-one recommendation mechanism that iteratively takes as inputs the audio customer messages (together with product information) and produces personalized product analogy structures (that subsequently drive the generation of personalized heterogeneous product recommendations) based on the coupled clustering algorithm. The personalized product analogy structures also evolve as the messages (of the correspondent customer) grow. We have implemented the mechanism with J2EE Web Service that has produced fairly promising evaluation results.     

基于社交信任和标签偏好的景点推荐方法

针对现有的景点推荐算法在处理用户关系时忽视了用户隐性信任和信任传递问题,以及当用户处于新城市时由于缺乏用户历史记录无法做出准确推荐的情况,本文提出一种综合用户信任关系和标签偏好的个性化景点推荐方法.在仅仅考虑用户相似度时推荐质量差的情况下引入信任度,通过挖掘用户隐性信任关系解决了现有研究在直接信任难以获取时无法做出推荐的情况,有效缓解了数据稀疏性和冷启动问题.同时在用户兴趣分析过程中将景点和标签的关系扩展到了用户、景点和标签三者的相互关系,把用户的兴趣偏好分解成对不同景点标签的长期偏好,有效地缓解了缺乏用户历史游览记录时推荐质量不佳的问题.通过在Flickr网站上收集的数据进行实验验证,结果表明本文提出的混合推荐算法有效地提高了推荐精度,在一定程度上缓解了冷启动和新城市问题.     

Mining Skewed and Sparse Transaction Data for Personalized Shopping Recommendation

A good shopping recommender system can boost sales in a retailer store. To provide accurate recommendation, the recommender needs to accurately predict a customer's preference, an ability difficult to acquire. Conventional data mining techniques, such as association rule mining and collaborative filtering, can generally be applied to this problem, but rarely produce satisfying results due to the skewness and sparsity of transaction data. In this paper, we report the lessons that we learned in two real-world data mining applications for personalized shopping recommendation. We learned that extending a collaborative filtering method based on ratings (e.g., GroupLens) to perform personalized shopping recommendation is not trivial and that it is not appropriate to apply association-rule based methods (e.g., the IBM SmartPad system) for large scale prediction of customers' shopping preferences. Instead, a probabilistic graphical model can be more effective in handling skewed and sparse data. By casting collaborative filtering algorithms in a probabilistic framework, we derived HyPAM (Hybrid Poisson Aspect Modelling), a novel probabilistic graphical model for personalized shopping recommendation. Experimental results show that HyPAM outperforms GroupLens and the IBM method by generating much more accurate predictions of what items a customer will actually purchase in the unseen test data. The data sets and the results are made available for download at http://chunnan.iis.sinica.edu.tw/hypam/HyPAM.html.     

A personalized recommendation procedure for Internet shopping support

The rapid growth of e-commerce has caused product overload where the customer is no longer able to effectively choose the products he/she is exposed to. To overcome the product overload of Internet shoppers, several recommender systems have been developed. Recommendation systems track past actions of a group of customers to make a recommendation to individual members of the group. We introduce a personalized recommendation procedure by which we can get further recommendation effectiveness when applied to Internet shopping malls. The suggested procedure is based on Web usage mining, product taxonomy, association rule mining, and decision tree induction. We applied the procedure to a leading Internet shopping mall in Korea for performance evaluation, and some experimental results are provided. The experimental results show that choosing the right level of product taxonomy and the right customers increases the quality of recommendations.     

A semantic-expansion approach to personalized knowledge recommendation

The rapid propagation of the Internet and information technologies has changed the nature of many industries. Fast response and personalized recommendations have become natural trends for all businesses. This is particularly important for content-related products and services, such as consulting, news, and knowledge management in an organization. The digital nature of their products allows for more customized delivery over the Internet. To provide personalized services, however, a complete understanding of user profile and accurate recommendation are essential.In this paper, an Internet recommendation system that allows customized content to be suggested based on the user's browsing profile is developed. The method adopts a semantic-expansion approach to build the user profile by analyzing documents previously read by the person. Once the customer profile is constructed, personalized contents can be provided by the system. An empirical study using master theses in the National Central library in Taiwan shows that the semantic-expansion approach outperforms the traditional keyword approach in catching user interests. The proper usage of this technology can increase customer satisfaction.     

基于用户偏好优化模型的推荐算法研究

传统的个性化推荐算法普遍存在数据稀疏性问题,影响了推荐的准确度。Slope one算法具有简单、高效等特点,但该算法只是根据用户—项目评分矩阵进行数据分析,对所有用户采用一致性的权重进行计算,忽视了用户对项目类型的喜好程度。针对上述问题进行了研究,提出LR-Slope one算法。首先根据用户—项目评分矩阵和项目类型信息构建用户对项目类型的偏好矩阵;然后利用线性回归模型计算用户对每个类型的权重,采用随机梯度下降算法优化权重;最后结合Slope one算法预测评分,填充评分矩阵,提高推荐的质量。实验结果表明,所提算法提高了推荐的精度,有效缓解了稀疏性问题。     

顾客偏好的动态挖掘算法

基于顾客偏好随时间变化的特性，采用聚类、关联规则等技术，对顾客偏好进行动态挖掘．通过追踪顾客购买序列，最终产生Top N产品推荐，旨在提高推荐系统的推荐质量．然后选取协同过滤算法作对照，并采用MovieLens站点提供的测试数据集．通过对召回率和精度两项指标的分析，表明该动态挖掘算法具有较高的推荐准确度和全面性．