Non-parametric modeling of partially ranked data
From MaRDI portal
Recommendations
- Adjacency-based regularization for partially ranked data with non-ignorable missing
- Inferring Sparse Preference Lists from Partial Information
- A nonparametric procedure for testing partially ranked data
- scientific article; zbMATH DE number 847276
- An extended Mallows model for ranked data aggregation
Cited in
(17)- Sampling and learning Mallows and generalized Mallows models under the Cayley distance
- Mallows and generalized Mallows model for matchings
- Gaussian field on the symmetric group: prediction and learning
- Adjacency-based regularization for partially ranked data with non-ignorable missing
- Antithetic and Monte Carlo kernel estimators for partial rankings
- Model-based clustering for multivariate partial ranking data
- An exponential model for infinite rankings
- Riffled independence for efficient inference with partial rankings
- Interpreting the phase spectrum in Fourier analysis of partial ranking data
- Experiments with Kemeny ranking: What works when?
- Probabilistic preference learning with the Mallows rank model
- Mallows-smoothed distribution over rankings approach for modeling choice
- A nonparametric procedure for testing partially ranked data
- Comparing machine learning algorithms by union-free generic depth
- Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings
- Estimation in exponential families on permutations
- A generative model for rank data based on insertion sort algorithm
This page was built for publication: Non-parametric modeling of partially ranked data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096200)