Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

80161241321 · Jun 202019922001200920172026
48 results for graph recommendation

CLEAR learns causal graphs from attention in recommender systems to explain user behavior.

problem Understanding why specific recommendations are made in recommender systems.
method CLEAR learns session-specific causal graphs from attention in pre-trained neural recommenders, addressing latent confounders.
result CLEAR provides counterfactual explanations that are shorter and more effective than naive methods.

PGRec improves recommendation by modeling user-item preferences as a graph and embedding it for better predictions.

problem Sparse user-item data in recommender systems.
method PGRec models user-item preferences as a PrefGraph, then uses deep learning and factorization to embed and predict user preferences.
result PGRec outperforms state-of-the-art methods by up to 3.2% in NDCG@10.

Study bandit problem on smooth graph functions for recommender systems.

problem Online learning problems involving graphs, like content-based recommendation.
method Introduced spectral bandit problem and two algorithms that scale linearly in effective dimension.
result Learned user preferences for thousands of items from just tens nodes evaluations.

Recommender system is an important component of many web services to help users locate items that match their interests. Several studies showed that recommender systems are vulnerable to poisoning attacks, in which an attacker injects fake data to a given system such that the system makes recommendations as the attacke…

2018-09-11abs ↗pdf ↗

Graph neural networks improve cold start for new items in recommender systems.

problem Cold start problem for new items in recommender systems.
method Item hierarchy graphs and bespoke graph neural network architecture.
result Our method achieves better forecasting quality than state-of-the-art with comparable computational time.

CFRecs uses counterfactual reasoning to improve graph-based recommendations in real estate.

problem Improving model interpretability and actionable insights in graph-based recommender systems.
method A two-stage architecture combining GNN and Graph-VAE to propose minimal yet impactful changes in graph structure and node attributes.
result Demonstrates effectiveness in delivering actionable recommendations for home buyers and sellers.

GraphSAIL updates GNN-based recommender models incrementally to reduce computation time and improve frequent updates.

problem Incremental updates in GNN-based recommender systems are computationally expensive and prone to forgetting.
method GraphSAIL uses a graph structure preservation strategy to update GNN models incrementally, preserving long-term preferences and properties.
result GraphSAIL reduces computation time and improves frequent updates compared to other incremental learning techniques.

Bandit problem on graphs aims to recommend items with high expected ratings.

problem Online learning problems involving graphs, such as content-based recommendation.
method Study of a bandit problem on graphs, introducing effective dimension and proposing algorithms.
result Proposed algorithms scale linearly and sublinearly in the effective dimension, improving cumulative regret.

The paper tackles a bandit problem on graphs with smooth functions, aiming to recommend items with high expected ratings.

problem Online learning problems involving graphs, such as content-based recommendation.
method Introduced the notion of effective dimension and proposed two algorithms for solving the problem.
result The algorithms can learn good estimators of user preferences from just tens of nodes evaluations.

Enhances LightGCN for credit bond recommendations with dynamic node embeddings.

problem Challenges in static embeddings for rapidly evolving user interests in finance.
method Causal graph convolution for dynamic node embeddings over chronological user-item interactions.
result Significantly enhances LightGCN performance in financial product recommendations.

In this work, we study recommendation systems modelled as contextual multi-armed bandit (MAB) problems. We propose a graph-based recommendation system that learns and exploits the geometry of the user space to create meaningful clusters in the user domain. This reduces the dimensionality of the recommendation problem w…

2018-07-31abs ↗pdf ↗

KGRL uses reinforcement learning with knowledge graphs for better interactive recommendation.

problem Achieving responsiveness and accuracy in dynamic user-item interactions.
method KGRL combines reinforcement learning and knowledge graphs, using a local knowledge network and attention mechanism.
result KGRL outperforms state-of-the-art methods in simulated and real-world environments.

FedRule uses graph neural networks to recommend rules for smart homes without centralizing data.

problem Manual rule setup for smart devices is inefficient and privacy-compromising.
method FedRule constructs user-specific graphs for rule recommendation, using federated learning to protect privacy.
result FedRule achieves comparable performance to centralized methods and outperforms others.

Recent advancements in deep neural networks for graph-structured data have led to state-of-the-art performance on recommender system benchmarks. However, making these methods practical and scalable to web-scale recommendation tasks with billions of items and hundreds of millions of users remains a challenge. Here we de…

2018-06-06abs ↗pdf ↗

A new method for multi-criteria recommender systems using graph attention networks.

problem Lack of nuanced relationships between users and items based on specific criteria.
method MDGAT, a multi-edge bipartite graph with dual attention networks and contrastive learning.
result MDGAT achieves higher accuracy in predicting item ratings compared to baseline methods.

Learning high-quality node embeddings is a key building block for machine learning models that operate on graph data, such as social networks and recommender systems. However, existing graph embedding techniques are unable to cope with fairness constraints, e.g., ensuring that the learned representations do not correla…

2019-05-25abs ↗pdf ↗

Semantic TrueLearn uses semantic graphs to improve educational recommendation systems.

problem Challenges in handling semantic and hierarchical structure in knowledge areas.
method Introduces a novel learner model that exploits semantic relatedness between knowledge components using a Wikipedia link graph.
result Achieves statistically significant improvements in predictive performance for educational engagement.

A new system recommends specific knowledge concepts in MOOCs based on student interests.

problem MOOCs recommend courses but ignore specific knowledge concepts interests.
method End-to-end graph neural network (ACKRec) that combines content and context information.
result ACKRec effectively recommends knowledge concepts to MOOC students.

CGM combines SSL and LFM for better recommendation performance.

problem Label sparsity in user-item rating matrices limits LFM performance.
method Probabilistic chain graph model (CGM) integrating Bayesian network and Markov random field.
result CGM significantly outperforms state-of-the-art approaches in recommendation.

A graph neural network detects beneficial feature interactions for recommender systems.

problem Feature interactions are crucial but not all are beneficial for recommendation accuracy.
method Graph neural network with L0 activation regularization for edge prediction.
result The model outperforms baselines and automatically identifies beneficial feature interactions.

The problem of session-based recommendation aims to predict user actions based on anonymous sessions. Previous methods model a session as a sequence and estimate user representations besides item representations to make recommendations. Though achieved promising results, they are insufficient to obtain accurate user ve…

2018-11-01abs ↗pdf ↗

Proposes a comprehensive framework for financial product lead recommendations using graph representation learning and link prediction.

problem Challenges in surface lead recommendations for financial products due to changing market scenarios and difficulty in capturing holder's mindset.
method Bi-partite graph representation of financial holders and funds, GraphSage model for learning representations, link prediction model for ranking recommendations.
result The proposed graph ML solution outperforms baseline by 42%, 22%, and 14% in hit rate for top-k recommendations (50, 100, 200) and 18%, 19%, and 18% on unseen holders.

KHGRec tackles noisy and incomplete KG-enhanced recommendations by modeling complex interactions.

problem Challenges in integrating KGs for accurate recommendations, especially in complex higher-order interactions and heterogeneous modalities.
method KHGRec uses a collaborative knowledge heterogeneous hypergraph (CKHG) to model group-wise interdependencies, employing two hypergraph encoders and attention mechanisms.
result KHGRec achieves an average 5.18% relative improvement over state-of-the-art baselines on four real-world datasets.

Enhanced recommender system using ensemble learning and graph embedding.

problem Challenges in selecting relevant data for users from large datasets.
method Group classification, ensemble learning, fuzzy rules, decision tree, graph embedding.
result High efficiency of the presented method on MovieLens datasets.

FLARKO uses LLMs, KGs, and KTO to generate profitable, behaviorally aligned financial recommendations.

problem Financial recommendation systems often fail to account for behavioral and regulatory factors.
method FLARKO integrates LLMs, KGs, and KTO to generate profitable and behaviorally aligned recommendations.
result FLARKO consistently outperforms state-of-the-art recommendation baselines on behavioral alignment and joint profitability.

Recent advancements in deep neural networks for graph-structured data have led to state-of-the-art performance on recommender system benchmarks. In this work, we present a Graph Convolutional Network (GCN) algorithm SWAG (Sample Weight and AGgregate), which combines efficient random walks and graph convolutions on weig…

2019-11-22abs ↗pdf ↗

RGCF improves collaborative filtering by refining graph convolution embeddings.

problem GCN-based recommendation models introduce noise and redundancy, limiting high-order connectivity capture.
method Developed RGCF, a new GCN-based Collaborative Filtering model with redesigned embeddings.
result RGCF significantly outperforms state-of-the-art models on public datasets.

New model recommends stocks considering individual preferences and diversification.

problem Inaccurate stock price predictions and ignoring investment theories.
method Portfolio Temporal Graph Network Recommender (PfoTGNRec) incorporating diversification-enhancing sampling.
result PfoTGNRec outperforms state-of-the-art models in real-world data.

DRGO improves graph recommendation by mitigating noisy samples and enhancing out-of-distribution generalization.

problem Noisy samples in training data diminish recommendation systems' out-of-distribution generalization.
method DRGO uses a diffusion paradigm to reduce noisy effects and entropy regularization to avoid extreme weights.
result DRGO outperforms current methods in OOD recommendation across various distribution shifts.

Interactive news recommendation has been launched and attracted much attention recently. In this scenario, user's behavior evolves from single click behavior to multiple behaviors including like, comment, share etc. However, most of the existing methods still use single click behavior as the unique criterion of judging…

2018-11-30abs ↗pdf ↗

Point-of-Interest (POI) recommendation is one of the most important location-based services helping people discover interesting venues or services. However, the extreme user-POI matrix sparsity and the varying spatio-temporal context pose challenges for POI systems, which affects the quality of POI recommendations. To …

2020-02-09abs ↗pdf ↗