Random walk models for top-N recommendation task

DOI10.1631/JZUS.A0920021MaRDI QIDQ1045641zbMATHFDO

Authors Yin Zhang, Jiang-Qin Wu, Yueting Zhuang

Publication date 15 December 2009

Published in Journal of Zhejiang University. Science A (Search for Journal in Brave)

zbMATH Keywords

random walkbipartite graphsemi-supervised learningtop-\(N\) recommendation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Recommendations

• Incorporating Bayesian inference with random walk for friend recommendations
• Preference relation-based Markov random fields for recommender systems
• Why does collaborative filtering work? Transaction-based recommendation model validation and selection by analyzing bipartite random graphs
• Random walk with restart: fast solutions and applications
• Smooth neighborhood recommender systems

Cited in

(3)

• Preference relation-based Markov random fields for recommender systems
• Incorporating Bayesian inference with random walk for friend recommendations
• Design of biased random walks on a graph with application to collaborative recommendation

This page was built for publication: Random walk models for top-\(N\) recommendation task

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045641)