Skip to main content

Learning Probability Distributions over Permutations by Means of Fourier Coefficients

  • Conference paper
  • 1657 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6657))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Diaconis, P.: Group representations in probability and statistics. Institute of Matematical Statistics (1988)

    Google Scholar 

  2. Fligner, M.A., Verducci, J.S.: Distance based ranking models. Journal of the Royal Statistical Society 48(3), 359–369 (1986)

    MATH  Google Scholar 

  3. Helmbold, D.P., Warmuth, M.K.: Learning permutations with exponential weights. Journal of Machine Learning Research (JMLR) 10, 1705–1736 (2009)

    MATH  Google Scholar 

  4. Huang, J., Guestrin, C.: Learning hierarchical riffle independent groupings from rankings. In: International Conference on Machine Learning (ICML 2010), Haifa, Israel (June 2010)

    Google Scholar 

  5. Huang, J., Guestrin, C., Guibas, L.: Fourier theoretic probabilistic inference over permutations. Journal of Machine Learning Research (JMLR) 10, 997–1070 (2009)

    MATH  Google Scholar 

  6. Jagabathula, S., Shah, D.: Inferring rankings under constrained sensing. In: Advances in Neural Information Processing Systems 21, Proceedings of the Twenty-Second Annual Conference on Neural Information Processing Systems, Vancouver, British Columbia, Canada, pp. 753–760 (2008)

    Google Scholar 

  7. Kondor, R., Howard, A., Jebara, T.: Multi-object tracking with representations of the symmetric group. In: Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, San Juan, Puerto Rico (March 2007)

    Google Scholar 

  8. Serre, J.P.: Linear Representations in Finite Groups. Springer, Heidelberg (1977)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Irurozki, E., Calvo, B., Lozano, J.A. (2011). Learning Probability Distributions over Permutations by Means of Fourier Coefficients. In: Butz, C., Lingras, P. (eds) Advances in Artificial Intelligence. Canadian AI 2011. Lecture Notes in Computer Science(), vol 6657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21043-3_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21043-3_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21042-6

  • Online ISBN: 978-3-642-21043-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics