Corpus ID: 168169726

Graph DNA: Deep Neighborhood Aware Graph Encoding for Collaborative Filtering

@article{Wu2020GraphDD,
  title={Graph DNA: Deep Neighborhood Aware Graph Encoding for Collaborative Filtering},
  author={Liwei Wu and Hsiang-Fu Yu and Nikhil S. Rao and J. Sharpnack and Cho-Jui Hsieh},
  journal={ArXiv},
  year={2020},
  volume={abs/1905.12217}
}
In this paper, we consider recommender systems with side information in the form of graphs. Existing collaborative filtering algorithms mainly utilize only immediate neighborhood information and have a hard time taking advantage of deeper neighborhoods beyond 1-2 hops. The main caveat of exploiting deeper graph information is the rapidly growing time and space complexity when incorporating information from these neighborhoods. In this paper, we propose using Graph DNA, a novel Deep Neighborhood… Expand
Advances in Collaborative Filtering and Ranking
  • Liwei Wu
  • Computer Science, Mathematics
  • ArXiv
  • 2020
TLDR
This dissertation, covering some recent advances in collaborative filtering and ranking, introduces personalization for the state-of-the-art sequential recommendation model with the help of SSE and discusses the new regularization technique Stochastic Shared Embeddings. Expand
Temporal Collaborative Ranking Via Personalized Transformer
TLDR
A Personalized Transformer (SSE-PT) model, inspired by the popular Transformer model in natural languages processing, which can handle extremely long sequences and outperform SASRec in ranking results with comparable training speed, striking a balance between performance and speed requirements. Expand
SSE-PT: Sequential Recommendation Via Personalized Transformer
TLDR
A Personalized Transformer (SSE-PT) model, outperforming SASRec by almost 5% in terms of NDCG@10 on 5 real-world datasets, and can handle extremely long sequences and outperform SASRec in ranking results with comparable training speed, striking a balance between performance and speed requirements. Expand
Pure Exploration in Multi-armed Bandits with Graph Side Information
TLDR
This work proposes a novel algorithm GRUB (GRaph based UcB) for the best arm (and near-best arm) identification problem in the fixed confidence setting and provides a theoretical characterization of its performance that elicits the benefit of the graph-side information. Expand
Trust in Recommender Systems: A Deep Learning Perspective
TLDR
This survey provides a systemic summary of three categories of trust-aware recommender systems: social-awareRecommender systems that leverage users' social relationships; robust recommender Systems that filter untruthful noises or enhance attack resistance; explainable recommender system that provide explanations of recommended items. Expand
Survey for Trust-aware Recommender Systems: A Deep Learning Perspective
TLDR
This survey provides a systemic summary of three categories of trust-aware recommender systems: social-awareRecommender systems that leverage users' social relationships; robust recommender Systems that filter untruthful noises or enhance attack resistance; explainable recommender system that provide explanations of recommended items. Expand
Bipartite Dynamic Representations for Abuse Detection
Abusive behavior in online retail websites and communities threatens the experience of regular community members. Such behavior often takes place within a complex, dynamic, and large-scale network ofExpand

References

SHOWING 1-10 OF 50 REFERENCES
Representation Learning on Graphs: Methods and Applications
TLDR
A conceptual review of key advancements in this area of representation learning on graphs, including matrix factorization-based methods, random-walk based algorithms, and graph neural networks are provided. Expand
A recommender system based on local random walks and spectral methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, we observe the use ofExpand
Collaborative Filtering with Graph Information: Consistency and Scalable Methods
TLDR
This work formulate and derive a highly efficient, conjugate gradient based alternating minimization scheme that solves optimizations with over 55 million observations up to 2 orders of magnitude faster than state-of-the-art (stochastic) gradient-descent based methods. Expand
Edge-Weighted Personalized PageRank: Breaking A Decade-Old Performance Barrier
TLDR
This paper describes the first fast algorithm for computing PageRank on general graphs when the edge weights are personalized, which is based on model reduction and outperforms existing methods by nearly five orders of magnitude. Expand
Inductive Representation Learning on Large Graphs
TLDR
GraphSAGE is presented, a general, inductive framework that leverages node feature information (e.g., text attributes) to efficiently generate node embeddings for previously unseen data and outperforms strong baselines on three inductive node-classification benchmarks. Expand
GraRep: Learning Graph Representations with Global Structural Information
TLDR
A novel model for learning vertex representations of weighted graphs that integrates global structural information of the graph into the learning process and significantly outperforms other state-of-the-art methods in such tasks. Expand
Geometric Matrix Completion with Recurrent Multi-Graph Neural Networks
TLDR
This paper proposes a novel approach to overcome limitations of matrix completion techniques by using geometric deep learning on graphs, and applies this method on both synthetic and real datasets, showing that it outperforms state-of-the-art techniques. Expand
Graph Convolutional Neural Networks for Web-Scale Recommender Systems
TLDR
A novel method based on highly efficient random walks to structure the convolutions and a novel training strategy that relies on harder-and-harder training examples to improve robustness and convergence of the model are developed. Expand
node2vec: Scalable Feature Learning for Networks
TLDR
In node2vec, an algorithmic framework for learning continuous feature representations for nodes in networks, a flexible notion of a node's network neighborhood is defined and a biased random walk procedure is designed, which efficiently explores diverse neighborhoods. Expand
DeepWalk: online learning of social representations
TLDR
DeepWalk is an online learning algorithm which builds useful incremental results, and is trivially parallelizable, which make it suitable for a broad class of real world applications such as network classification, and anomaly detection. Expand
...
1
2
3
4
5
...