资源分类
》 资源 》论文》Recursive Inversion Models for Permutations

Recursive Inversion Models for Permutations

2020-01-19 | |  141 |   113 |   0

Abstract

We develop a new exponential family probabilistic model for permutations that can capture hierarchical structure and that has the Mallows and generalized Mallows models as subclasses. We describe how to do parameter estimation and propose an approach to structure search for this class of models. We provide experimental evidence that this added flexibility both improves predictive performance and enables a deeper understanding of collections of permutations.

上一篇：Automated Variational Inference for Gaussian Process Models

下一篇：A Drifting-Games Analysis for Online Learning and Applications to Boosting

用户评价
全部评价

热门资源

  • Regularizing RNNs...

    Recently, caption generation with an encoder-de...

  • Deep Cross-media ...

    Cross-media retrieval is a research hotspot in ...

  • Learning Expressi...

    Facial expression is temporally dynamic event w...

  • Compact MDDs for ...

    Pseudo-Boolean (PB) constraints are usually en...

  • Attributed Graph ...

    Graph clustering is a fundamental task which di...