Reliable graph-based collaborative ranking

DOI10.1016/J.INS.2017.11.060MaRDI QIDQ781894zbMATH OpenOpenAlexFDO

Authors Bita Shams, Saman Haratizadeh

Publication date 20 July 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1811.01211

zbMATH Keywords

heterogeneous networkscollaborative rankingmeta-path analysisneighborhood recommendationpairwise preferences

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Abstract: GRank is a recent graph-based recommendation approach the uses a novel heterogeneous information network to model users' priorities and analyze it to directly infer a recommendation list. Unfortunately, GRank neglects the semantics behind different types of paths in the network and during the process, it may use unreliable paths that are inconsistent with the general idea of similarity in neighborhood collaborative ranking. That negligence undermines the reliability of the recommendation list generated by GRank. This paper seeks to present a novel framework for reliable graph-based collaborative ranking, called ReGRank, that ranks items based on reliable recommendation paths that are in harmony with the semantics behind different approaches in neighborhood collaborative ranking. To our knowledge, ReGRank is the first unified framework for neighborhood collaborative ranking that in addition to traditional user-based collaborative ranking, can also be adapted for preference-based and representative-based collaborative ranking as well. Experimental results show that ReGRank significantly improves the state-of-the art neighborhood and graph-based collaborative ranking algorithms.

Recommendations

• Online collaborative filtering on graphs
• Learning to rank on graphs
• Scalable Collaborative Ranking for Personalized Prediction
• A reliably weighted collaborative filtering system
• An efficient algorithm for learning to rank from preference graphs

Cites work

• Improving maximum margin matrix factorization
• Sibrank: signed bipartite network analysis for neighbor-based collaborative ranking

Cited in

(5)

• Collaborative Rankings
• GLIMG: global and local item graphs for top-N recommender systems
• Item enhanced graph collaborative network for collaborative filtering recommendation
• Sibrank: signed bipartite network analysis for neighbor-based collaborative ranking
• Exploiting Positive and Negative Graded Relevance Assessments for Content Recommendation

Describes a project that uses

Uses Software

• PathRank
• EigenRank
• WSRank
• VSRank
• CLiMF
• SibRank
• CARES

This page was built for publication: Reliable graph-based collaborative ranking

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