@inproceedings{9c300ceeac944616bed6317003e6452b,
title = "Learning probability distributions over permutations by means of Fourier coefficients",
abstract = "An increasing number of data mining domains consider data that can be represented as permutations. Therefore, it is important to devise new methods to learn predictive models over datasets of permutations. However, maintaining probability distributions over the space of permutations is a hard task since there are n! permutations of n elements. The Fourier transform has been successfully generalized to functions over permutations. One of its main advantages in the context of probability distributions is that it compactly summarizes approximations to functions by discarding high order marginals information. In this paper, we present a method to learn a probability distribution that approximates the generating distribution of a given sample of permutations. In particular, this method learns the Fourier domain information representing this probability distribution.",
keywords = "Probabilistic modeling, learning, permutation, ranking",
author = "Ekhine Irurozki and Borja Calvo and Lozano, \{Jose A.\}",
year = "2011",
month = jan,
day = "1",
doi = "10.1007/978-3-642-21043-3\_22",
language = "English",
isbn = "9783642210426",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "186--191",
booktitle = "Advances in Artificial Intelligence - 24th Canadian Conference on Artificial Intelligence, Canadian AI 2011, Proceedings",
}