Proceedings of the 25th Conference on User Modeling, Adaptation and Personalization 2017
DOI: 10.1145/3079628.3079685
|View full text |Cite
|
Sign up to set email alerts
|

Weighted Random Walk Sampling for Multi-Relational Recommendation

Abstract: In the information overloaded web, personalized recommender systems are essential tools to help users nd most relevant information. e most heavily-used recommendation frameworks assume user interactions that are characterized by a single relation. However, for many tasks, such as recommendation in social networks, user-item interactions must be modeled as a complex network of multiple relations, not only a single relation. Recently research on multi-relational factorization and hybrid recommender models has sh… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(6 citation statements)
references
References 13 publications
0
6
0
Order By: Relevance
“…Random walk strategy has been widely applied in recommendation. [53] performs random walk along the social network to search relevant users who have similar preference with the target user for better rating prediction; [54] exploits random walk to obtain diverse recommendation; [55] further extends [54] in heterogenous information network to generate valuable meta-paths; [54] performs random walk to complete implicit feedback matrix for mitigating data sparsity problem; Similarly, [25] employs random walk to find more positive instances. We remark that these works adopt static (uniform or pre-defined) transfer probability in their random walk strategy.…”
Section: Related Workmentioning
confidence: 99%
“…Random walk strategy has been widely applied in recommendation. [53] performs random walk along the social network to search relevant users who have similar preference with the target user for better rating prediction; [54] exploits random walk to obtain diverse recommendation; [55] further extends [54] in heterogenous information network to generate valuable meta-paths; [54] performs random walk to complete implicit feedback matrix for mitigating data sparsity problem; Similarly, [25] employs random walk to find more positive instances. We remark that these works adopt static (uniform or pre-defined) transfer probability in their random walk strategy.…”
Section: Related Workmentioning
confidence: 99%
“…However, the weights will greatly improve the information of the samples. For example, as shown in Figure 4, ifp (x i ) q(x i ) is equal to 1, then w(x i ) is equal to 1 according to equation (3), which means sample x i must subject to the target distribution. Therefore, the distribution of samples with higher weight is more approximate to the target distribution.…”
Section: E Importance Resamplingmentioning
confidence: 99%
“…However, how to further improve the accuracy of Web services QoS prediction is still a problem. Traditional researches [1]- [3] mainly focus on increasing the complexity of the predicting models for fixing the problem and simply assume that the probability distribution of QoS datasets is uniform. However, in the real world, QoS datasets tend to follow a complex distribution, that the sampled data (training data of the predicting models) based on such assumption is biased and leads inaccurate prediction.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, we should give higher weights to positions with the higher preferences. Based on reference [38], the userlocation edge weight is define as follows: u,p) ∀p ∈P u e r (u,p)…”
Section: Quantification Of Edge Weights Between Layers 1) User Prementioning
confidence: 99%