Spectral ranking using seriation
From MaRDI portal
Recommendations
- Distributed spectral pairwise ranking algorithms
- A generalization of spectral analysis with application to ranked data
- Ranking Methods for Compositional Data
- RANKINGS GENERATED BY SPHERICAL DISCRIMINANT ANALYSIS
- scientific article; zbMATH DE number 2209407
- Spectral method and regularized MLE are both optimal for top-\(K\) ranking
Cited in
(20)- Recovering the structure of random linear graphs
- Ranking recovery from limited pairwise comparisons using low-rank matrix completion
- Ranking with Hamiltonian dynamics
- Reconstruction of line-embeddings of graphons
- Cut norm discontinuity of triangular truncation of graphons
- Perfect elimination orderings for symmetric matrices
- Spectral method and regularized MLE are both optimal for top-\(K\) ranking
- Deformed Laplacians and spectral ranking in directed networks
- A Signal Processing Approach to Fourier Analysis of Ranking Data: The Importance of Phase
- Ranking and synchronization from pairwise measurements via SVD
- An optimization parameter for seriation of noisy data
- Lead-lag detection and network clustering for multivariate time series with an application to the us equity market
- Graph sequences sampled from Robinson graphons
- Learning low-dimensional nonlinear structures from high-dimensional noisy data: an integral operator approach
- Modules in Robinson Spaces
- Stochastic iterative methods for online rank aggregation from pairwise comparisons
- Robust recovery of Robinson property in L^p-graphons: a cut-norm approach
- Improved theoretical guarantee for rank aggregation via spectral method
- Two simple but efficient algorithms to recognize Robinson dissimilarities
- Robust Detection of Lead-Lag Relationships in Lagged Multi-Factor Models
This page was built for publication: Spectral ranking using seriation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2810911)
