使用群体兴趣偏好度的协同过滤推荐

推荐系统是电子商务系统中最重要的技术之一,用户相似性度量方法是影响推荐算法准确率高低的关键因素。针对用户评分数据极端稀疏情况下传统相似性度量方法的不足,提出了一种基于群体兴趣偏好度的协同过滤推荐算法,根据群体兴趣偏好度来预测用户对未评分项目的评分,在此基础上再采用传统的相似性度量方法计算目标用户的最近邻居。实验结果表明,该算法可以有效解决用户评分数据极端稀疏情况下传统相似性度量方法存在的问题,显著提高推荐系统的推荐质量。     

一种基于聚类和协同过滤的组合推荐算法

协同过滤技术是目前电子商务推荐系统中最为主要的技术之一,但随着系统规模的日益扩大,它面临着算法可扩展性和数据稀疏性两大挑战。针对上述问题,本文提出了一种基于聚类和协同过滤的组合推荐算法。首先利用聚类对项目进行分类,在用户感兴趣的类里进行推荐计算,有效地解决了算法的可扩展性问题;接着在每一类中使用基于项目的协同过滤对未评价的项目进行预测,把较好的预测值填充到原用户-项集合中,有效地缓解了数据稀疏性问题;最后根据协同过滤推荐在相似项目的范围内计算邻居用户,给出最终的预测评分并产生推荐。实验结果表明,本算法有效地解决了上述两个问题,提高了推荐系统的推荐质量。     

A time-based approach to effective recommender systems using implicit feedback

Recommender systems provide personalized recommendations on products or services to customers. Collaborative filtering is a widely used method of providing recommendations using explicit ratings on items from users. In some e-commerce environments, however, it is difficult to collect explicit feedback data; only implicit feedback is available.

In this paper, we present a method of building an effective collaborative filtering-based recommender system for an e-commerce environment without explicit feedback data. Our method constructs pseudo rating data from the implicit feedback data. When building the pseudo rating matrix, we incorporate temporal information such as the user’s purchase time and the item’s launch time in order to increase recommendation accuracy.

Based on this method, we built both user-based and item-based collaborative filtering-based recommender systems for character images (wallpaper) in a mobile e-commerce environment and conducted a variety of experiments. Empirical results show our time-incorporated recommender system is significantly more accurate than a pure collaborative filtering system.     

面向社会化电子商务的信任感知协同过滤推荐方法

为提高社会化电子商务推荐服务的精确度和有效性,综合考虑交易评价得分、交易次数、交易金额、直接信任、推荐信任等影响社会化电子商务用户信任关系的因素,设计了一种信任感知协同过滤推荐方法.该方法利用置信因子计算用户间的信任关系,采用余弦相关度法计算用户间的相似度,引入调和因子综合用户信任关系和用户相似度对商品预测评分的影响,以平均绝对误差(MAE)、评分覆盖率和用户覆盖率作为评价指标.实验结果表明,与标准协同过滤推荐方法、基于规范矩阵因式分解的推荐方法相比,信任感知协同过滤推荐方法将MAE降低到0.162,并将评分覆盖率和用户覆盖率分别提高到77%和80%,能够解决交易评价较少商品的推荐问题.     

自适应用户的Item-based协同过滤推荐算法

传统Item-based协同过滤算法计算两个条目间相似性时, 将每个评分视为同等重要, 忽略了共评用户（对两个条目共同评分的用户）与目标用户间的相似性对条目间相似性的影响。针对此问题, 提出了一种自适应用户的Item-based协同过滤算法。该算法将共评用户与目标用户的相似性作为共评用户评分重要性的权重, 以实现针对不同的目标用户, 为目标条目选择不同的、适合目标用户的最近邻居集, 从而提高推荐准确性。实验结果表明, 提出的算法可以显著提高推荐系统的推荐质量。     

Research on personalized recommendation hybrid algorithm for interactive experience equipment

Interactive calligraphy experience equipment has the characteristics of a large amount of data, various types, and strong homogeneity, which makes it difficult for users to find interesting resources. In this article, a hybrid personalized recommendation algorithm is proposed, which uses collaborative filtering and content-based recommendation methods in turn to make recommendations. In the initial recommendation, Latent Dirichlet Allocation (LDA) topic model is used to reduce the dimension of high-dimensional user behavior data and establish a user-writing theme matrix to reduce inaccurate recommendation caused by high sparsity data in collaborative filtering algorithm. The user interest list is obtained by calculating the similarity between users. Then, on the basis of the preliminary recommendation results, VGG16 model is used to extract the feature vector of the calligraphy image and calculate the similarity between the user's calligraphy words and the primary recommended calligraphy words, thus obtaining the final recommendation results. The experimental results verify the effectiveness and accuracy of the recommendation algorithm, which are better than other recommendation algorithms on the whole, and have important engineering guiding significance.     

Hybrid Recommender Systems: Survey and Experiments

Recommender systems represent user preferences for the purpose of suggesting items to purchase or examine. They have become fundamental applications in electronic commerce and information access, providing suggestions that effectively prune large information spaces so that users are directed toward those items that best meet their needs and preferences. A variety of techniques have been proposed for performing recommendation, including content-based, collaborative, knowledge-based and other techniques. To improve performance, these methods have sometimes been combined in hybrid recommenders. This paper surveys the landscape of actual and possible hybrid recommenders, and introduces a novel hybrid, EntreeC, a system that combines knowledge-based recommendation and collaborative filtering to recommend restaurants. Further, we show that semantic ratings obtained from the knowledge-based part of the system enhance the effectiveness of collaborative filtering.     

A hybrid recommender system using artificial neural networks

In the context of recommendation systems, metadata information from reviews written for businesses has rarely been considered in traditional systems developed using content-based and collaborative filtering approaches. Collaborative filtering and content-based filtering are popular memory-based methods for recommending new products to the users but suffer from some limitations and fail to provide effective recommendations in many situations. In this paper, we present a deep learning neural network framework that utilizes reviews in addition to content-based features to generate model based predictions for the business-user combinations. We show that a set of content and collaborative features allows for the development of a neural network model with the goal of minimizing logloss and rating misclassification error using stochastic gradient descent optimization algorithm. We empirically show that the hybrid approach is a very promising solution when compared to standalone memory-based collaborative filtering method.     

基于用户行为的个性化推荐系统的设计与应用①

目前电子商务网站提供的推荐服务很难满足用户的个性化需求,协同过滤算法作为应用最成功的推荐算法,依然存在数据稀疏性、用户评分真实性等问题,制约着推荐系统的质量。设计和实现了一个基于用户行为的个性化商品推荐系统,主要采用前融合组合推荐策略,避免了单纯使用协同过滤算法的弱点。阐述了基于用户行为的个性化推荐系统的设计思想和实现过程,最终通过实验验证了本推荐系统具有良好的推荐效果。     

基于共同评分和相似性权重的协同过滤推荐算法

协同过滤推荐算法是在电子商务推荐系统中应用最成功的推荐技术之一。提出了一种基于共同评分和相似性权重的协同过滤推荐算法。该算法选择用户的共同评分数据计算用户的相似性,选择项目被用户共同评分的数据计算项目的相似性,再分别计算基于用户以及项目算法的预测评分,然后通过相似性权重结合两者得到最终的预测结果,最后再根据预测结果产生推荐。实际数据的实验结果表明,提出的算法显著提高了预测准确度,从而提高了推荐质量。     

A hybrid approach for movie recommendation

Collaborative and content-based filtering are the major methods in recommender systems that predict new items that users would find interesting. Each method has advantages and shortcomings of its own and is best applied in specific situations. Hybrid approaches use elements of both methods to improve performance and overcome shortcomings. In this paper, we propose a hybrid approach based on content-based and collaborative filtering, implemented in MoRe, a movie recommendation system. We also provide empirical comparison of the hybrid approach to the base methods of collaborative and content-based filtering and draw useful conclusions upon their performance.     

A content-collaborative recommender that exploits WordNet-based user profiles for neighborhood formation

Collaborative and content-based filtering are the recommendation techniques most widely adopted to date. Traditional collaborative approaches compute a similarity value between the current user and each other user by taking into account their rating style, that is the set of ratings given on the same items. Based on the ratings of the most similar users, commonly referred to as neighbors, collaborative algorithms compute recommendations for the current user. The problem with this approach is that the similarity value is only computable if users have common rated items. The main contribution of this work is a possible solution to overcome this limitation. We propose a new content-collaborative hybrid recommender which computes similarities between users relying on their content-based profiles, in which user preferences are stored, instead of comparing their rating styles. In more detail, user profiles are clustered to discover current user neighbors. Content-based user profiles play a key role in the proposed hybrid recommender. Traditional keyword-based approaches to user profiling are unable to capture the semantics of user interests. A distinctive feature of our work is the integration of linguistic knowledge in the process of learning semantic user profiles representing user interests in a more effective way, compared to classical keyword-based profiles, due to a sense-based indexing. Semantic profiles are obtained by integrating machine learning algorithms for text categorization, namely a naïve Bayes approach and a relevance feedback method, with a word sense disambiguation strategy based exclusively on the lexical knowledge stored in the WordNet lexical database. Experiments carried out on a content-based extension of the EachMovie dataset show an improvement of the accuracy of sense-based profiles with respect to keyword-based ones, when coping with the task of classifying movies as interesting (or not) for the current user. An experimental session has been also performed in order to evaluate the proposed hybrid recommender system. The results highlight the improvement in the predictive accuracy of collaborative recommendations obtained by selecting like-minded users according to user profiles.     

基于用户实时反馈的协同过滤算法

传统的基于内存的协同过滤算法存在可扩展性不足的问题,而基于模型的协同过滤算法由于模型数据的滞后,造成推荐质量不高。针对以上情况,提出一种基于用户实时反馈的协同过滤算法,该算法在用户提交项目评分之后能实现对推荐模型数据的实时更新,从而更精确地反映用户的兴趣变化。实验结果表明,该算法能够有效地提高推荐精确度并且大幅地缩短了推荐时间。     

一种优化聚类的协同过滤推荐算法

针对传统的协同过滤推荐算法存在评分数据稀疏和推荐准确率偏低的问题,提出了一种优化聚类的协同过滤推荐算法。根据用户的评分差异对原始评分矩阵进行预处理,再将得到的用户项目评分矩阵以及项目类型矩阵构造用户类别偏好矩阵,更好反映用户的兴趣偏好,缓解数据的稀疏性。在该矩阵上利用花朵授粉优化的模糊聚类算法对用户聚类,增强用户的聚类效果,并将项目偏好信息的相似度与项目评分矩阵的相似度进行加权求和,得到多个最近邻居。融合时间因素对目标用户进行项目评分预测,改善用户兴趣变化对推荐效果的影响。通过在MovieLens 100k数据集上实验结果表明,提出的算法缓解了数据的稀疏性问题,提高了推荐的准确性。     

基于兴趣感知和时间因子的个性化菜品推荐 *

目前推荐系统已广泛应用在各种电子商务网站上,但针对菜品的个性化推荐很少。针对菜品推荐中存在别名多、用户菜品矩阵稀疏以及新用户冷启动等难题,对基于用户的协同过滤算法进行改进,设计一种融合专家选择和在线推荐的菜品推荐系统。专家选择通过对菜品进行种类层次划分为用户兴趣建模做准备,在线推荐通过兴趣感知选择算法选择餐厅中的专家用户和候选菜品,从而实现对用户菜品的推荐。最后通过在候选菜品选择时引入时间敏感因子和协同过滤中引入时间遗忘因子,改进兴趣感知算法和菜品偏好预测效果。实验结果表明,所设计算法较传统算法在准确性和推荐效率有明显改进,并得出了针对菜品推荐时引入时间因子有利提高推荐准确性的结论。     

基于内容预测和项目评分的协同过滤推荐

文中提出了一种基于内容预测和项目评分的协同过滤推荐算法，根据基于内容的推荐计算出用户对未评分项目的评分，在此基础上采用一种基于项目的协同过滤推荐算法计算项目的相似性，随后作出预测。实验结果表明，该算法可以有效解决用户评分数据极端稀疏的情况，同时运用基于项目的相似性度量方法改善了推荐的精确性，显著提高推荐系统的推荐质量。     

改进相似度的分布式个性化推荐

相似度计算在个性化推荐系统中是基本运算,但无论是基于内容还是基于协同过滤的推荐,目前常用的向量相似度计算还存在可以改进之处。在海量公开的数据集上的实验表明,在基于内容的推荐中引入机器学习方法以及在协同过滤推荐中引入区分度来改善相似度计算,可以获取更高的准确率。对MapReduce的分布式计算流程的改进,使得相似度计算更为高效。     

一种基于改进的巴氏系数的协同过滤推荐算法

传统基于邻居的协同过滤推荐方法必须完全依赖用户共同评分项,且存在极为稀疏的数据集中预测准确性不高的问题。巴氏系数协同过滤算法通过利用一对用户的所有评分项进行相似性度量,可以有效改善上述问题。但该种方法也存在两个很明显的缺陷,即未考虑两个用户评分项个数不同时的情况以及没有针对性地考虑用户偏好。在巴氏系数协同过滤算法的基础上进行了改进,既能充分利用用户的所有评分信息,又考虑到用户对项目的积极评分偏好。实验结果表明,改进的巴氏系数协同过滤算法在数据集上获得了更好的推荐结果,提高了推荐的准确度。     

Music recommendation hybrid system for improving recognition ability using collaborative filtering and impression words

Music therapy for improving recognition ability may be more effective when the favorite music of each person is adopted. In the proposed system, first, the recommendation process using collaborative filtering is terminated when no users in the reference list have the same preference of recommended music as that of a new user. Then, the second recommendation process finds the most similar music, from the scores for impression words, to those successfully recommended among music not recommended up to the moment. The average number of recommended songs for each user by the proposed system was 12.1, whereas that of collaborative filtering was 4.3. The recommendation accuracy of the proposed system was 70.2 %, whereas that of collaborative filtering was 62.1 %. The ratings of songs can be added on a user-by-user basis in the recommendation process, and this increased number of cases improves the recommendation accuracy and increases the number of recommended songs.     

基于项目评分预测的协同过滤推荐算法

推荐系统是电子商务系统中最重要的技术之一.随着电子商务系统用户数目和商品数目的日益增加,在整个商品空间上用户评分数据极端稀疏,传统的相似性度量方法均存在各自的弊端,导致推荐系统的推荐质量急剧下降.针对用户评分数据极端稀疏情况下传统相似性度量方法的不足,提出了一种基于项目评分预测的协同过滤推荐算法,根据项目之间的相似性初步预测用户对未评分项目的评分,在此基础上,采用一种新颖的相似性度量方法计算目标用户的最近邻居.实验结果表明,该算法可以有效地解决用户评分数据极端稀疏情况下传统相似性度量方法存在的问题,显著地提高推荐系统的推荐质量.