公开(公告)号：US20090157589A1

公开(公告)日：2009-06-18

申请号：US11957779

申请日：2007-12-17

申请人： Srujana Merugu ,  Phillip L. Bohannon ,  Ashwin Kumar Machanavajjhala ,  Pedro DeRose

发明人： Srujana Merugu ,  Phillip L. Bohannon ,  Ashwin Kumar Machanavajjhala ,  Pedro DeRose

IPC分类号： G06N5/00

CPC分类号： G06N5/04

摘要： A system is disclosed for reconciling opinions generated by agents with respect to one or more predicates. The disclosed system may use observed variables and a probabilistic model including latent parameters to estimate a truth score associated with each of the predicates. The truth score, as well as one or more of the latent parameters of the probabilistic model, may be estimated based on the observed variables. The truth score generated by the disclosed system may enable publishers to reliably represent the truth of a predicate to interested users.

摘要翻译： 披露了一种系统，用于协调代理人对一种或多种谓词产生的意见。 所公开的系统可以使用观测变量和包括潜在参数的概率模型来估计与每个谓词相关联的真值得分。 可以基于观察到的变量来估计真实分数以及概率模型的一个或多个潜在参数。 由所公开的系统产生的真相得分可以使得发布者能够可靠地向感兴趣的用户表示谓词的真实性。

公开(公告)号：US20100036865A1

公开(公告)日：2010-02-11

申请号：US12188169

申请日：2008-08-07

申请人： Jayavel SHANMUGASUNDARAM ,  Minos Garofalakis ,  Erik Vee ,  Ashwin Kumar Machanavajjhala

发明人： Jayavel SHANMUGASUNDARAM ,  Minos Garofalakis ,  Erik Vee ,  Ashwin Kumar Machanavajjhala

IPC分类号： G06F17/30

CPC分类号： G06F16/322

摘要： A method of constructing a score-optimal R-tree to support top-k stabbing queries over a set of scored intervals generates a constraint graph from the set, and determines over each node in the constraint graph that has no other nodes pointing to it the node with the smallest left endpoint; for each of these nodes, the associated interval is added to the tree and the node is removed from the constraint graph.

摘要翻译： 一种构建分数最优R树以支持一组计分间隔的顶部k个刺激查询的方法从该集合生成约束图，并确定约束图中没有其他节点指向它的每个节点 具有最小左端点的节点; 对于这些节点中的每一个，将相关联的间隔添加到树中，并且从约束图中移除该节点。