GNNRank: learning global rankings from pairwise comparisons via directed graph neural networks
Recovering global rankings from pairwise comparisons has wide applications from time synchronization to sports team ranking. Pairwise comparisons corresponding to matches in a competition can be construed as edges in a directed graph (digraph), whose nodes represent e.g. competitors with an unknown...
Principais autores: | He, Y, Gan, Q, Wipf, D, Reinert, G, Yan, J, Cucuringu, M |
---|---|
Formato: | Conference item |
Idioma: | English |
Publicado em: |
Journal of Machine Learning Research
2022
|
Registros relacionados
-
Ranking and synchronization from pairwise measurements via SVD
por: d'Aspremont, A, et al.
Publicado em: (2021) -
Rank Centrality: Ranking from Pairwise Comparisons
por: Negahban, Sahand, et al.
Publicado em: (2017) -
Sync-Rank: Robust ranking, constrained ranking and rank aggregation via eigenvector and SDP synchronization
por: Cucuringu, M
Publicado em: (2016) -
Ranking Alternatives by Pairwise Comparisons Matrix and Priority Vector
por: Ramík Jaroslav
Publicado em: (2017-12-01) -
MSGNN: a spectral graph neural network based on a novel magnetic signed Laplacian
por: He, Y, et al.
Publicado em: (2022)