Interest-Behaviour Multiplicative Network for Resource-limited Recommendation
Resource constraints, e.g. limited product inventory or financial strength, may affect consumers' choices or preferences in some recommendation tasks but are usually ignored in previous recommendation methods. In this paper, we aim to mine the cue of user preferences in resource-limited recommendation tasks, for which purpose we specifically build a large used car transaction dataset possessing resource-limitation characteristics. Accordingly, we propose an interest-behavior multiplicative network to predict the user's future interaction based on dynamic connections between users and items. To describe the user-item connection dynamically, mutually-recursive recurrent neural networks (MRRNNs) are introduced to capture interactive long-term dependencies, and meantime effective representations of users and items are obtained. To further take the resource limitation into consideration, a resource-limited branch is built to specifically explore the influence of resource variation on user preferences. Finally, mutual information is introduced to measure the similarity between the user action and fused features to predict future interaction, where the fused features come from both MRRNNs and resource-limited branches. We test the performance on the built used car transaction dataset as well as the Tmall dataset, and the experimental results verify the effectiveness of our framework.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Emergent Regulatory Response and Shift of Half induction point under Resource Competition in Genetic circuits
Synthetic genetic circuits are implemented in living cells for their operation. During gene expression, proteins are produced from the respective genes, by formation of complexes through the process of transcription and …
TranslationA Model-Agnostic Framework for Recommendation via Interest-aware Item Embeddings
Item representation holds significant importance in recommendation systems, which encompasses domains such as news, retail, and videos. Retrieval and ranking models utilise item representation to capture the user-item re…
Recommendation SystemsRepresentation LearningRetrievalLimits to Surprise in Recommender Systems
In this study, we address the challenge of measuring the ability of a recommender system to make surprising recommendations. Although current evaluation methods make it possible to determine if two algorithms can make re…
Recommendation SystemsELASTIC: Efficient Linear Attention for Sequential Interest Compression
State-of-the-art sequential recommendation models heavily rely on transformer's attention mechanism. However, the quadratic computational and memory complexities of self attention have limited its scalability for modelin…
Computational EfficiencyGPUSequential RecommendationMultiplicative Weights Updates with Constant Step-Size in Graphical Constant-Sum Games
Since Multiplicative Weights (MW) updates are the discrete analogue of the continuous Replicator Dynamics (RD), some researchers had expected their qualitative behaviours would be similar. We show that this is false in t…