Search Results for author:
Found 8 papers, 3 papers with code
How Does Message Passing Improve Collaborative Filtering?
A branch of research enhances CF methods by message passing used in graph neural networks, due to its strong capabilities of extracting knowledge from graph-structured data, like user-item bipartite graphs that naturally exist in CF.
Improving Out-of-Vocabulary Handling in Recommendation Systems
This work focuses on a complementary problem: recommending new users and items unseen (out-of-vocabulary, or OOV) at training time.
GPT-generated Text Detection: Benchmark Dataset and Tensor-based Detection Method
As natural language models like ChatGPT become increasingly prevalent in applications and services, the need for robust and accurate methods to detect their output is of paramount importance.
Node Duplication Improves Cold-start Link Prediction
Graph Neural Networks (GNNs) are prominent in graph machine learning and have shown state-of-the-art performance in Link Prediction (LP) tasks.
CARL-G: Clustering-Accelerated Representation Learning on Graphs
CARL-G is adaptable to different clustering methods and CVIs, and we show that with the right choice of clustering method and CVI, CARL-G outperforms node classification baselines on 4/5 datasets with up to a 79x training speedup compared to the best-performing baseline.
Link Prediction with Non-Contrastive Learning
In this work, we extensively evaluate the performance of existing non-contrastive methods for link prediction in both transductive and inductive settings.
Linkless Link Prediction via Relational Distillation
In this work, to combine the advantages of GNNs and MLPs, we start with exploring direct knowledge distillation (KD) methods for link prediction, i. e., predicted logit-based matching and node representation-based matching.
FRAPPE: $\underline{\text{F}}$ast $\underline{\text{Ra}}$nk $\underline{\text{App}}$roximation with $\underline{\text{E}}$xplainable Features for Tensors
In this work, we propose FRAPPE and Self-FRAPPE: a cheaply supervised and a self-supervised method to estimate the canonical rank of a tensor without ever having to compute the CPD.
