Learning to Rank in Entity Relationship Graphs

DOI10.1287/IJOC.2018.0837MaRDI QIDQ5139624zbMATH OpenOpenAlexWikidataFDO

Authors Louiqa Raschid, Hassan Sayyadi, Vagelis Hristidis

Publication date 9 December 2020

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.2018.0837

zbMATH Keywords

learning to rankauthority flow rankingentity relationship graphsObjectRank

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Learning to rank in vector spaces and social networks
• Learning to rank on graphs
• An efficient algorithm for learning to rank from preference graphs
• Ranking as function approximation
• The framework of manifold regularization of ranking on graphs

Cites work

• scientific article; zbMATH DE number 5296741 (Why is no real title available?)
• A vector space model for automatic indexing
• Authoritative sources in a hyperlinked environment
• Introduction to Information Retrieval
• Message-passing algorithms for inference and optimization
• Relational retrieval using a combination of path-constrained random walks
• Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments

Cited in

(2)

• Learning to rank: a ROC-based graph-theoretic approach
• Graph neural networks-based preference learning method for object ranking

This page was built for publication: Learning to Rank in Entity Relationship Graphs

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