Corpus ID: 3659697

Convolutional Geometric Matrix Completion

@article{Yao2018ConvolutionalGM,
  title={Convolutional Geometric Matrix Completion},
  author={Kai-Lang Yao and Wu-Jun Li},
  journal={ArXiv},
  year={2018},
  volume={abs/1803.00754}
}
  • Kai-Lang Yao, Wu-Jun Li
  • Published 2018
  • Computer Science, Mathematics
  • ArXiv
  • Geometric matrix completion~(GMC) has been proposed for recommendation by integrating the relationship~(link) graphs among users/items into matrix completion~(MC) . Traditional \mbox{GMC} methods typically adopt graph regularization to impose smoothness priors for \mbox{MC}. Recently, geometric deep learning on graphs~(\mbox{GDLG}) is proposed to solve the GMC problem, showing better performance than existing GMC methods including traditional graph regularization based methods. To the best of… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-3 OF 3 CITATIONS

    Self-Attention Graph Pooling

    VIEW 2 EXCERPTS
    CITES METHODS & BACKGROUND

    Scalable Probabilistic Matrix Factorization with Graph-Based Priors

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Collaborative Self-Attention for Recommender Systems

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 53 REFERENCES

    Graph Attention Networks

    VIEW 1 EXCERPT

    Graph Regularized Nonnegative Matrix Factorization for Data Representation

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Matrix Completion on Graphs

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL