A Collaborative Filtering Recommendation Method Based on Item Category

2012 ◽  
Vol 605-607 ◽  
pp. 2430-2433
Author(s):  
Wei Bin Deng ◽  
Jin Liu
Keyword(s):  
Collaborative Filtering ◽  
Real Time ◽  
Recommender System ◽  
Nearest Neighbors ◽  
Search Space ◽  
User Preferences ◽  
Experimental Results ◽  
Recommendation Algorithm ◽  
Search Speed ◽  
Speed And Accuracy

Traditional collaborative filtering algorithms are facing severe challenges of sparse user rating and real-time recommendation. To solve the problems, the category structure of merchandise is analyzed deeply and a collaborative filtering recommendation algorithm based on item category is proposed. A smooth filling technique is used for rating matrix with user preferences and all users rating on the item to solve the sparse problem. A user has different interests on different category. For every item, the nearest neighbors are searched within the category of the item. Not only is the search space of the users’ neighbors reduced greatly, but also search speed and accuracy are promoted. The experimental results show that the method can efficiently improve the recommendation scalability and accuracy of the recommender system.

Identifying Attack Models for Securing Cluster-Based Recommendation System

2020 ◽  
Vol 14 ◽  
Author(s):  
Amreen Ahmad ◽  
Tanvir Ahmad ◽  
Ishita Tripathi
Keyword(s):  
Collaborative Filtering ◽  
Recommender System ◽  
Recommendation System ◽  
Relevant Information ◽  
System Function ◽  
Recommendation Algorithm ◽  
Underlying Network ◽  
Entire Dataset ◽  
Attack Models ◽  
Wide Usage

: The immense growth of information has led to the wide usage of recommender systems for retrieving relevant information. One of the widely used methods for recommendation is collaborative filtering. However, such methods suffer from two problems, scalability and sparsity. In the proposed research, the two issues of collaborative filtering are addressed and a cluster-based recommender system is proposed. For the identification of potential clusters from the underlying network, Shapley value concept is used, which divides users into different clusters. After that, the recommendation algorithm is performed in every respective cluster. The proposed system recommends an item to a specific user based on the ratings of the item’s different attributes. Thus, it reduces the running time of the overall algorithm, since it avoids the overhead of computation involved when the algorithm is executed over the entire dataset. Besides, the security of the recommender system is one of the major concerns nowadays. Attackers can come in the form of ordinary users and introduce bias in the system to force the system function that is advantageous for them. In this paper, we identify different attack models that could hamper the security of the proposed cluster-based recommender system. The efficiency of the proposed research is validated by conducting experiments on student dataset.

Modelling trust networks using resistive circuits for trust-aware recommender systems

2016 ◽  
Vol 43 (1) ◽  
pp. 135-144 ◽  
Author(s):  
Mehdi Hosseinzadeh Aghdam ◽  
Morteza Analoui ◽  
Peyman Kabiri
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Recommender System ◽  
Cold Start ◽  
User Preferences ◽  
Item Selection ◽  
Trust Networks ◽  
Trust Inference ◽  
Trust Information

Recommender systems have been widely used for predicting unknown ratings. Collaborative filtering as a recommendation technique uses known ratings for predicting user preferences in the item selection. However, current collaborative filtering methods cannot distinguish malicious users from unknown users. Also, they have serious drawbacks in generating ratings for cold-start users. Trust networks among recommender systems have been proved beneficial to improve the quality and number of predictions. This paper proposes an improved trust-aware recommender system that uses resistive circuits for trust inference. This method uses trust information to produce personalized recommendations. The result of evaluating the proposed method on Epinions dataset shows that this method can significantly improve the accuracy of recommender systems while not reducing the coverage of recommender systems.

A Collaborative Filtering Recommendation Algorithm Incorporated with Life Cycle

2013 ◽  
Vol 765-767 ◽  
pp. 630-633 ◽  
Author(s):  
Chong Lin Zheng ◽  
Kuang Rong Hao ◽  
Yong Sheng Ding
Keyword(s):  
Life Cycle ◽  
Collaborative Filtering ◽  
Recommendation Systems ◽  
Experimental Results ◽  
User Interest ◽  
Recommendation Algorithm ◽  
Time Information ◽  
Successful Technology

Collaborative filtering recommendation algorithm is the most successful technology for recommendation systems. However, traditional collaborative filtering recommendation algorithm does not consider the change of time information. For this problem,this paper improve the algorithm with two new methods:Predict score incorporated with time information in order to reflect the user interest change; Recommend according to scores by adding the weight information determined by the item life cycle. Experimental results show that the proposed algorithm outperforms the traditional item in accuracy.

A Network-Based Multi-Dimensional Recommendation Algorithm

2013 ◽  
Vol 765-767 ◽  
pp. 1218-1222
Author(s):  
Xiang Yun Xiong ◽  
Yu Chen Fu ◽  
Zhao Qing Liu
Keyword(s):  
Collaborative Filtering ◽  
Experimental Results ◽  
Personalized Recommendation ◽  
Bipartite Network ◽  
Recommendation Algorithm ◽  
Better Than

Personalized recommendation based on bipartite network has attracted more and more attention. Its obviously better than CF (Collaborative Filtering). In this paper, we propose a multi-dimensional recommendation algorithm called BNPM. It combines item-based, user-based and category-based recommendation model to improve recommendation quality. The experimental results show that the algorithm can improve the diversity and reduce the popularity on the base of holding the accuracy of the recommendation

An Improved Real-Time Recommendation for Microblogs Based on Topic

2019 ◽  
Vol 34 (02) ◽  
pp. 2059006
Author(s):  
Yikui Shi ◽  
Jiyan Liu ◽  
Lei Shi ◽  
Jianwen Zhao ◽  
Na Su
Keyword(s):  
Real Time ◽  
Information Overload ◽  
Rapid Development ◽  
Search Space ◽  
Decay Function ◽  
Recommendation Algorithm ◽  
User Similarity ◽  
User Clustering ◽  
Intermediate Variables ◽  
Over Time

With the rapid development of the Internet, people are confronted with information overload. Many recommendation methods are designed to solve this problem. The main contributions of recommendation methods proposed in this paper are as follows: (1) An improved collaborative filtering recommendation algorithm based on user clustering is proposed. Clustering is performed according to user similarity based on the user-item rating matrix. So the search space of recommendation algorithm is reduced. (2) Considering the factor that user’s interests may dynamically change over time, a time decay function is introduced. (3) A method of real-time recommendation based on topic for microblogs is designed to realize real-time recommendation effectively by preserving intermediate variables of user similarity. Experiments show that the proposed algorithms have been improved in terms of running time and accuracy.

scholarly journals Collaborative filtering recommendation algorithm based on user correlation and evolutionary clustering

2019 ◽  
Vol 6 (1) ◽  
pp. 147-156 ◽  
Author(s):  
Jianrui Chen ◽  
Chunxia Zhao ◽  
Uliji ◽  
Lifang Chen
Keyword(s):  
Dimension Reduction ◽  
Collaborative Filtering ◽  
Data Clustering ◽  
Real Life ◽  
Nearest Neighbors ◽  
User Group ◽  
Recommendation Algorithm ◽  
Evolutionary Clustering ◽  
The Relationship ◽  
Score Matrix

Abstract In recent years, application of recommendation algorithm in real life such as Amazon, Taobao is getting universal, but it is not perfect yet. A few problems need to be solved such as sparse data and low recommended accuracy. Collaborative filtering is a mature algorithm in the recommended systems, but there are still some problems. In this paper, a novel collaborative filtering recommendation algorithm based on user correlation and evolutionary clustering is presented. Firstly, score matrix is pre-processed with normalization and dimension reduction, to obtain denser score data. Based on these processed data, clustering principle is generated and dynamic evolutionary clustering is implemented. Secondly, the search for the nearest neighbors with highest similar interest is considered. A measurement about the relationship between users is proposed, called user correlation, which applies the satisfaction of users and the potential information. In each user group, user correlation is applied to choose the nearest neighbors to predict ratings. The proposed method is evaluated using the Movielens dataset. Diversity experimental results demonstrate that the proposed method has outstanding performance in predicted accuracy and recommended precision.

Pre-Filling Collaborative Filtering Algorithm Based on Matrix Factorization

2013 ◽  
Vol 411-414 ◽  
pp. 2223-2228
Author(s):  
Dong Liang Su ◽  
Zhi Ming Cui ◽  
Jian Wu ◽  
Peng Peng Zhao
Keyword(s):  
Collaborative Filtering ◽  
Recommender System ◽  
Matrix Factorization ◽  
Nearest Neighbor ◽  
User Profile ◽  
Personalized Recommendation ◽  
System Quality ◽  
Recommendation Algorithm ◽  
Collaborative Filtering Algorithm ◽  
Personalized Recommender System

Nowadays personalized recommendation algorithm of e-commerce can hardly meet the needs of users as an ever-increasing number of users and items in personalized recommender system has brought about sparsity of user-item rating matrix and the emergence of more and more new users has threatened recommender system quality. This paper puts forward a pre-filled collaborative filtering recommendation algorithm based on matrix factorization, pre-filling user-item matrixes by matrix factorization and building nearest-neighbor models according to new user profile information, thus mitigating the influence of matrix sparsity and new users and improving the accuracy of recommender system. The experimental results suggest that this algorithm is more precise and effective than the traditional one under the condition of extremely sparse user-item rating matrix.

CAN DISSIMILAR USERS CONTRIBUTE TO ACCURACY AND DIVERSITY OF PERSONALIZED RECOMMENDATION?

2010 ◽  
Vol 21 (10) ◽  
pp. 1217-1227 ◽  
Author(s):  
WEI ZENG ◽  
MING-SHENG SHANG ◽  
QIAN-MING ZHANG ◽  
LINYUAN LÜ ◽  
TAO ZHOU
Keyword(s):  
Collaborative Filtering ◽  
Recommender System ◽  
High Accuracy ◽  
Personalized Recommendation ◽  
Recommendation Algorithm ◽  
Filtering Algorithm ◽  
Recommendation Algorithms ◽  
Collaborative Filtering Algorithm ◽  
High Diversity ◽  
Better Than

Recommender systems are becoming a popular and important set of personalization techniques that assist individual users with navigating through the rapidly growing amount of information. A good recommender system should be able to not only find out the objects preferred by users, but also help users in discovering their personalized tastes. The former corresponds to high accuracy of the recommendation, while the latter to high diversity. A big challenge is to design an algorithm that provides both highly accurate and diverse recommendation. Traditional recommendation algorithms only take into account the contributions of similar users, thus, they tend to recommend popular items for users ignoring the diversity of recommendations. In this paper, we propose a recommendation algorithm by considering both the effects of similar and dissimilar users under the framework of collaborative filtering. Extensive analyses on three datasets, namely MovieLens, Netflix and Amazon, show that our method performs much better than the standard collaborative filtering algorithm for both accuracy and diversity.

scholarly journals Session-Based Recommender System for Sustainable Digital Marketing

2019 ◽  
Vol 11 (12) ◽  
pp. 3336 ◽  
Author(s):  
Hyunwoo Hwangbo ◽  
Yangsok Kim
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Recommender System ◽  
High Performance ◽  
Marketing Strategies ◽  
Feature Weighting ◽  
Experimental Results ◽  
Digital Marketing ◽  
Chi Square ◽  
Fashion Products

Many companies operate e-commerce websites to sell fashion products. Some customers want to buy products with intention of sustainability and therefore the companies need to suggest appropriate fashion products to those customers. Recommender systems are key applications in these sustainable digital marketing strategies and high performance is the most necessary factor. This research aims to improve recommendation systems’ performance by considering item session and attribute session information. We suggest the Item Session-Based Recommender (ISBR) and the Attribute Session-Based Recommenders (ASBRs) that use item and attribute session data independently, and then we suggest the Feature-Weighted Session-Based Recommenders (FWSBRs) that combine multiple ASBRs with various feature weighting schemes. Our experimental results show that FWSBR with chi-square feature weighting scheme outperforms ISBR, ASBRs, and Collaborative Filtering Recommender (CFR). In addition, it is notable that FWSBRs overcome the cold-start item problem, one significant limitation of CFR and ISBR, without losing performance.

Sign in / Sign up

Export Citation Format

Share Document