The World Wide Web Conference 2019
DOI: 10.1145/3308558.3313460
|View full text |Cite
|
Sign up to set email alerts
|

Signed Distance-based Deep Memory Recommender

Abstract: Personalized recommendation algorithms learn a user's preference for an item by measuring a distance/similarity between them. However, some of the existing recommendation models (e.g., matrix factorization) assume a linear relationship between the user and item. This approach limits the capacity of recommender systems, since the interactions between users and items in real-world applications are much more complex than the linear relationship. To overcome this limitation, in this paper, we design and propose a … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
27
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 16 publications
(27 citation statements)
references
References 53 publications
0
27
0
Order By: Relevance
“…Recently, several works [11,22] are proposed to weigh the missing data. In [14,36], metric learning is applied to compute the distance between users and items. With the ability to represent non-linear and complex data, (deep) neural networks have been utilized in the domain of recommendation and bring more opportunities to reshape the conventional recommendation architectures.…”
Section: Recommendation With Implicit Feedbackmentioning
confidence: 99%
“…Recently, several works [11,22] are proposed to weigh the missing data. In [14,36], metric learning is applied to compute the distance between users and items. With the ability to represent non-linear and complex data, (deep) neural networks have been utilized in the domain of recommendation and bring more opportunities to reshape the conventional recommendation architectures.…”
Section: Recommendation With Implicit Feedbackmentioning
confidence: 99%
“…retrieval or nomination) stage aims to provide a small set of related items from a large corpus under stringent latency requirements [6,35]. Then, the candidate ranking model reranks the retrieved items based on click-through rate (CTR for short), rating or score [10,30,34]. In the retrieval stage, recommenders have to face the computational barriers of full corpus retrieval.…”
Section: Candidate Generation and Rankingmentioning
confidence: 99%
“…Many recent neural recommenders utilize attention mechanism to lter diverse user interests by concentrating on relevant behaviors and eliminating irrelevant ones to predict a user's future action [10,20,23,30,36,39]. Among these attentive neural recommenders, researches [10,20] assign weights to compressed hidden states to build attentive RNN models; researches [23,30] assign weights to historical records to build attentive memory networks; and researches [36,39] assign weights to hidden variables to build deep attentive feed-forward networks. But when calculating the correlation between two behaviors, the time interval between them has not been taken into consideration by most of the previous approaches.…”
Section: Introductionmentioning
confidence: 99%
“…In other cases, temporal data is utilized to predict the next item based on recent activity. For example, Distance Based Memory Recommender (SDMR) [37] is not a sequential model, but it does utilize recent activities as contextual side-information. The contribution and the focus of this work is different from these models, as AMP-CF does not utilize any temporal information.…”
Section: Related Workmentioning
confidence: 99%