Learning Probability Distributions over Permutations by Means of Fourier Coefficients
暂无分享,去创建一个
[1] Leonidas J. Guibas,et al. Exploiting Probabilistic Independence for Permutations , 2009, AISTATS.
[2] P. Diaconis. Group representations in probability and statistics , 1988 .
[3] Devavrat Shah,et al. Inferring rankings under constrained sensing , 2008, NIPS.
[4] Jeff A. Bilmes,et al. Consensus ranking under the exponential model , 2007, UAI.
[5] Manfred K. Warmuth,et al. Learning Permutations with Exponential Weights , 2007, COLT.
[6] Fabio Crestani,et al. Ranking Sequential Patterns with Respect to Significance , 2010, PAKDD.
[7] Carlos Guestrin,et al. Learning Hierarchical Riffle Independent Groupings from Rankings , 2010, ICML.
[8] Randall R. Holmes. Linear Representations of Finite Groups , 2008 .
[9] M. Fligner,et al. Distance Based Ranking Models , 1986 .
[10] Tony Jebara,et al. Multi-object tracking with representations of the symmetric group , 2007, AISTATS.
[11] Carlos Guestrin,et al. Riffled Independence for Ranked Data , 2009, NIPS.
[12] Michael I. Jordan,et al. On the Consistency of Ranking Algorithms , 2010, ICML.
[13] Risi Kondor,et al. Snob : a C++ toolkit for fast Fourier transforms on the symmetric , 2006 .
[14] Risi Kondor,et al. Ranking with Kernels in Fourier space. , 2010, COLT 2010.
[15] Leonidas J. Guibas,et al. Fourier Theoretic Probabilistic Inference over Permutations , 2009, J. Mach. Learn. Res..