Uncovering the riffled independence structure of ranked data

DOI10.1214/12-EJS670zbMath1272.68389OpenAlexW2043401444MaRDI QIDQ1950813

Carlos Guestrin, Jonathan Huang

Publication date: 28 May 2013

Published in: Electronic Journal of Statistics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.ejs/1328537355

zbMATH Keywords

permutationsrankingsprobabilistic modelingstructure learninggroup theoretic methodsriffled independence

Mathematics Subject Classification ID

Combinatorial probability (60C05) Reasoning under uncertainty in the context of artificial intelligence (68T37) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)

Related Items (3)

Recursive inversion models for permutations ⋮ Uncovering the riffled independence structure of ranked data ⋮ Mallows and generalized Mallows model for matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Trailing the dovetail shuffle to its lair
• A generalization of spectral analysis with application to ranked data
• Directed hypergraphs and applications
• Uncovering the riffled independence structure of ranked data
• NON-NULL RANKING MODELS. I
• Content Modeling Using Latent Permutations
• Fast Fourier Transforms for Symmetric Groups: Theory and Implementation
• The efficient computation of Fourier transforms on the symmetric group
• Inferring Rankings Using Constrained Sensing
• Multistage Ranking Models

This page was built for publication: Uncovering the riffled independence structure of ranked data