Research on entropy-based collaborative filtering algorithm and personalized recommendation in e-commerce

Based on the introduction to the user-based and item-based collaborative filtering algorithms, the problems related to the two algorithms are analyzed, and a new entropy-based recommendation algorithm is proposed. Aiming at the drawbacks of traditional similarity measurement methods, we put forward an improved similarity measurement method. The entropy-based collaborative filtering algorithm contributes to solving the cold-start problem and discovering users’ hidden interests. Using the data selected from Movielens and Book-Crossing datasets and MAE accuracy metric, three different collaborative filtering recommendation algorithms are compared through experiments. The experimental scheme and results are discussed in detail. The results show that the entropy-based algorithm provides better recommendation quality than user-based algorithm and achieves recommendation accuracy comparable to the item-based algorithm. At last, a solution to B2B e-commerce recommendation applications based on Web services technology is proposed, which adopts entropy-based collaborative filtering recommendation algorithm.     

协同过滤的一种个性化推荐算法研究

在分析传统推荐算法不足的基础上,提出一种稀疏矩阵下的个性化改进策略.首先进行一对一的个性化预测,得到虚拟用户评分矩阵,在此基础上再进行综合预测.该方法避免了传统推荐算法中推荐值与用户相似度不密切相关的弊端,提高了协同过滤的预测精度,尤其是在矩阵极端稀疏情况下的预测精度.最后通过实验验证了算法的有效性和优越性.     

电子商务协作过滤推荐技术的算法研究与改进

推荐算法的好坏直接影响推荐系统的效率.本文提出了一种改进的基于K-中心点算法的合作聚类推荐算法,该算法有效减少了数值矩阵的行数,大大缩短了搜寻近邻客户的时间,从而提高了算法的执行效率和准确性.     

Multi-criteria matrix localization and integration for personalized collaborative filtering in IoT environments

Multimedia Tools and Applications - Collaborative filtering (CF)-based recommender systems can be used to deal with the complexity problem of users when they want to identify possible tasks on the...     

A multi-level collaborative filtering method that improves recommendations

Collaborative filtering is one of the most used approaches for providing recommendations in various online environments. Even though collaborative recommendation methods have been widely utilized due to their simplicity and ease of use, accuracy is still an issue. In this paper we propose a multi-level recommendation method with its main purpose being to assist users in decision making by providing recommendations of better quality. The proposed method can be applied in different online domains that use collaborative recommender systems, thus improving the overall user experience. The efficiency of the proposed method is shown by providing an extensive experimental evaluation using five real datasets and with comparisons to alternatives.     

Amazon.com recommendations: item-to-item collaborative filtering

Recommendation algorithms are best known for their use on e-commerce Web sites, where they use input about a customer's interests to generate a list of recommended items. Many applications use only the items that customers purchase and explicitly rate to represent their interests, but they can also use other attributes, including items viewed, demographic data, subject interests, and favorite artists. At Amazon.com, we use recommendation algorithms to personalize the online store for each customer. The store radically changes based on customer interests, showing programming titles to a software engineer and baby toys to a new mother. There are three common approaches to solving the recommendation problem: traditional collaborative filtering, cluster models, and search-based methods. Here, we compare these methods with our algorithm, which we call item-to-item collaborative filtering. Unlike traditional collaborative filtering, our algorithm's online computation scales independently of the number of customers and number of items in the product catalog. Our algorithm produces recommendations in real-time, scales to massive data sets, and generates high quality recommendations.     

Enhancing collaborative filtering by user interest expansion via personalized ranking

Recommender systems suggest a few items from many possible choices to the users by understanding their past behaviors. In these systems, the user behaviors are influenced by the hidden interests of the users. Learning to leverage the information about user interests is often critical for making better recommendations. However, existing collaborative-filtering-based recommender systems are usually focused on exploiting the information about the user's interaction with the systems; the information about latent user interests is largely underexplored. To that end, inspired by the topic models, in this paper, we propose a novel collaborative-filtering-based recommender system by user interest expansion via personalized ranking, named iExpand. The goal is to build an item-oriented model-based collaborative-filtering framework. The iExpand method introduces a three-layer, user-interests-item, representation scheme, which leads to more accurate ranking recommendation results with less computation cost and helps the understanding of the interactions among users, items, and user interests. Moreover, iExpand strategically deals with many issues that exist in traditional collaborative-filtering approaches, such as the overspecialization problem and the cold-start problem. Finally, we evaluate iExpand on three benchmark data sets, and experimental results show that iExpand can lead to better ranking performance than state-of-the-art methods with a significant margin.     

基于三维协同过滤的C2C电子商务推荐系统

个人对个人电子商务(customer to customer,C2C)是目前主流的电子商务模式之一,为解决C2C电子商务网站中特殊的推荐问题,对传统的二维协同过滤方法进行了扩展,提出了能进行卖家和商品组合推荐的三维协同过滤推荐方法,并在此基础上设计了C2C电子商务推荐系统,阐述了该系统的基本架构和推荐过程中的关键运算.该系统利用卖家属性计算卖家相似度,并依据销售关系和卖家相似度对评分数据集进行填充,以解决三维评分数据的稀疏问题;采用协同过滤思想,利用历史评分计算买家相似度,获取最近邻并预测未知评分,最终将预测评分最高的卖家和商品组合推荐给目标买家.实验结果表明,该系统具有较好的推荐效果.     

ICFR: An effective incremental collaborative filtering based recommendation architecture for personalized websites

World Wide Web - To solve the problem that users’ retrieval intentions are seldom considered by personalized websites, we propose an improved incremental collaborative filtering (CF)-based...     

From similarity perspective: a robust collaborative filtering approach for service recommendations

Collaborative filtering (CF) is a technique commonly used for personalized recommendation and Web service quality-of-service (QoS) prediction. However, CF is vulnerable to shilling attackers who inject fake user profiles into the system. In this paper, we first present the shilling attack problem on CF-based QoS recommender systems for Web services. Then, a robust CF recommendation approach is proposed from a user similarity perspective to enhance the resistance of the recommender systems to the shilling attack. In the approach, the generally used similarity measures are analyzed, and the DegSim (the degree of similarities with top k neighbors) with those measures is selected for grouping and weighting the users. Then, the weights are used to calculate the service similarities/differences and predictions.We analyzed and evaluated our algorithms using WS-DREAM and Movielens datasets. The experimental results demonstrate that shilling attacks influence the prediction of QoS values, and our proposed features and algorithms achieve a higher degree of robustness against shilling attacks than the typical CF algorithms.     

基于协同过滤的移动电子商务个性化推荐系统若干研究

在简要介绍移动电子商务个性化推荐系统概念的基础上,给出了移动电子商务推荐系统EMC-PRS的模块结构。重点分析比较了基于最近邻居的协同过滤算法和基于项目评分预测的协同过滤算法。经测试发现,基于项目评分预测的协同过滤推荐算法可以显著提高个性化推荐系统的推荐质量。     

基于协作过滤算法的电子商务个性化推荐系统的研究

针对目前电子商务个性化推荐研究的不足,提出准确全面地获取用户独特兴趣爱好、满足用户差异化需求的推荐服务,同时构建了具体的个性化推荐系统模型,给出了基于协作过滤算法的电子商务个性化推荐的流程、系统设计和系统实现,从而有利于推动电子商务的发展。     

An architecture for making recommendations to courseware authors using association rule mining and collaborative filtering

Nowadays we find more and more applications for data mining techniques in e-learning and web-based adaptive educational systems. The useful information discovered can be used directly by the teacher or author of the course in order to improve instructional/learning performance. This can, however, imply a lot of work for the teacher who can greatly benefit from the help of educational recommender systems for doing this task. In this paper we propose a system oriented to find, share and suggest the most appropriate modifications to improve the effectiveness of the course. We describe an iterative methodology to develop and carry out the maintenance of web-based courses to which we have added a specific data mining step. We apply association rule mining to discover interesting information through students’ usage data in the form of IF-THEN recommendation rules. We have also used a collaborative recommender system to share and score the recommendation rules obtained by teachers with similar profiles along with other experts in education. Finally, we have carried out experiments with several real groups of students using a web-based adaptive course. The results obtained demonstrate that the proposed architecture constitutes a good starting point to future investigations in order to generalize the results over many course contents.     

Generalized framework for personalized recommendations in agent networks

An agent network can be modeled as a directed weighted graph whose vertices represent agents and edges represent a trust relationship between the agents. This article proposes a new recommendation approach, dubbed LocPat, which can recommend trustworthy agents to a requester in an agent network. We relate the recommendation problem to the graph similarity problem, and define the similarity measurement as a mutually reinforcing relation. We understand an agent as querying an agent network to which it belongs to generate personalized recommendations. We formulate a query into an agent network as a structure graph applied in a personalized manner that reflects the pattern of relationships centered on the requesting agent. We use this pattern as a basis for recommending an agent or object (a vertex in the graph). By calculating the vertex similarity between the agent network and a structure graph, we can produce a recommendation based on similarity scores that reflect both the link structure and the trust values on the edges. Our resulting approach is generic in that it can capture existing network-based approaches merely through the introduction of appropriate structure graphs. We evaluate different structure graphs with respect to two main kinds of settings, namely, social networks and ratings networks. Our experimental results show that our approach provides personalized and flexible recommendations effectively and efficiently based on local information.     

Incentivized provision of metadata, semantic reasoning and time-driven filtering: Making a puzzle of personalized e-commerce

e-Commerce recommender systems select potentially interesting products for users by looking at their purchase histories and preferences. In order to compare the available products against those included in the user’s profile, semantics-based recommendation strategies consider metadata annotations that describe their main attributes. Besides, to ensure successful suggestions of products, these strategies adapt the recommendations as the user’s preferences evolve over time. Traditional approaches face two limitations related to the aforementioned features. First, product providers are not typically willing to take on the tedious task of annotating accurately a huge diversity of commercial items, thus leading to a substantial impoverishment of the personalization quality. Second, the adaptation process of the recommendations misses the time elapsed since the user has bought an item, which is an essential parameter that affects differently to each purchased product. This results in some pointless recommendations, e.g. including regularly items that the users are only willing to buy sporadically. In order to fight both limitations, we propose a personalized e-commerce system with two main features. On the one hand, we incentivize the users to provide high-quality metadata for commercial products; on the other, we explore a strategy that offers time-aware recommendations by combining semantic reasoning about these annotations with item-specific time functions. The synergetic effects derived from this combination lead to suggestions adapted to the particular needs of the users at any time. This approach has been experimentally validated with a set of users who accessed our personalized e-commerce system through a range of fixed and handheld consumer devices.     

Exploring social tagging for personalized community recommendations

Users of social Web sites actively create and join communities as a way to collectively share their media content and rich experience with diverse groups of people. In this study we focus on the issue of recommending social communities (or groups) to individual users. We address specifically the potential of social tagging for accentuating users’ interests and characterizing communities. We also discuss some unique methods of improving several techniques that have been adapted for use in the context of community recommendations: collaborative filtering, a random walk model, a Katz influence model, a latent semantic model, and a user-centric tag model. We effectively incorporate social tagging information in each algorithm. We present empirical evaluations using real datasets from CiteULike and Last.fm. Our experimental results demonstrate that the different algorithms incorporated with social tagging offer significant advantages in improving both the recommendation quality and coverage, and demonstrate their feasibility for community recommendations in dealing with sparsity-related limitations.     

Price-aware matrix factorization model for personalized recommendations

Recommendation methods aim to assist consumers in their decision-making process to find products that they are quite likely interested in. Current recommendation methods generally use online consumer reviews or ratings to predict consumers’ preferences for products. In e-commerce transactions, price plays a significant role in consumers’ purchase decisions. And each consumer's preference for product prices is specific. In this paper, we propose a novel price-aware recommendation method based on the matrix factorization model which fully considers the effect of price. We distill the price preferences of consumers from ratings and discover consumers’ real preferences for products. We further calculate the price sensitivities of consumers, not only considering the difference in price preference between a consumer and others but also focusing on the consumers’ price preferences in a specific price range. The final predicted ratings are calculated by adding the term of price effect into the matrix factorization framework. The results show that the proposed method has achieved high accuracy and performed better than several existing methods in both rating prediction and Top-N recommendation. And the products we recommend for consumers are more in line with their price preferences. Moreover, we find that, to some extent, the proposed method can solve the long-tail product recommendation problem with the consideration of the price effect.     

Evolving information filtering for personalized information service

Information filtering(IF) systems are important for personalized information service.Howerver,most current IF systems suffer from low quality and long training time,In this paper,a refined evolving information filtering method is presented.This method describes user‘s information need from multi-aspects and improves filtering quality through a process like natural seslction.Experimental result shows this method can shorten training time,improve filtering quality,and reduce the relevance between filtering results and training sequence.     

Userrank for item-based collaborative filtering recommendation

With the recent explosive growth of the Web, recommendation systems have been widely accepted by users. Item-based Collaborative Filtering (CF) is one of the most popular approaches for determining recommendations. A common problem of current item-based CF approaches is that all users have the same weight when computing the item relationships. To improve the quality of recommendations, we incorporate the weight of a user, userrank, into the computation of item similarities and differentials. In this paper, a data model for userrank calculations, a PageRank-based user ranking approach, and a userrank-based item similarities/differentials computing approach are proposed. Finally, the userrank-based approaches improve the recommendation results of the typical Adjusted Cosine and Slope One item-based CF approaches.