Reversed CF: A fast collaborative filtering algorithm using a k-nearest neighbor graph

作者：

Highlights：

• We present a fast collaborative filtering algorithm which uses a k-NN graph.

• We apply a fast k-NN graph construction algorithm known as greedy filtering.

• We show that our approach significantly reduces the elapsed time.

• Our approach outperforms traditional collaborative filtering algorithms.

• Our approach reverses the process of finding k neighbors.

摘要

•We present a fast collaborative filtering algorithm which uses a k-NN graph.•We apply a fast k-NN graph construction algorithm known as greedy filtering.•We show that our approach significantly reduces the elapsed time.•Our approach outperforms traditional collaborative filtering algorithms.•Our approach reverses the process of finding k neighbors.

论文关键词：Reversed CF,Collaborative filtering,k-Nearest neighbor graph,Greedy filtering

论文评审过程：Available online 10 January 2015.

论文官网地址：https://doi.org/10.1016/j.eswa.2015.01.001