Learning hierarchical riffle independent groupings from rankings

ICML 2010 - Proceedings, 27th International Conference on Machine Learning

Volumn , Issue , 2010, Pages 455-462

  Huang, Jonathan ^a   Guestrin, Carlos ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED METHODS; DATA SETS; DISJOINT SETS; FULL RANKING; INDEPENDENCE MODELS; PREFERENCE RANKING; TRAINING SETS;

CLUSTERING ALGORITHMS;

LEARNING SYSTEMS;

EID: 77956523231     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. Chechetka, A. and Guestrin, C. Efficient principled learning of thin junction trees. In Advances in Neural Information Processing Systems 21, 2007.
2. Diaconis, P. A generalization of spectral analysis with application to ranked data. The Annals of Statistics, 17 (3):949-979, 1989.
3. Gallo, G., Longo, G., Pallottino, S. and Nguyen, S. Directed hypergraphs and applications. Discrete Applied Math., 42(2-3), 1993.
4. Gormley, C. and Murphy, B. A latent space model for rank data. In 23rd International Conference on Machine Learning, 2006.
5. HöfFgen, K. U. Learning and robust learning of product distributions. In Sixth Annual Conference on Learning Theory, 1993.
6. Huang, J. and Guestrin, C. Riffled independence for ranked data. In Advances in Neural Information Processing Systems 23, 2009.
7. Huang, J., Guestrin, C., Jiang, X. and Guibas, L. Exploiting probabilistic independence for permutations. In Artificial Intelligence and Statistics, JMLR W&CP 5, 2009.
8. Motwani, R. and Raghavan, P. Randomized algorithms. ACM Computational Survey, 28(1), 1996.
9. Shi, J. and Malik, J. Normalized cuts and image segmentation. IEEE Transactions in Pattern Analysis and Machine Intelligence, 22(8), 2000.