PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Ranking in the algebra of the symmetric group
Risi Kondor and Marconi Barbosa
In: NIPS 2009, 7-12 Dec 2009, Vancouver, Canada.

Abstract

Ranking is hard because implicitly it involves manipulating n!-dimensional vectors. We show that if each training example only involves k out of the n objects to be ranked, then by Fourier analysis on the ranking vectors we can reduce the dimensionality of the problem to O(n^{2k}). Moreover, with respect to a natural class of kernels on permutations the inner product between two ranking vectors can be computed in O((2k)^{2k+2}) time. We demonstrate these results by experiments using "SnOB" on real-world data.

Other (plain text)
EPrint Type:Conference or Workshop Item (Speech)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Computational, Information-Theoretic Learning with Statistics
Learning/Statistics & Optimisation
Theory & Algorithms
ID Code:5836
Deposited By:Wray Buntine
Deposited On:08 March 2010