Search Results for author:
Found 27 papers, 15 papers with code
Prompt-enhanced Federated Content Representation Learning for Cross-domain Recommendation
For Limitation 2, we model items in a universal feature space by their description texts.
Graph Condensation: A Survey
The burgeoning volume of graph data poses significant challenges in storage, transmission, and particularly the training of graph neural networks (GNNs).
Poisoning Attacks against Recommender Systems: A Survey
This survey paper provides a systematic and up-to-date review of the research landscape on Poisoning Attacks against Recommendation (PAR).
Poisoning Attacks Against Contrastive Recommender Systems
Contrastive learning (CL) has recently gained significant popularity in the field of recommendation.
Motif-Based Prompt Learning for Universal Cross-Domain Recommendation
By unifying pre-training and recommendation tasks as a common motif-based similarity learning task and integrating adaptable prompt parameters to guide the model in downstream recommendation tasks, MOP excels in transferring domain knowledge effectively.
Accelerating Scalable Graph Neural Network Inference with Node-Adaptive Propagation
To further accelerate Scalable GNNs inference in this inductive setting, we propose an online propagation framework and two novel node-adaptive propagation methods that can customize the optimal propagation depth for each node based on its topological information and thereby avoid redundant feature propagation.
Towards Communication-Efficient Model Updating for On-Device Session-Based Recommendation
On-device recommender systems recently have garnered increasing attention due to their advantages of providing prompt response and securing privacy.
Semantic-aware Node Synthesis for Imbalanced Heterogeneous Information Networks
To tackle the imbalance of minority classes and supplement their inadequate semantics, we present the first method for the semantic imbalance problem in imbalanced HINs named Semantic-aware Node Synthesis (SNS).
Efficient Bi-Level Optimization for Recommendation Denoising
To efficiently solve this bi-level optimization problem, we employ a weight generator to avoid the storage of weights and a one-step gradient-matching-based loss to significantly reduce computational time.
Efficient On-Device Session-Based Recommendation
Specifically, each item is represented by a compositional code that consists of several codewords, and we learn embedding vectors to represent each codeword instead of each item.
XSimGCL: Towards Extremely Simple Graph Contrastive Learning for Recommendation
Contrastive learning (CL) has recently been demonstrated critical in improving recommendation performance.
On-Device Next-Item Recommendation with Self-Supervised Knowledge Distillation
Meanwhile, to compensate for the capacity loss caused by compression, we develop a self-supervised knowledge distillation framework which enables the compressed model (student) to distill the essential information lying in the raw data, and improves the long-tail item recommendation through an embedding-recombination strategy with the original model (teacher).
Self-Supervised Learning for Recommender Systems: A Survey
In recent years, neural architecture-based recommender systems have achieved tremendous success, but they still fall short of expectation when dealing with highly sparse data.
Predictive and Contrastive: Dual-Auxiliary Learning for Recommendation
To explore recommendation-specific auxiliary tasks, we first quantitatively analyze the heterogeneous interaction data and find a strong positive correlation between the interactions and the number of user-item paths induced by meta-paths.
Who Are the Best Adopters? User Selection Model for Free Trial Item Promotion
By providing users with opportunities to experience goods without charge, a free trial makes adopters know more about products and thus encourages their willingness to buy.
Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendation
Contrastive learning (CL) recently has spurred a fruitful line of research in the field of recommendation, since its ability to extract self-supervised signals from the raw data is well-aligned with recommender systems' needs for tackling the data sparsity issue.
Double-Scale Self-Supervised Hypergraph Learning for Group Recommendation
Technically, for (1), a hierarchical hypergraph convolutional network based on the user- and group-level hypergraphs is developed to model the complex tuplewise correlations among users within and beyond groups.
Self-Supervised Graph Co-Training for Session-based Recommendation
In this paper, for informative session-based data augmentation, we combine self-supervised learning with co-training, and then develop a framework to enhance session-based recommendation.
Ready for Emerging Threats to Recommender Systems? A Graph Convolution-based Generative Shilling Attack
To explore the robustness of recommender systems, researchers have proposed various shilling attack models and analyzed their adverse effects.
Socially-Aware Self-Supervised Tri-Training for Recommendation
Under this scheme, only a bijective mapping is built between nodes in two different views, which means that the self-supervision signals from other nodes are being neglected.
Fast-adapting and Privacy-preserving Federated Recommender System
In the mobile Internet era, the recommender system has become an irreplaceable tool to help users discover useful items, and thus alleviating the information overload problem.
Self-Supervised Multi-Channel Hypergraph Convolutional Network for Social Recommendation
In this paper, we fill this gap and propose a multi-channel hypergraph convolutional network to enhance social recommendation by leveraging high-order user relations.
Self-Supervised Hypergraph Convolutional Networks for Session-based Recommendation
Moreover, to enhance hypergraph modeling, we devise another graph convolutional network which is based on the line graph of the hypergraph and then integrate self-supervised learning into the training of the networks by maximizing mutual information between the session representations learned via the two networks, serving as an auxiliary task to improve the recommendation task.
Path-Based Reasoning over Heterogeneous Networks for Recommendation via Bidirectional Modeling
Despite their effectiveness, these models are often confronted with the following limitations: (1) Most prior path-based reasoning models only consider the influence of the predecessors on the subsequent nodes when modeling the sequences, and ignore the reciprocity between the nodes in a path; (2) The weights of nodes in the same path instance are usually assumed to be constant, whereas varied weights of nodes can bring more flexibility and lead to expressive modeling; (3) User-item interactions are noisy, but they are often indiscriminately exploited.
Enhancing Social Recommendation with Adversarial Graph Convolutional Networks
Social recommender systems are expected to improve recommendation quality by incorporating social information when there is little user-item interaction data.
Recommender Systems Based on Generative Adversarial Networks: A Problem-Driven Perspective
In general, two lines of research have been conducted, and their common ideas can be summarized as follows: (1) for the data noise issue, adversarial perturbations and adversarial sampling-based training often serve as a solution; (2) for the data sparsity issue, data augmentation--implemented by capturing the distribution of real data under the minimax framework--is the primary coping strategy.
Generating Reliable Friends via Adversarial Training to Improve Social Recommendation
Most of the recent studies of social recommendation assume that people share similar preferences with their friends and the online social relations are helpful in improving traditional recommender systems.
