Exponential family graph matching and ranking
Petterson, James; Caetano, Tiberio; McAuley, Julian; Yu, Jin
Description
We present a method for learning max-weight matching predictors in bipartite graphs. The method consists of performing maximum a posteriori estimation in exponential families with sufficient statistics that encode permutations and data features. Although
| Collections | ANU Research Publications |
|---|---|
| Date published: | 2009 |
| Type: | Conference paper |
| URI: | http://hdl.handle.net/1885/56853 |
| Source: | Proceedings of The 23rd Annual Conference on Neural Information Processing Systems (NIPS 23) |
Download
| File | Description | Size | Format | Image |
|---|---|---|---|---|
| 01_Petterson_Exponential_family_graph_2009.pdf | 638.52 kB | Adobe PDF | Request a copy | |
| 02_Petterson_Exponential_family_graph_2009.pdf | 17.51 kB | Adobe PDF | Request a copy |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator
+61 2 6125 5111
The Australian National University, Canberra
CRICOS Provider : 00120C
ABN : 52 234 063 906
