BasConv: Aggregating Heterogeneous Interactions for Basket Recommendation with Graph Convolutional Neural Network

• URL: http://arxiv.org/abs/2001.09900v2
• Date: Fri, 8 May 2020 03:17:23 GMT
• Title: BasConv: Aggregating Heterogeneous Interactions for Basket Recommendation with Graph Convolutional Neural Network
• Authors: Zhiwei Liu, Mengting Wan, Stephen Guo, Kannan Achan, Philip S. Yu
• Abstract summary: Within-basket recommendation reduces the exploration time of users, where the user's intention of the basket matters. We propose a new framework named textbfBasConv, which is based on the graph convolutional neural network. Our BasConv model has three types of aggregators specifically designed for three types of nodes.
• Score: 64.73281115977576
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Within-basket recommendation reduces the exploration time of users, where the user's intention of the basket matters. The intent of a shopping basket can be retrieved from both user-item collaborative filtering signals and multi-item correlations. By defining a basket entity to represent the basket intent, we can model this problem as a basket-item link prediction task in the User-Basket-Item~(UBI) graph. Previous work solves the problem by leveraging user-item interactions and item-item interactions simultaneously. However, collectivity and heterogeneity characteristics are hardly investigated before. Collectivity defines the semantics of each node which should be aggregated from both directly and indirectly connected neighbors. Heterogeneity comes from multi-type interactions as well as multi-type nodes in the UBI graph. To this end, we propose a new framework named \textbf{BasConv}, which is based on the graph convolutional neural network. Our BasConv model has three types of aggregators specifically designed for three types of nodes. They collectively learn node embeddings from both neighborhood and high-order context. Additionally, the interactive layers in the aggregators can distinguish different types of interactions. Extensive experiments on two real-world datasets prove the effectiveness of BasConv. Our code is available online at https://github.com/JimLiu96/basConv.

Related papers

• Cluster-based Graph Collaborative Filtering [55.929052969825825]
  Graph Convolution Networks (GCNs) have succeeded in learning user and item representations for recommendation systems. Most existing GCN-based methods overlook the multiple interests of users while performing high-order graph convolution. We propose a novel GCN-based recommendation model, termed Cluster-based Graph Collaborative Filtering (ClusterGCF)
  arXiv  Detail & Related papers  (2024-04-16T07:05:16Z)
• OntoMerger: An Ontology Integration Library for Deduplicating and Connecting Knowledge Graph Nodes [2.6553713413568913]
  OntoMerger is a Python integration library whose functionality is to deduplicate KG nodes. Our approach takes a set of KG nodes, mappings and disconnected and generates a set of merged nodes together with a connected hierarchy. OntoMerger can be applied to a wide variety of KGs.
  arXiv  Detail & Related papers  (2022-06-05T18:52:26Z)
• Multi-Behavior Enhanced Recommendation with Cross-Interaction Collaborative Relation Modeling [42.6279077675585]
  This work proposes a Graph Neural Multi-Behavior Enhanced Recommendation framework. It explicitly models the dependencies between different types of user-item interactions under a graph-based message passing architecture. Experiments on real-world recommendation datasets show that our GNMR consistently outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-01-07T03:12:37Z)
• Heterogeneous Graph Collaborative Filtering [25.05199172369437]
  We propose to model user-item interactions as a heterogeneous graph which consists of not only user-item edges indicating their interaction but also user-user edges indicating their similarity. We develop heterogeneous graph collaborative filtering (HGCF), a GCN-based framework which can explicitly capture both the interaction signal and similarity signal.
  arXiv  Detail & Related papers  (2020-11-13T08:34:53Z)
• Basket Recommendation with Multi-Intent Translation Graph Neural Network [59.00550319853681]
  Basket recommendation(BR) is to recommend a ranking list of items to the current basket. We propose a new framework named as textbfMulti-textbfIntent textbfTranslation textbfGraph textbfNeural textbfNetwork(textbfMITGNN)
  arXiv  Detail & Related papers  (2020-10-22T03:52:00Z)
• ConsNet: Learning Consistency Graph for Zero-Shot Human-Object Interaction Detection [101.56529337489417]
  We consider the problem of Human-Object Interaction (HOI) Detection, which aims to locate and recognize HOI instances in the form of human, action, object> in images. We argue that multi-level consistencies among objects, actions and interactions are strong cues for generating semantic representations of rare or previously unseen HOIs. Our model takes visual features of candidate human-object pairs and word embeddings of HOI labels as inputs, maps them into visual-semantic joint embedding space and obtains detection results by measuring their similarities.
  arXiv  Detail & Related papers  (2020-08-14T09:11:18Z)
• Bundle Recommendation with Graph Convolutional Networks [71.95344006365914]
  Existing solutions integrate user-item interaction modeling into bundle recommendation by sharing model parameters or learning in a multi-task manner. We propose a graph neural network model named BGCN (short for textittextBFBundle textBFGraph textBFConvolutional textBFNetwork) for bundle recommendation.
  arXiv  Detail & Related papers  (2020-05-07T13:48:26Z)
• Iterative Context-Aware Graph Inference for Visual Dialog [126.016187323249]
  We propose a novel Context-Aware Graph (CAG) neural network. Each node in the graph corresponds to a joint semantic feature, including both object-based (visual) and history-related (textual) context representations.
  arXiv  Detail & Related papers  (2020-04-05T13:09:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.