A multi-class approach for ranking graph nodes: models and experiments with incomplete data
Gianna M. Del Corso, Francesco Romani

TL;DR
This paper introduces models and algorithms for ranking nodes in multi-parameter graphs, addressing stability, convergence, and robustness with incomplete data, applicable across various network types.
Contribution
It presents new models and numerical algorithms for multi-parameter graph ranking, analyzing their stability, convergence, and robustness with incomplete data.
Findings
Models achieve up to 60% correlation with full data rankings using only 10% of attribute links.
Algorithms are fast, stable, and adaptable to different network types.
Robustness analysis shows effective ranking even with incomplete data.
Abstract
After the phenomenal success of the PageRank algorithm, many researchers have extended the PageRank approach to ranking graphs with richer structures beside the simple linkage structure. In some scenarios we have to deal with multi-parameters data where each node has additional features and there are relationships between such features. This paper stems from the need of a systematic approach when dealing with multi-parameter data. We propose models and ranking algorithms which can be used with little adjustments for a large variety of networks (bibliographic data, patent data, twitter and social data, healthcare data). In this paper we focus on several aspects which have not been addressed in the literature: (1) we propose different models for ranking multi-parameters data and a class of numerical algorithms for efficiently computing the ranking score of such models, (2) by analyzing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
