文件名称:Message-Passing-Algorithms
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:245.13kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
一本将基于AP传播算法的半监督聚类的算方法书.对于聚类研究的很有帮助-The Uncapacitated Facility Location Prob-
lem (UFLP) is one of the most widely stud-
ied discrete location problems, whose appli-
cations arise in a variety of settings. We
tackle the UFLP using probabilistic infer-
ence in a graphical model- an approach that
has received little attention in the past. We
show that the fi xed points of max-product
linear programming (MPLP), a convexifi ed
version of the max-product algorithm, can
be used to construct a solution with a 3-
approximation guarantee for metric UFLP
instances. In addition, we characterize some
scenarios under which the MPLP solution is
guaranteed to be globally optimal. We eval-
uate the performance of both max-sum and
MPLP empirically on metric and non-metric
problems, demonstrating the advantages of
the 3-approximation construction and algo-
rithm applicability to non-metric instances.
lem (UFLP) is one of the most widely stud-
ied discrete location problems, whose appli-
cations arise in a variety of settings. We
tackle the UFLP using probabilistic infer-
ence in a graphical model- an approach that
has received little attention in the past. We
show that the fi xed points of max-product
linear programming (MPLP), a convexifi ed
version of the max-product algorithm, can
be used to construct a solution with a 3-
approximation guarantee for metric UFLP
instances. In addition, we characterize some
scenarios under which the MPLP solution is
guaranteed to be globally optimal. We eval-
uate the performance of both max-sum and
MPLP empirically on metric and non-metric
problems, demonstrating the advantages of
the 3-approximation construction and algo-
rithm applicability to non-metric instances.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Message Passing Algorithms..pdf
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.