Two Phase Recommendation Algorithm Based on Clustering User Interest and Trust

2014 ◽  
Vol 543-547 ◽  
pp. 1856-1859
Author(s):  
Xiang Cui ◽  
Gui Sheng Yin
Keyword(s):  
Social Networks ◽  
Electronic Commerce ◽  
Recommender Systems ◽  
Information Overload ◽  
User Interest ◽  
Recommendation Algorithm ◽  
Two Phase ◽  
Rating Data ◽  
User Interests ◽  
The Future

Recommender systems have been proven to be valuable means for Web online users to cope with the information overload and have become one of the most powerful and popular tools in electronic commerce. We need a method to solve such as what items to buy, what music to listen, or what news to read. The diversification of user interests and untruthfulness of rating data are the important problems of recommendation. In this article, we propose to use two phase recommendation based on user interest and trust ratings that have been given by actors to items. In the paper, we deal with the uncertain user interests by clustering firstly. In the algorithm, we compute the between-class entropy of any two clusters and get the stable classes. Secondly, we construct trust based social networks, and work out the trust scoring, in the class. At last, we provide some evaluation of the algorithms and propose the more improve ideas in the future.

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.

Marketing based on user behavior on Facebook social network through recommender system design

2015 ◽  
Vol 3 ◽  
pp. 27 ◽  
Author(s):  
Bahareh Shadi Shams Zamenjani
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Recommender Systems ◽  
Recommender System ◽  
User Behavior ◽  
Real Data ◽  
User Interests ◽  
Second Stage ◽  
Commercial Use ◽  
High Level

t— the influence of social networks among people and at the same time inevitable spread of commercial use of them. Accordingly, in order to sell products, recommender systems designed based on user behavior on social networks, providing a variety of commercial offers tailored to the user. The accuracy of recommender systems that make recommendations to users, and how many of the proposals are accepted by the users is important. In this paper, a recommender system is designed based on user behavior in social network Facebook in two acts and suggests that users purchase their favorite products. The first step is to examine user behavior based on user interests will be given an offer to buy products. In the second stage recommender system uses data mining techniques and suggestions to the user that is associated with their previous purchases. This is real data and the real results of it and it is valid, as well as the results show a high level of accuracy recommender system is designed to offer suggestions to users.

scholarly journals Matrix Factorization Recommendation Algorithm Based on Multiple Social Relationships

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Sheng Bin ◽  
Gengxin Sun
Keyword(s):  
Social Networks ◽  
Recommender Systems ◽  
Social Relationships ◽  
Matrix Factorization ◽  
Social Relationship ◽  
Recommendation System ◽  
Social Recommendation ◽  
Recommendation Algorithm ◽  
Recommendation Algorithms

With the widespread use of social networks, social recommendation algorithms that add social relationships between users to recommender systems have been widely applied. Existing social recommendation algorithms only introduced one type of social relationship to the recommendation system, but in reality, there are often multiple social relationships among users. In this paper, a new matrix factorization recommendation algorithm combined with multiple social relationships is proposed. Through experiment results analysis on the Epinions dataset, the proposed matrix factorization recommendation algorithm has a significant improvement over the traditional and matrix factorization recommendation algorithms that integrate a single social relationship.

scholarly journals Fusion of Internal Similarity to Improve the Accuracy of Recommendation Algorithm

2022 ◽  
Vol 24 (1) ◽  
pp. 139-140
Author(s):  
Dr.S. Dhanabal ◽  
◽  
Dr.K. Baskar ◽  
R. Premkumar ◽  
◽  
...  
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Information Overload ◽  
Real Life ◽  
Similarity Matrix ◽  
Recommendation Algorithm ◽  
Simulation Experiments ◽  
Average Similarity ◽  
Recommendation Accuracy ◽  
Item Item

Collaborative filtering algorithms (CF) and mass diffusion (MD) algorithms have been successfully applied to recommender systems for years and can solve the problem of information overload. However, both algorithms suffer from data sparsity, and both tend to recommend popular products, which have poor diversity and are not suitable for real life. In this paper, we propose a user internal similarity-based recommendation algorithm (UISRC). UISRC first calculates the item-item similarity matrix and calculates the average similarity between items purchased by each user as the user’s internal similarity. The internal similarity of users is combined to modify the recommendation score to make score predictions and suggestions. Simulation experiments on RYM and Last.FM datasets, the results show that UISRC can obtain better recommendation accuracy and a variety of recommendations than traditional CF and MD algorithms.

Combining Trust Propagation and Topic-Level User Interest Expansion in Recommender Systems

2016 ◽  
Vol 13 (2) ◽  
pp. 1-19
Author(s):  
Zukun Yu ◽  
William Wei Song ◽  
Xiaolin Zheng ◽  
Deren Chen
Keyword(s):  
Recommender Systems ◽  
Information Overload ◽  
User Interest ◽  
Trust Propagation ◽  
Rating Information

With the development of E-commerce and Internet, items are becoming more and more, which brings a so called information overload problem that it is hard for users to find the items they would be interested in. Recommender systems emerge to response to this problem through discovering user interest based on their rating information automatically. But the rating information is usually sparse compared to all the possible ratings between users and items. Therefore, it is hard to find out user interest, which is the most important part in recommender systems. In this paper, we propose a recommendation method TT-Rec that employs trust propagation and topic-level user interest expansion to predict user interest. TT-Rec uses a reputation-based method to weight users' influence on other users when propagating trust. TT-Rec also considers discovering user interest by expanding user interest in topic level. In the evaluation, we use three metrics MAE, Coverage and F1 to evaluate TT-Rec through comparative experiments. The experiment results show that TT-Rec recommendation method has a good performance.

scholarly journals Mobile recommender systems: Identifying the major concepts

2018 ◽  
Vol 45 (3) ◽  
pp. 387-397 ◽  
Author(s):  
Elias Pimenidis ◽  
Nikolaos Polatidis ◽  
Haralambos Mouratidis
Keyword(s):  
Social Networks ◽  
Recommender Systems ◽  
Mobile Devices ◽  
User Experience ◽  
Rapid Growth ◽  
Information Overload ◽  
The Internet ◽  
Mobile Environments ◽  
Future Directions ◽  
New Algorithms

This article identifies the factors that have an impact on mobile recommender systems. Recommender systems have become a technology that has been widely used by various online applications in situations where there is an information overload problem. Numerous applications such as e-Commerce, video platforms and social networks provide personalised recommendations to their users and this has improved the user experience and vendor revenues. The development of recommender systems has been focused mostly on the proposal of new algorithms that provide more accurate recommendations. However, the use of mobile devices and the rapid growth of the Internet and networking infrastructure have brought the necessity of using mobile recommender systems. The links between web and mobile recommender systems are described along with how the recommendations in mobile environments can be improved. This work is focused on identifying the links between web and mobile recommender systems and to provide solid future directions that aim to lead in a more integrated mobile recommendation domain.

scholarly journals An Effective e-Commerce Recommender System Based on Trust and Semantic Information

2021 ◽  
Vol 21 (1) ◽  
pp. 103-118
Author(s):  
Qusai Y. Shambour ◽  
Nidal M. Turab ◽  
Omar Y. Adwan
Keyword(s):  
Electronic Commerce ◽  
Recommender Systems ◽  
Recommender System ◽  
Semantic Information ◽  
Significant Rise ◽  
Experimental Results ◽  
Semantic Relations ◽  
The Internet ◽  
Rating Data ◽  
Recommendation Accuracy

Abstract Electronic commerce has been growing gradually over the last decade as a new driver of the retail industry. In fact, the growth of e-Commerce has caused a significant rise in the number of choices of products and services offered on the Internet. This is where recommender systems come into play by providing meaningful recommendations to consumers based on their needs and interests effectively. However, recommender systems are still vulnerable to the scenarios of sparse rating data and cold start users and items. To develop an effective e-Commerce recommender system that addresses these limitations, we propose a Trust-Semantic enhanced Multi-Criteria CF (TSeMCCF) approach that exploits the trust relations and multi-criteria ratings of users, and the semantic relations of items within the CF framework to achieve effective results when sufficient rating data are not available. The experimental results have shown that the proposed approach outperforms other benchmark recommendation approaches with regard to recommendation accuracy and coverage.

scholarly journals Context-Aware Computational Trust Model for Recommender Systems

2020 ◽  
Vol 4 (6) ◽  
Author(s):  
Edwin O. Ngwawe ◽  
Elisha O. Abade ◽  
Stephen N. Mburu
Keyword(s):  
Recommender Systems ◽  
Customer Service ◽  
Information Overload ◽  
Trust Model ◽  
Recommendation Algorithm ◽  
Computational Trust ◽  
Work From Home ◽  
Networking Technologies ◽  
The Government ◽  
Potential Customers

With increase in computing and networking technologies, many organizations have managed to place their services online with the aim of achieving efficiency in customer service as well as reach more potential customers, also with communicable diseases such as COVID-19 and need for social distancing, many people are encouraged to work from home, including shopping. To meet this objective in areas with poor Internet connectivity, the government of Kenya recently announced partnership with Google Inc for use of Google Loon. This has come up with challenges which include information overload on the side of the end consumer as well as security loopholes such as dishonest vendors preying on unsuspecting consumers. Recommender systems have been used to alleviate these two challenges by helping online users select the best item for their case. However, most recommender systems, especially common filtering recommendation algorithm (CFRA) based systems still rely on presenting output based on selections of nearest neighbors (most similar users – birds of the same feathers flock together). This leaves room for manipulation of the output by mimicking the features of their target and then picking malicious item such that when the recommender system runs, it will output the same malicious item to the target – a trust issue. Data to construct trust is equally a challenge. In this research, we propose to address this issue by creating a trust adjustment factor (TAF) for recommender systems for online services.

Improving Recommender Systems Using Co-Appearing and Semantically Correlated User Interests

2020 ◽  
Vol 13 (2) ◽  
pp. 240-247 ◽  
Author(s):  
Bilal Hawashin ◽  
Darah Aqel ◽  
Shadi Alzubi ◽  
Mohammad Elbes
Keyword(s):  
Recommender Systems ◽  
Experimental Work ◽  
Execution Time ◽  
Word Embeddings ◽  
User Interest ◽  
User Interests ◽  
And Behavior ◽  
The Given

Background: Recommender Systems use user interests to provide more accurate recommendations according to user actual interests and behavior. Methods: This work aims at improving recommender systems by discovering hidden user interests from the existing interests. User interest expansion would contribute in improving the accuracy of recommender systems by finding more user interests using the given ones. Two methods are proposed to perform the expansion: Expanding interests using correlated interests’ extractor and Expanding interests using word embeddings. Results: Experimental work shows that such expanding is efficient in terms of accuracy and execution time. Conclusion: Therefore, expanding user interests proved to be a promising step in the improvement of the recommender systems performance.

A Collaborative Filtering Recommendation Algorithm Based on Bipartite Graph

2013 ◽  
Vol 756-759 ◽  
pp. 3865-3868 ◽  
Author(s):  
Dan Er Chen ◽  
Yu Long Ying
Keyword(s):  
Electronic Commerce ◽  
Collaborative Filtering ◽  
Recommender Systems ◽  
Bipartite Graph ◽  
Rapid Growth ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
Filtering Algorithm ◽  
Collaborative Filtering Algorithm ◽  
Sparsity Problem

With the rapid growth and wide application of Internet, everyday there are many of information generated and the existence of a large amount of information makes it hardly to mining the wanted information. The recommendation algorithm is the process to alleviative the problem. Collaborative filtering algorithm is one successful personalized recommendation technology, and is widely used in many fields. But traditional collaborative filtering algorithm has the problem of sparsity, which will influence the efficiency of prediction. In this paper, a collaborative filtering recommendation algorithm based on bipartite graph is proposed. The algorithm takes users, items and tags into account, and also studies the degree of tags which may affect the similarity of users. The collaborative filtering recommendation algorithm based on bipartite graph can alleviate the sparsity problem in the electronic commerce recommender systems.

Sign in / Sign up

Export Citation Format

Share Document