Personalized Recommendation Algorithm Based on Product Reviews

2018 ◽  
Vol 16 (3) ◽  
pp. 22-38
Author(s):  
Zhibo Wang ◽  
Mengyuan Wan ◽  
Xiaohui Cui ◽  
Lin Liu ◽  
Zixin Liu ◽  
...  
Keyword(s):  
Recommendation System ◽  
Information Overload ◽  
Recall Rate ◽  
Personalized Recommendation ◽  
The Internet ◽  
Product Reviews ◽  
Recommendation Algorithm ◽  
Preference Model ◽  
Product Features ◽  
Huge Data

Under the background of leap-forward development for the internet, e-commerce has played an important role in people's daily life, but huge data sizes have also brought problems, such as information overload which can be solved by using a recommendation system effectively. However, with the development of the e-commerce, the amount of the product catalogs and users becomes larger, which causes lower performance of the traditional recommendation system. This article comes up with a personalized recommendation algorithm based on the data mining of product reviews to optimize the performance of the new recommendation system. Features of the product were extracted, for which the users' sentiment polarity was analyzed. This article develops a recommendation system based on the user's preference model and the product features to get the recommendation result. Experimental results show that a personalized recommendation has significantly improved the accuracy and recall rate when compared with a traditional recommendation algorithm.

A Collaborative Filtering Recommendation Algorithm Based on Product Clustering

2012 ◽  
Vol 267 ◽  
pp. 87-90
Author(s):  
Pu Wang
Keyword(s):  
Electronic Commerce ◽  
Collaborative Filtering ◽  
Recommender Systems ◽  
Recommendation System ◽  
Information Overload ◽  
Personalized Recommendation ◽  
The Internet ◽  
Recommendation Algorithm ◽  
The Core ◽  
Intelligent Technology

E-commerce recommendation system is one of the most important and the most successful application field of information intelligent technology. Recommender systems help to overcome the problem of information overload on the Internet by providing personalized recommendations to the customers. Recommendation algorithm is the core of the recommendation system. Collaborative filtering recommendation algorithm is the personalized recommendation algorithm that is used widely in e-commerce recommendation system. Collaborative filtering has been a comprehensive approach in recommendation system. But data are always sparse. This becomes the bottleneck of collaborative filtering. Collaborative filtering is regarded as one of the most successful recommender systems within the last decade, which predicts unknown ratings by analyzing the known ratings. In this paper, an electronic commerce collaborative filtering recommendation algorithm based on product clustering is given. In this approach, the clustering of product is used to search the recommendation neighbors in the clustering centers.

Research on Location-Based Personalized Recommendation System

2014 ◽  
Vol 490-491 ◽  
pp. 1493-1496
Author(s):  
Huan Gao ◽  
Xi Tian ◽  
Xiang Ling Fu
Keyword(s):  
Collaborative Filtering ◽  
Real Time ◽  
Recommendation System ◽  
Information Overload ◽  
Information Filtering ◽  
Mobile Internet ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
New System

With the mobile Internet developing in China, the problem of information overload has been brought to us. The traditional personalized recommendation cannot meet the needs of the mobile Internet. In this paper, the recommendation algorithm is mainly based on the collaborative filtering, but the new factors are introduced into the recommendation system. The new system takes the user's location and friends recommendation into the personalized recommendation system so that the recommendation system can meet the mobile Internet requirements. Besides, this paper also puts forward the concept of moving business circle for information filtering, which realizes the precise and real-time personalized recommendations. This paper also proves the recommendation effects through collecting and analyzing the data, which comes from the website of dianping.com.

scholarly journals Personalized Recommendation Model of High-Quality Education Resources for College Students Based on Data Mining

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Chaohua Fang ◽  
Qiuyun Lu
Keyword(s):  
Learning Process ◽  
Data Science ◽  
Recommendation System ◽  
Information Overload ◽  
Rapid Development ◽  
Learning Ability ◽  
Personalized Recommendation ◽  
Learning Resources ◽  
Learner Model ◽  
Internet Education

With the rapid development of information technology and data science, as well as the innovative concept of “Internet+” education, personalized e-learning has received widespread attention in school education and family education. The development of education informatization has led to a rapid increase in the number of online learning users and an explosion in the number of learning resources, which makes learners face the dilemma of “information overload” and “learning lost” in the learning process. In the personalized learning resource recommendation system, the most critical thing is the construction of the learner model. Currently, most learner models generally have a lack of scientific focus that they have a single method of obtaining dimensions, feature attributes, and low computational complexity. These problems may lead to disagreement between the learner’s learning ability and the difficulty of the recommended learning resources and may lead to the cognitive overload or disorientation of learners in the learning process. The purpose of this paper is to construct a learner model to support the above problems and to strongly support individual learning resources recommendation by learning the resource model which effectively reduces the problem of cold start and sparsity in the recommended process. In this paper, we analyze the behavioral data of learners in the learning process and extract three features of learner’s cognitive ability, knowledge level, and preference for learning of learner model analysis. Among them, the preference model of the learner is constructed using the ontology, and the semantic relation between the knowledge is better understood, and the interest of the student learning is discovered.

scholarly journals College Library Personalized Recommendation System Based on Hybrid Recommendation Algorithm

Procedia CIRP ◽  
2019 ◽  
Vol 83 ◽  
pp. 490-494 ◽  
Author(s):  
Yonghong Tian ◽  
Bing Zheng ◽  
Yanfang Wang ◽  
Yue Zhang ◽  
Qi Wu
Keyword(s):  
Recommendation System ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
College Library ◽  
Hybrid Recommendation

scholarly journals SVD++ Recommendation Algorithm Based on Backtracking

Information ◽  
2020 ◽  
Vol 11 (7) ◽  
pp. 369
Author(s):  
Shijie Wang ◽  
Guiling Sun ◽  
Yangyang Li
Keyword(s):  
Line Search ◽  
Optimal Solution ◽  
Recall Rate ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
Backtracking Line Search ◽  
Low Efficiency ◽  
Public Datasets ◽  
Value Decomposition ◽  
Local Gradient

Collaborative filtering (CF) has successfully achieved application in personalized recommendation systems. The singular value decomposition (SVD)++ algorithm is employed as an optimized SVD algorithm to enhance the accuracy of prediction by generating implicit feedback. However, the SVD++ algorithm is limited primarily by its low efficiency of calculation in the recommendation. To address this limitation of the algorithm, this study proposes a novel method to accelerate the computation of the SVD++ algorithm, which can help achieve more accurate recommendation results. The core of the proposed method is to conduct a backtracking line search in the SVD++ algorithm, optimize the recommendation algorithm, and find the optimal solution via the backtracking line search on the local gradient of the objective function. The algorithm is compared with the conventional CF algorithm in the FilmTrust, MovieLens 1 M and 10 M public datasets. The effectiveness of the proposed method is demonstrated by comparing the root mean square error, absolute mean error and recall rate simulation results.

Research on Intelligent Recommendation Method and its Application on Internet Bookstore

2010 ◽  
Vol 121-122 ◽  
pp. 447-452
Author(s):  
Qing Zhang Chen ◽  
Yu Jie Pei ◽  
Yan Jin ◽  
Li Yan Zhang
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Recommendation System ◽  
Recommendation Systems ◽  
Experimental Results ◽  
Personalized Recommendation ◽  
The Internet

As the current personalized recommendation systems of Internet bookstore are limited too much in function, this paper build a kind of Internet bookstore recommendation system based on “Strategic Data Mining”, which can provide personalized recommendations that they really want. It helps us to get the weight attribute of type of book by using AHP, the weight attributes spoken on behalf of its owner, and we add it in association rules. Then the method clusters the customer and type of book, and gives some strategies of personalized recommendation. Internet bookstore recommendation system is implemented with ASP.NET in this article. The experimental results indicate that the Internet bookstore recommendation system is feasible.

scholarly journals A Triangular Personalized Recommendation Algorithm for Improving Diversity

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Biao Cai ◽  
Xiaowang Yang ◽  
Yusheng Huang ◽  
Hongjun Li ◽  
Qiang Sang
Keyword(s):  
Collaborative Filtering ◽  
Information Overload ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
Filtering Method ◽  
Online Databases ◽  
Recommendation Algorithms ◽  
Recommendation Accuracy ◽  
Third Dimension ◽  
Triangular Area

Recommendation systems are used when searching online databases. As such they are very important tools because they provide users with predictions of the outcomes of different potential choices and help users to avoid information overload. They can be used on e-commerce websites and have attracted considerable attention in the scientific community. To date, many personalized recommendation algorithms have aimed to improve recommendation accuracy from the perspective of vertex similarities, such as collaborative filtering and mass diffusion. However, diversity is also an important evaluation index in the recommendation algorithm. In order to study both the accuracy and diversity of a recommendation algorithm at the same time, this study introduced a “third dimension” to the commonly used user/product two-dimensional recommendation, and a recommendation algorithm is proposed that is based on a triangular area (TR algorithm). The proposed algorithm combines the Markov chain and collaborative filtering method to make recommendations for users by building a triangle model, making use of the triangulated area. Additionally, recommendation algorithms based on a triangulated area are parameter-free and are more suitable for applications in real environments. Furthermore, the experimental results showed that the TR algorithm had better performance on diversity and novelty for real datasets of MovieLens-100K and MovieLens-1M than did the other benchmark methods.

scholarly journals A Personalized Recommendation Algorithm Based on the User’s Implicit Feedback in E-Commerce

2018 ◽  
Vol 10 (12) ◽  
pp. 117 ◽  
Author(s):  
Bo Wang ◽  
Feiyue Ye ◽  
Jialu Xu
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Word Embedding ◽  
Purchase Behavior ◽  
Personalized Recommendation ◽  
Implicit Feedback ◽  
Recommendation Algorithm ◽  
Rating Data ◽  
Feedback Information ◽  
Recommendation Accuracy

A recommendation system can recommend items of interest to users. However, due to the scarcity of user rating data and the similarity of single ratings, the accuracy of traditional collaborative filtering algorithms (CF) is limited. Compared with user rating data, the user’s behavior log is easier to obtain and contains a large amount of implicit feedback information, such as the purchase behavior, comparison behavior, and sequences of items (item-sequences). In this paper, we proposed a personalized recommendation algorithm based on a user’s implicit feedback (BUIF). BUIF considers not only the user’s purchase behavior but also the user’s comparison behavior and item-sequences. We extracted the purchase behavior, comparison behavior, and item-sequences from the user’s behavior log; calculated the user’s similarity by purchase behavior and comparison behavior; and extended word-embedding to item-embedding to obtain the item’s similarity. Based on the above method, we built a secondary reordering model to generate the recommendation results for users. The results of the experiment on the JData dataset show that our algorithm shows better improvement in regard to recommendation accuracy over other CF algorithms.

scholarly journals A Collaborative Filtering Recommendation Algorithm Based on User Confidence and Time Context

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Guangxia Xu ◽  
Zhijing Tang ◽  
Chuang Ma ◽  
Yanbing Liu ◽  
Mahmoud Daneshmand
Keyword(s):  
Collaborative Filtering ◽  
Traditional Method ◽  
Recommendation System ◽  
Rapid Development ◽  
Poor Performance ◽  
Mobile Internet ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
Rating Data ◽  
Similarity Calculation

Complex and diverse information is flooding entire networks because of the rapid development of mobile Internet and information technology. Under this condition, it is difficult for a person to locate and access useful information for making decisions. Therefore, the personalized recommendation system which utilizes the user’s behaviour information to recommend interesting items emerged. Currently, collaborative filtering has been successfully utilized in personalized recommendation systems. However, under the condition of extremely sparse rating data, the traditional method of similarity between users is relatively simple. Moreover, it does not consider that the user’s interest will change over time, which results in poor performance. In this paper, a new similarity measure method which considers user confidence and time context is proposed to preferably improve the similarity calculation between users. Finally, the experimental results demonstrate that the proposed algorithm is suitable for the sparse data and effectively improves the prediction accuracy and enhances the recommendation quality at the same time.

The Design and Implementation of E-Commerce Personalized Services Based on Collaborative Filtering Recommendation System

2014 ◽  
Vol 687-691 ◽  
pp. 2039-2042 ◽  
Author(s):  
Meng Han
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Reference Value ◽  
Personalized Recommendation ◽  
Site Management ◽  
Logical Model ◽  
Recommendation Algorithm ◽  
Design And Implementation ◽  
Personalized Services

In this paper, in accordance with the need of e-commerce site management, constructing the logical model of the personalized recommendation system, and use filtering recommendation algorithm to design the personalized recommendation engine. It is necessary to provide certain reference value to improve the personalized recommendation efficiency of e-commerce sites.

Sign in / Sign up

Export Citation Format

Share Document