scholarly journals Boosting API Recommendation with Implicit Feedback

Author(s):  
Yu Zhou ◽  
Xinying Yang ◽  
Taolue Chen ◽  
Zhiqiu Huang ◽  
Xiaoxing Ma ◽  
...  
Keyword(s):  
2021 ◽  
Vol 455 ◽  
pp. 59-67
Author(s):  
Yongxin Ni ◽  
Xiancong Chen ◽  
Weike Pan ◽  
Zixiang Chen ◽  
Zhong Ming

2021 ◽  
Vol 3 (2) ◽  
pp. 66-72
Author(s):  
Riad Taufik Lazwardi ◽  
Khoirul Umam

The analysis used in this study uses the help of Google Analytics to understand how the user's behavior on the Calculus learning material educational website page. Are users interested in recommendation articles? The answer to this question provides insight into the user's decision process and suggests how far a click is the result of an informed decision. Based on these results, it is hoped that a strategy to generate feedback from clicks should emerge. To evaluate the extent to which feedback shows relevance, versus implicit feedback to explicit feedback collected manually. The study presented in this study differs in at least two ways from previous work assessing the reliability of implicit feedback. First, this study aims to provide detailed insight into the user decision-making process through the use of a recommendation system with an implicit feedback feature. Second, evaluate the relative preferences that come from user behavior (user behavior). This differs from previous studies which primarily assessed absolute feedback. 


2020 ◽  
Vol 34 (04) ◽  
pp. 6127-6136
Author(s):  
Chao Wang ◽  
Hengshu Zhu ◽  
Chen Zhu ◽  
Chuan Qin ◽  
Hui Xiong

The recent development of online recommender systems has a focus on collaborative ranking from implicit feedback, such as user clicks and purchases. Different from explicit ratings, which reflect graded user preferences, the implicit feedback only generates positive and unobserved labels. While considerable efforts have been made in this direction, the well-known pairwise and listwise approaches have still been limited by various challenges. Specifically, for the pairwise approaches, the assumption of independent pairwise preference is not always held in practice. Also, the listwise approaches cannot efficiently accommodate “ties” due to the precondition of the entire list permutation. To this end, in this paper, we propose a novel setwise Bayesian approach for collaborative ranking, namely SetRank, to inherently accommodate the characteristics of implicit feedback in recommender system. Specifically, SetRank aims at maximizing the posterior probability of novel setwise preference comparisons and can be implemented with matrix factorization and neural networks. Meanwhile, we also present the theoretical analysis of SetRank to show that the bound of excess risk can be proportional to √M/N, where M and N are the numbers of items and users, respectively. Finally, extensive experiments on four real-world datasets clearly validate the superiority of SetRank compared with various state-of-the-art baselines.


2021 ◽  
Vol 36 (1) ◽  
pp. WI2-D_1-10
Author(s):  
Yasufumi Takama ◽  
Jing-cheng Zhang ◽  
Hiroki Shibata

2020 ◽  
Vol 5 ◽  
pp. 21-30
Author(s):  
Oksana Chala ◽  
Lyudmyla Novikova ◽  
Larysa Chernyshova ◽  
Angelika Kalnitskaya

The problem of identifying shilling attacks, which are aimed at forming false ratings of objects in the recommender system, is considered. The purpose of such attacks is to include in the recommended list of items the goods specified by the attacking user. The recommendations obtained as a result of the attack will not correspond to customers' real preferences, which can lead to distrust of the recommender system and a drop in sales. The existing methods for detecting shilling attacks use explicit feedback from the user and are focused primarily on building patterns that describe the key characteristics of the attack. However, such patterns only partially take into account the dynamics of user interests. A method for detecting shilling attacks using implicit feedback is proposed by comparing the temporal description of user selection processes and ratings. Models of such processes are formed using a set of weighted temporal rules that define the relationship in time between the moments when users select a given object. The method uses time-ordered input data. The method includes the stages of forming sets of weighted temporal rules for describing sales processes and creating ratings, calculating a set of ratings for these processes, and forming attack indicators based on a comparison of the ratings obtained. The resulting signs make it possible to distinguish between nuke and push attacks. The method is designed to identify discrepancies in the dynamics of purchases and ratings, even in the absence of rating values at certain time intervals. The technique makes it possible to identify an approach to masking an attack based on a comparison of the rating values and the received attack indicators. When applied iteratively, the method allows to refine the list of profiles of potential attackers. The technique can be used in conjunction with pattern-oriented approaches to identifying shilling attacks


Sign in / Sign up

Export Citation Format

Share Document