专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20120004925A1 HEALTH CARE POLICY DEVELOPMENT AND EXECUTION 审中-公开
标题翻译：卫生政策发展与执行
公开(公告)号：US20120004925A1
公开(公告)日：2012-01-05
申请号：US12828055
申请日：2010-06-30
申请人： Mark Braverman , Mohsen Bayati , Eric Horvitz , Michael Gillam
发明人： Mark Braverman , Mohsen Bayati , Eric Horvitz , Michael Gillam
IPC分类号： G06Q50/00 , G06F15/18 , G06N5/02 , G06Q10/00
CPC分类号： G06Q10/00 , G06F19/325 , G06Q50/22 , G16H10/20 , G16H50/50
摘要： Technology is described for developing health care policies for use in a health care facility. In one example method, a health care policy can be applied in a health care software application and stored in a health care database. A correlated feature set can be correlated to the health care policy being developed. A selection of health care cases can be obtained from the health care database for testing the health care policy. A model can predict a defined effect of the health care policy based on the correlated feature set. A cost of implementing the health care policy on a defined percentage of patients can be predicted using the defined effect by the model and a specified predictor by applying statistical analysis. The system can guide the allocation of resources in a patient-specific manner. The policies can also be applied in conjunction with user models to guide alerting.
摘要翻译：描述了用于制定医疗保健设施中使用的保健政策的技术。在一个示例性方法中，医疗保健政策可以应用于医疗保健软件应用并存储在医疗保健数据库中。相关特征集可以与正在开发的医疗保健政策相关联。卫生保健数据库可以提供一系列医疗保健案例，用于测试医疗保健政策。模型可以基于相关特征集来预测医疗保健政策的定义效果。通过应用统计分析，可以使用模型和指定预测因子的定义效应来预测在确定百分比的患者中实施医疗保健政策的成本。该系统可以以患者特定的方式指导资源的分配。这些策略也可以与用户模型一起应用于指导警报。

2. 发明申请

US20100198685A1 PREDICTING WEB ADVERTISEMENT CLICK SUCCESS BY USING HEAD-TO-HEAD RATINGS 审中-公开
标题翻译：通过使用头对头评分来预测网页广告点击成功
公开(公告)号：US20100198685A1
公开(公告)日：2010-08-05
申请号：US12362492
申请日：2009-01-30
申请人： Mohsen Bayati , Mark Braverman , Satyen Chandrakant Kale , Yury Makarychev
发明人： Mohsen Bayati , Mark Braverman , Satyen Chandrakant Kale , Yury Makarychev
IPC分类号： G06Q30/00 , G06F7/06 , G06F17/30
CPC分类号： G06Q30/02 , G06Q30/0254
摘要： Described is a paid search advertising technology in which ratings values are computed for advertisements (or other web content items) based upon head-to-head evaluations as to which advertisement or advertisements were selected (clicked) from among a set of advertisements that were shown together. Records of a query log contain data of advertisements that were shown together, and each advertisement of those shown together that was clicked. Pairs of advertisements are selected, with the rating value of an advertisement that was clicked increased, and the rating value of the non-clicked advertisement decreased. Only those pairs in which one advertisement was selected and another was not selected may be used as a pair. Elo ratings formulas may be employed for the increasing and decreasing computations. The rating values may be combined with other prediction results into a combined result used to select and/or rank advertisements for returning with a query response.
摘要翻译：描述了一种付费搜索广告技术，其中基于对所显示的一组广告中选择（点击）哪个广告或广告的头对头评估来计算广告（或其他网页内容项）的评级值。一起。查询日志的记录包含一起显示的广告的数据，以及被点击的那些一起显示的广告的每个广告。选择一对广告，点击广告的评级值增加，非点击广告的评级值下降。只有那些选择了一个广告并且没有选择另一个广告的对可能被用作一对。 Elo评级公式可用于增加和减少计算。评级值可以与其他预测结果组合成用于选择和/或排序广告以用于返回查询响应的组合结果。

3. 发明申请

US20090222782A1 NETWORK ANALYSIS WITH STEINER TREES 有权
标题翻译：网络分析与STEINER TREES
公开(公告)号：US20090222782A1
公开(公告)日：2009-09-03
申请号：US12147536
申请日：2008-06-27
申请人： Mohsen Bayati , Christian H. Borgs , Alfredo Braunstein , Jennifer T. Chayes , Riccardo Zecchina
发明人： Mohsen Bayati , Christian H. Borgs , Alfredo Braunstein , Jennifer T. Chayes , Riccardo Zecchina
IPC分类号： G06F17/50
CPC分类号： G06F17/509 , G06F2217/10 , H04L41/12 , H04L45/14
摘要： Networks may be analyzed using Steiner trees. In an example embodiment, a method includes acts of receiving, accepting, creating, and analyzing. Data specifying a network is received. Steiner tree parameters are accepted. A Steiner tree model is created on the data specifying the network responsive to the Steiner tree parameters. The Steiner tree model includes a local representation having a depth constraint for neighborhood vertices. The data specifying the network is analyzed to ascertain a Steiner tree solution based on the Steiner tree model, which includes the local representation, and using a locally-oriented combinatorial algorithm.
摘要翻译：可以使用Steiner树分析网络。在示例实施例中，一种方法包括接收，接受，创建和分析的动作。接收到指定网络的数据。 Steiner树参数被接受。在指定网络的数据上创建Steiner树模型，响应于Steiner树参数。 Steiner树模型包括具有邻近顶点深度约束的局部表示。分析指定网络的数据，以确定基于包括本地表示的Steiner树模型以及使用面向局部组合算法的Steiner树解决方案。

4. 发明授权

US07885269B2 Network analysis with Steiner trees 有权
标题翻译： Steiner树的网络分析
公开(公告)号：US07885269B2
公开(公告)日：2011-02-08
申请号：US12147536
申请日：2008-06-27
申请人： Mohsen Bayati , Christian H. Borgs , Alfredo Braunstein , Jennifer T. Chayes , Riccardo Zecchina
发明人： Mohsen Bayati , Christian H. Borgs , Alfredo Braunstein , Jennifer T. Chayes , Riccardo Zecchina
IPC分类号： H04L12/28
CPC分类号： G06F17/509 , G06F2217/10 , H04L41/12 , H04L45/14
摘要： Networks may be analyzed using Steiner trees. In an example embodiment, a method includes acts of receiving, accepting, creating, and analyzing. Data specifying a network is received. Steiner tree parameters are accepted. A Steiner tree model is created on the data specifying the network responsive to the Steiner tree parameters. The Steiner tree model includes a local representation having a depth constraint for neighborhood vertices. The data specifying the network is analyzed to ascertain a Steiner tree solution based on the Steiner tree model, which includes the local representation, and using a locally-oriented combinatorial algorithm.
摘要翻译：可以使用Steiner树分析网络。在示例实施例中，一种方法包括接收，接受，创建和分析的动作。接收到指定网络的数据。 Steiner树参数被接受。在指定网络的数据上创建Steiner树模型，响应于Steiner树参数。 Steiner树模型包括具有邻近顶点深度约束的局部表示。分析指定网络的数据，以确定基于包括本地表示的Steiner树模型以及使用面向局部组合算法的Steiner树解决方案。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式