Pages that link to "Item:Q1074273"

The following pages link to Metric methods for analyzing partially ranked data (Q1074273):

Displaying 50 items.

• Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach (Q62323) (← links)
• Estimation in exponential families on permutations (Q70429) (← links)
• A generative model for rank data based on insertion sort algorithm (Q89742) (← links)
• Ranking chain sum orders (Q290525) (← links)
• A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances (Q316726) (← links)
• Limit theorems for sequences of random trees (Q619105) (← links)
• Comparing and aggregating partially resolved trees (Q650896) (← links)
• Continuation methods for approximate large scale object sequencing (Q669313) (← links)
• Mixtures of weighted distance-based models for ranking data with applications in political studies (Q693262) (← links)
• Similarity of personal preferences: Theoretical foundations and empirical analysis (Q814460) (← links)
• Statistics for phylogenetic trees (Q849456) (← links)
• Mixtures of distance-based models for ranking data (Q951838) (← links)
• Computing distances between partial rankings (Q976084) (← links)
• Probability models on rankings (Q1184253) (← links)
• A partial ordering of rank densities (Q1190558) (← links)
• On rank statistics: An approach via metrics on the permutation group (Q1200661) (← links)
• Paired comparison, triple comparison, and ranking experiments as generalized linear models, and their implementation on GLIM (Q1205748) (← links)
• What do we know about the Metropolis algorithm? (Q1273859) (← links)
• Multidimensional medians arising from geodesics on graphs (Q1359409) (← links)
• A general theory of hypothesis testing based on rankings (Q1362176) (← links)
• On rankings generated by pairwise linear discriminant analysis of \(m\) populations (Q1364664) (← links)
• Metrics on permutations useful for positive dependence (Q1367675) (← links)
• Concordance between two linear orders: The Spearman and Kendall coefficients revisited (Q1378870) (← links)
• Group algebra of characteristic 1 and invariant distances over a finite group (Q1650201) (← links)
• Limit theorems for longest monotone subsequences in random Mallows permutations (Q1700399) (← links)
• Using extension sets to aggregate partial rankings in a flexible setting (Q1733690) (← links)
• A central limit theorem for a new statistic on permutations (Q1745671) (← links)
• Directed connection measurement for evaluating reconstructed stroke sequence in handwriting images (Q1765575) (← links)
• Nonparametric measures of dependence for biometric data studies (Q1776852) (← links)
• Generalized measures of association for ranked data with an application to prediction accuracy (Q1801914) (← links)
• The limiting normality of the test statistic for the two-sample problem induced by a convex sum distance (Q1817399) (← links)
• On the hardness of maximum rank aggregation problems (Q2018536) (← links)
• Signal processing on the permutahedron: tight spectral frames for ranked data analysis (Q2048691) (← links)
• A generalized Mallows model based on \(\phi\)-divergence measures (Q2140855) (← links)
• Covariance structure analysis of ordinal ipsative data (Q2248668) (← links)
• Geometric representation of association between categories (Q2260004) (← links)
• Prior distributions on symmetric groups (Q2260072) (← links)
• Gaussian field on the symmetric group: prediction and learning (Q2293716) (← links)
• Distance and consensus for preference relations corresponding to ordered partitions (Q2304078) (← links)
• Asymptotic properties of Lee distance (Q2312016) (← links)
• Regression trees for detecting preference patterns from rank data (Q2324255) (← links)
• The limit of the empirical measure of the product of two independent Mallows permutations (Q2330406) (← links)
• The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders (Q2392744) (← links)
• Regenerative random permutations of integers (Q2421818) (← links)
• Distance-based tree models for ranking data (Q2445618) (← links)
• Hierarchical orbital decompositions and extended decomposable distributions (Q2476139) (← links)
• Recovering a metric from its full ordinal information (Q2679599) (← links)
• Detecting the end of agreement between two long ranked lists (Q2870751) (← links)
• The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders (Q3004688) (← links)
• Agreement Among Censored Rankings Using Spearman's Footrule (Q3155359) (← links)