Fetching the paper…
Reading the bibliography…
We propose an inductive matrix completion model without using side information.
A new status index derived from sociometric analysis
Leo Katz · 1953
Earlier work this paper cites.
Movielens unplugged: experiences with an occasionally connected recommender system
Bradley N Miller, Istvan Albert, Shyong K Lam, Joseph A Konstan, and John Riedl · 2003
Earlier work this paper cites.
Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions
Gediminas Adomavicius and Alexander Tuzhilin · 2005
Earlier work this paper cites.
Link prediction approach to collaborative filtering
Hsinchun Chen, Xin Li, and Zan Huang · 2005
Earlier work this paper cites.
The link-prediction problem for social networks
David Liben-Nowell and Jon Kleinberg · 2007
Earlier work this paper cites.
Restricted boltzmann machines for collaborative filtering
Ruslan Salakhutdinov, Andriy Mnih, and Geoffrey Hinton · 2007
Earlier work this paper cites.
Collaborative filtering recommender systems
J Ben Schafer, Dan Frankowski, Jon Herlocker, and Shilad Sen · 2007
Earlier work this paper cites.
Bipartite network projection and personal recommendation
Tao Zhou, Jie Ren, Matúš Medo, and Yi-Cheng Zhang · 2007
Earlier work this paper cites.
Probabilistic matrix factorization
Andriy Mnih and Ruslan R Salakhutdinov · 2008
Earlier work this paper cites.
Exact matrix completion via convex optimization
Emmanuel J Candès and Benjamin Recht · 2009
Earlier work this paper cites.
Matrix factorization techniques for recommender systems
Yehuda Koren, Robert Bell, and Chris Volinsky · 2009
Earlier work this paper cites.
The graph neural network model
Franco Scarselli, Marco Gori, Ah Chung Tsoi, Markus Hagenbuchner, and Gabriele Monfardini · 2009
Earlier work this paper cites.
A matrix factorization technique with trust propagation for recommendation in social networks
Mohsen Jamali and Martin Ester · 2010
Earlier work this paper cites.
A comprehensive survey of neighborhood-based recommendation methods
Christian Desrosiers and George Karypis · 2011
Earlier work this paper cites.
The yahoo! music dataset and kdd-cup’11
Gideon Dror, Noam Koenigstein, Yehuda Koren, and Markus Weimer · 2011
Earlier work this paper cites.
Content-based recommender systems: State of the art and trends
Pasquale Lops, Marco De Gemmis, and Giovanni Semeraro · 2011
Cited alongside, same era.
Recommender systems with social regularization
Hao Ma, Dengyong Zhou, Chao Liu, Michael R Lyu, and Irwin King · 2011
Cited alongside, same era.
Recommender systems survey
Jesús Bobadilla, Fernando Ortega, Antonio Hernando, and Abraham Gutiérrez · 2013
Cited alongside, same era.
Spectral networks and locally connected networks on graphs
Joan Bruna, Wojciech Zaremba, Arthur Szlam, and Yann LeCun · 2013
Cited alongside, same era.
Provable inductive matrix completion
Prateek Jain and Inderjit S Dhillon · 2013
Cited alongside, same era.
Semi-supervised classification with graph convolutional networks
Thomas N Kipf and Max Welling · 2016
Later among the works it cites.
Learning convolutional neural networks for graphs
Mathias Niepert, Mohamed Ahmed, and Konstantin Kutzkov · 2016
Later among the works it cites.
A neural autoregressive approach to collaborative filtering
Yin Zheng, Bangsheng Tang, Wenkui Ding, and Hanning Zhou · 2016
Later among the works it cites.
Graph convolutional matrix completion
Rianne van den Berg, Thomas N Kipf, and Max Welling · 2017
Later among the works it cites.
Inductive representation learning on large graphs
Will Hamilton, Zhitao Ying, and Jure Leskovec · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Xin Li and Hsinchun Chen · 2013
Cited alongside, same era.
Speedup matrix completion with side information: Application to multi-label learning
Miao Xu, Rong Jin, and Zhi-Hua Zhou · 2013
Cited alongside, same era.
Vassilis Kalofolias, Xavier Bresson, Michael Bronstein, and Pierre Vandergheynst · 2014
Cited alongside, same era.
Adam: A method for stochastic optimization
Diederik P Kingma and Jimmy Ba · 2014
Cited alongside, same era.
Convolutional networks on graphs for learning molecular fingerprints
David K Duvenaud, Dougal Maclaurin, Jorge Iparraguirre, Rafael Bombarell, Timothy Hirzel, Alán Aspuru-Guzik, and Ryan P Adams · 2015
Cited alongside, same era.
Neural network matrix factorization
Gintare Karolina Dziugaite and Daniel M Roy · 2015
Cited alongside, same era.
Gated graph sequence neural networks
Yujia Li, Daniel Tarlow, Marc Brockschmidt, and Richard Zemel · 2015
Cited alongside, same era.
Geometric matrix completion with recurrent multi-graph neural networks
Federico Monti, Michael Bronstein, and Xavier Bresson · 2017
Later among the works it cites.
Weisfeiler-lehman neural machine for link prediction
Muhan Zhang and Yixin Chen · 2017
Later among the works it cites.
Deep models of interactions across sets
Jason Hartford, Devon Graham, Kevin Leyton-Brown, and Siamak Ravanbakhsh · 2018
Later among the works it cites.
Deeper insights into graph convolutional networks for semi-supervised learning
Qimai Li, Zhichao Han, and Xiao-Ming Wu · 2018
Later among the works it cites.
Modeling relational data with graph convolutional networks
Michael Schlichtkrull, Thomas N Kipf, Peter Bloem, Rianne Van Den Berg, Ivan Titov, and Max Welling · 2018
Later among the works it cites.
How powerful are graph neural networks?
Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka · 2018
Later among the works it cites.
Link prediction based on graph neural networks
Muhan Zhang and Yixin Chen · 2018
Later among the works it cites.
An end-to-end deep learning architecture for graph classification
Muhan Zhang, Zhicheng Cui, Marion Neumann, and Yixin Chen · 2018
Later among the works it cites.
Spectral collaborative filtering
Lei Zheng, Chun-Ta Lu, Fei Jiang, Jiawei Zhang, and Philip S Yu · 2018
Later among the works it cites.
Fast graph representation learning with PyTorch Geometric
Matthias Fey and Jan E. Lenssen · 2019
Closest in time.