图 书 馆
加权双向匹配的一致结构化估计Consistent Structured Estimation for Weighted Bipartite Matching |
|
| 课程网址: | http://videolectures.net/aml08_caetano_csewbm/ |
| 主讲教师: | Julian McAuley; James Petterson; Tibério Caetano |
| 开课单位: | 澳大利亚信息通信技术研究中心 |
| 开课时间: | 2008-12-20 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Given a weighted bipartite graph, the assignment problem consists of finding the heaviest perfect match. This is a classical problem in combinatorial optimization, which is solvable exactly and efficiently by standard methods such as the Hungarian algorithm, and is widely applicable in real-world scenarios. We give an exponential family model for the assignment problem. Edge weights are obtained from a suitable composition of edge features and a parameter vector, which is learned so as to maximize the likelihood of a sample consisting of training graphs and their labeled matches. The resulting consistent estimator contrasts with existing max-margin structured estimators, which are inconsistent for this problem. |
| 关 键 词: | 计算机算法; 参数向量; 样本组成 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2021-05-15：yumf |
| 阅读次数: | 51 |