Search Results for author:
Found 23 papers, 5 papers with code
Meta-optimized Joint Generative and Contrastive Learning for Sequential Recommendation
In this paper, we propose a Meta-optimized Seq2Seq Generator and Contrastive Learning (Meta-SGCL) for sequential recommendation, which applies the meta-optimized two-step training strategy to adaptive generate contrastive views.
Search to Fine-tune Pre-trained Graph Neural Networks for Graph-level Tasks
Given a pre-trained GNN, we propose to search to fine-tune pre-trained graph neural networks for graph-level tasks (S2PGNN), which adaptively design a suitable fine-tuning framework for the given labeled data on the downstream task.
HeteFedRec: Federated Recommender Systems with Model Heterogeneity
Owing to the nature of privacy protection, federated recommender systems (FedRecs) have garnered increasing interest in the realm of on-device recommender systems.
Contrastive Enhanced Slide Filter Mixer for Sequential Recommendation
Sequential recommendation (SR) aims to model user preferences by capturing behavior patterns from their item historical interaction data.
Sequential Recommendation with Diffusion Models
Generative models, such as Variational Auto-Encoder (VAE) and Generative Adversarial Network (GAN), have been successfully applied in sequential recommendation.
Large-scale Entity Alignment via Knowledge Graph Merging, Partitioning and Embedding
Therefore, in this work, we propose a scalable GNN-based entity alignment approach to reduce the structure and alignment loss from three perspectives.
Few-Shot Semantic Relation Prediction across Heterogeneous Graphs
In real-world scenarios, new semantic relations constantly emerge and they typically appear with only a few labeled data.
Time-aware Dynamic Graph Embedding for Asynchronous Structural Evolution
Meanwhile, we treat each edge sequence as a whole and embed its ToV of the first vertex to further encode the time-sensitive information.
A Learned Index for Exact Similarity Search in Metric Spaces
In this paper, we propose a novel indexing approach called LIMS that uses data clustering, pivot-based data transformation techniques and learned indexes to support efficient similarity query processing in metric spaces.
Ensemble Semi-supervised Entity Alignment via Cycle-teaching
We also design a conflict resolution mechanism to resolve the alignment conflict when combining the new alignment of an aligner and that from its teacher.
Informed Multi-context Entity Alignment
Entity alignment is a crucial step in integrating knowledge graphs (KGs) from multiple sources.
Quaternion-Based Graph Convolution Network for Recommendation
Graph Convolution Network (GCN) has been widely applied in recommender systems for its representation learning capability on user and item embeddings.
Edge-Enhanced Global Disentangled Graph Neural Network for Sequential Recommendation
In this paper, we propose an Edge-Enhanced Global Disentangled Graph Neural Network (EGD-GNN) model to capture the relation information between items for global item representation and local user intention learning.
Overcoming Data Sparsity in Group Recommendation
Specifically, we first extend BGEM to model group-item interactions, and then in order to overcome the limitation and sparsity of the interaction data generated by occasional groups, we propose a self-attentive mechanism to represent groups based on the group members.
EPARS: Early Prediction of At-risk Students with Online and Offline Learning Behaviors
We propose a novel algorithm (EPARS) that could early predict STAR in a semester by modeling online and offline learning behaviors.
Sequence-Aware Factorization Machines for Temporal Predictive Analytics
As a widely adopted solution, models based on Factorization Machines (FMs) are capable of modelling high-order interactions among features for effective sparse predictive analytics.
SoulMate: Short-text author linking through Multi-aspect temporal-textual embedding
Our approach, on the one hand, computes the relevance score (edge weight) between the authors through considering a portmanteau of contents and concepts, and on the other hand, employs a stack-wise graph cutting algorithm to extract the communities of the related authors.
TEAGS: Time-aware Text Embedding Approach to Generate Subgraphs
We can use the temporal and textual data of the nodes to compute the edge weights and then generate subgraphs with highly relevant nodes.
Deep Cross Networks with Aesthetic Preference for Cross-domain Recommendation
Then, we integrate the aesthetic features into a cross-domain network to transfer users' domain independent aesthetic preferences.
Discrete Multi-modal Hashing with Canonical Views for Robust Mobile Landmark Search
Finally, compact binary codes are learned on intermediate representation within a tailored discrete binary embedding model which preserves visual relations of images measured with canonical views and removes the involved noises.
Personalized Video Recommendation Using Rich Contents from Videos
In the existing video recommender systems, the models make the recommendations based on the user-video interactions and single specific content features.
A Convex Formulation for Spectral Shrunk Clustering
Thus, applying manifold information obtained from the original space to the clustering process in a low-dimensional subspace is prone to inferior performance.
Compound Rank-k Projections for Bilinear Analysis
In many real-world applications, data are represented by matrices or high-order tensors.
