A Harmonic Extension Approach for Collaborative Ranking

D. Park, J. Neeman, J. Zhang, S. Sanghavi, and I. Dhillon, “Preference completion: Large-scale collaborative ranking from pairwise comparisons,” in ICML ’15: Proc. of the 32th Int. Conf. on Machine learning , 2015, pp. 1907–1916

1916

Earlier work this paper cites.

J. L. Bentley, “Multidimensional binary search trees used for associative searching,” Commun. ACM , vol. 18, no. 9, pp. 509–517, 1975

1975

Earlier work this paper cites.

D. Billsus and M. J. Pazzani, “Learning collaborative information filters,” in ICML ’98: Proc. of the 15th Int. Conf. on Machine learning , 1998, pp. 46–54

1998

Earlier work this paper cites.

J. S. Breese, D. Heckerman, and C. Kadie, “Empirical analysis of predictive algorithms for collaborative filtering,” in UAI ’98: Proc. of the 14th Conf. on Uncertainty in Artificial Intelligence , 1998, pp. 43–52

1998

Earlier work this paper cites.

G. Karypis, “Evaluation of item-based top-n recommendation algorithms,” in CIKM ’01: Proc. of the 10th Int. Conf. on Information and Knowledge Management , 2001, pp. 247–254

2001

Earlier work this paper cites.

B. Sarwar, G. Karypis, J. Konstan, and J. Riedl, “Item-based collaborative filtering recommendation algorithms,” in WWW ’01: Proc. of the 10th Int. Conf. on World Wide Web , 2001, pp. 285–295

2001

Earlier work this paper cites.

K. Järvelin and J. Kekäläinen, “Cumulated gain-based evaluation of IR techniques,” ACM Trans. Inf. Syst. , vol. 20, no. 4, pp. 422–446, 2002

2002

Earlier work this paper cites.

X. Zhu, Z. Ghahramani, and J. Lafferty, “Semi-supervised learning using gaussian fields and harmonic functions,” in ICML ’03: Proc. of the 20th Int. Conf. on Machine learning , 2003, pp. 912–919

2003

Earlier work this paper cites.

M. Deshpande and G. Karypis, “Item-based top-n recommendation algorithms,” ACM Trans. Inf. Syst. , vol. 22, no. 1, pp. 143–177, 2004

2004

Earlier work this paper cites.

S. Osher, M. Burger, D. Goldfarb, J. Xu, and W. Yin, “An iterative regularization method for total variation-based image restoration,” Multiscale Modeling & Simulation , vol. 4, no. 2, pp. 460–489, 2005

2005

Cited alongside, same era.

A. Andoni and P. Indyk, “Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions,” Commun. ACM , vol. 51, no. 1, pp. 117–122, 2008

2008

Cited alongside, same era.

A. Vedaldi and B. Fulkerson, “VLFeat: An open and portable library of computer vision algorithms,” 2008, http://www.vlfeat.org/

2008

Cited alongside, same era.

M. Muja and D. G. Lowe, “Fast approximate nearest neighbors with automatic algorithm configuration,” in VISAPP: Proc. of the Int. Conf. on Computer Vision Theory and Applications , 2009, pp. 331–340

2009

Cited alongside, same era.

Y. Zhuang, W.-S. Chin, Y.-C. Juan, and C.-J. Lin, “A fast parallel sgd for matrix factorization in shared memory systems,” in RecSys ’13: Proc. of the 7th ACM Conf. on Recommender Systems , 2013, pp. 249–256

Original

2013

Later among the works it cites.

V. Kalofolias, X. Bresson, M. Bronstein, and P. Vandergheynst, “Matrix completion on graphs,” in NIPS Workshop on “Out of the Box: Robustness in High Dimension” , 2014

2014

Later among the works it cites.

J. Lee, S. Bengio, S. Kim, G. Lebanon, and Y. Singer, “Local collaborative ranking,” in WWW ’14: Proc. of the 23rd Int. Conf. on World Wide Web , 2014, pp. 85–96

2014

Later among the works it cites.

Z. Shi and J. Sun, “Convergence of the point integral method for the poisson equation on manifolds I: the Neumann boundary,” 2014, http://arxiv.org/abs/1509.06458

Original

2014

Later among the works it cites.