Using Hypergraph-based User Profile in a Recommendation System

Author(s):  
Hilal Tarakci ◽  
Nihan Kesim Cicekli
2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Triyanna Widiyaningtyas ◽  
Indriana Hidayah ◽  
Teguh B. Adji

AbstractCollaborative filtering is one of the most widely used recommendation system approaches. One issue in collaborative filtering is how to use a similarity algorithm to increase the accuracy of the recommendation system. Most recently, a similarity algorithm that combines the user rating value and the user behavior value has been proposed. The user behavior value is obtained from the user score probability in assessing the genre data. The problem with the algorithm is it only considers genre data for capturing user behavior value. Therefore, this study proposes a new similarity algorithm – so-called User Profile Correlation-based Similarity (UPCSim) – that examines the genre data and the user profile data, namely age, gender, occupation, and location. All the user profile data are used to find the weights of the similarities of user rating value and user behavior value. The weights of both similarities are obtained by calculating the correlation coefficients between the user profile data and the user rating or behavior values. An experiment shows that the UPCSim algorithm outperforms the previous algorithm on recommendation accuracy, reducing MAE by 1.64% and RMSE by 1.4%.


2021 ◽  
pp. 1-8
Author(s):  
P. Shanmuga Sundari ◽  
M. Subaji

The recommendation system is affected with attacks when the users are given liberty to rate the items based on their impression about the product or service. Some malicious user or other competitors’ try to inject fake rating to degrade the item’s graces that are mostly adored by several users. Attacks in the rating matrix are not executed just by a single profile. A group of users profile is injected into rating matrix to decrease the performance. It is highly complex to extract the fake ratings from the mixture of genuine profile as it resides the same pattern. Identifying the attacked profile and the target item of the fake rating is a challenging task in the big data environment. This paper proposes a unique method to identify the attacks in collaborating filtering method. The process of extracting fake rating is carried out in two phases. During the initial phase, doubtful user profile is identified from the rating matrix. In the following phase, the target item is analysed using push attack count to reduce the false positive rates from the doubtful user profile. The proposed model is evaluated with detection rate and false positive rates by considering the filler size and attacks size. The experiment was conducted with 6%, 8% and 10% filler sizes and with different attack sizes that ranges from 0%–100%. Various classification techniques such as decision tree, logistic regression, SVM and random forest methods are used to classify the fake ratings. From the results, it is witnessed that SVM model works better with random and bandwagon attack models at an average of 4% higher accuracy. Similarly the decision tree method performance better at an average of 3% on average attack model.


Author(s):  
Rabi Narayan Behera ◽  
Sujata Dash

Due to rapid digital explosion user shows interest towards finding suggestions regarding a particular topic before taking any decision. Nowadays, a movie recommendation system is an upcoming area which suggests movies based on user profile. Many researchers working on supervised or semi-supervised ensemble based machine learning approach for matching more appropriate profiles and suggest related movies. In this paper a hybrid recommendation system is proposed which includes both collaborative and content based filtering to design a profile matching algorithm. A nature inspired Particle Swam Optimization technique is applied to fine tune the profile matching algorithm by assigning to multiple agents or particle with some initial random guess. The accuracy of the model will be judged comparing with Genetic algorithm.


2017 ◽  
Vol 05 (10) ◽  
pp. 1-11
Author(s):  
Jingfeng Shao ◽  
Xiaoyu Yang ◽  
Chuangtao Ma

2016 ◽  
Vol 2 ◽  
pp. e63 ◽  
Author(s):  
Nirmal Jonnalagedda ◽  
Susan Gauch ◽  
Kevin Labille ◽  
Sultan Alfarhood

Online news reading has become a widely popular way to read news articles from news sources around the globe. With the enormous amount of news articles available, users are easily overwhelmed by information of little interest to them. News recommender systems help users manage this flood by recommending articles based on user interests rather than presenting articles in order of their occurrence. We present our research on developing personalized news recommendation system with the help of a popular micro-blogging service, “Twitter.” News articles are ranked based on the popularity of the article identified from Twitter’s public timeline. In addition, users construct profiles based on their interests and news articles are also ranked based on their match to the user profile. By integrating these two approaches, we present a hybrid news recommendation model that recommends interesting news articles to the user based on their popularity as well as their relevance to the user profile.


Author(s):  
Jun Cai ◽  
Xuebin Hong ◽  
Qingyun Dai ◽  
Huimin Zhao ◽  
Yan Liu ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document