-
公开(公告)号：US08654126B2
公开(公告)日：2014-02-18
申请号：US12332477
申请日：2008-12-11
申请人： Emden R. Gansner , Yifan Hu
发明人： Emden R. Gansner , Yifan Hu
IPC分类号： G06T11/20
CPC分类号： G06T11/60 , G06T11/206
摘要： Methods, systems, and products are disclosed for graphing data. A layout is retrieved that comprises locations for vertices. A proximity graph is generated using triangulation. Nodal overlaps are removed.
摘要翻译： 披露图形数据的方法，系统和产品。 检索包含顶点位置的布局。 使用三角测量法生成近似图。 节点重叠被删除。
-
公开(公告)号：US20100149186A1
公开(公告)日：2010-06-17
申请号：US12332477
申请日：2008-12-11
申请人： Emden R. Gansner , Yifan Hu
发明人： Emden R. Gansner , Yifan Hu
IPC分类号： G06T11/20
CPC分类号： G06T11/60 , G06T11/206
摘要： Methods, systems, and products are disclosed for graphing data. A layout is retrieved that comprises locations for vertices. A proximity graph is generated using triangulation. Nodal overlaps are removed.
摘要翻译： 披露图形数据的方法，系统和产品。 检索包含顶点位置的布局。 使用三角测量法生成近似图。 节点重叠被删除。
-
公开(公告)号：US20100134497A1
公开(公告)日：2010-06-03
申请号：US12326185
申请日：2008-12-02
申请人： Yifan Hu , Yehuda Koren
发明人： Yifan Hu , Yehuda Koren
IPC分类号： G06T11/20
CPC分类号： G06T11/206
摘要： Methods, systems, and products are disclosed for graphing data. A layout is retrieved that comprises locations for vertices. A proximity location is generated for each vertex. Each vertex's location from the layout is merged with each vertex's proximity location. A cost function associated with the layout is minimized.
摘要翻译： 披露图形数据的方法，系统和产品。 检索包含顶点位置的布局。 为每个顶点生成邻近位置。 每个顶点的布局位置与每个顶点的邻近位置合并。 与布局相关联的成本函数最小化。
-
公开(公告)号：US20110134128A1
公开(公告)日：2011-06-09
申请号：US12633233
申请日：2009-12-08
IPC分类号： G06T11/20
CPC分类号： G06T11/206
摘要： Relational data can be visualized in a map representation. A plurality of vertices and edges are determined based on a set of data identifying objects (i.e., vertices) and relationships (i.e., edges). The vertices and edges are embedded in a planar graph and a Voronoi diagram is generated based at least the plurality of vertices within a set of bounding-points located at least a distance away from the vertices of the map. A bounding-box is associated with each of the vertices, and a set of points generated along each bounding-box. The Voronoi diagram is generated based on the vertices and the set of points of each bounding-box. Each resulting Voronoi cell associated with a common vertex is merged to form a plurality of common cells (i.e., map). The size of each bounding-box can correlate to the importance of its associated vertex, and the points along the bounding-box can be randomly perturbed.
摘要翻译： 关系数据可以在地图表示中可视化。 基于识别对象（即，顶点）和关系（即边缘）的一组数据来确定多个顶点和边缘。 顶点和边缘被嵌入在平面图中，并且基于位于距地图的顶点至少一定距离的一组边界点内的至少多个顶点来生成Voronoi图。 边界框与每个顶点相关联，以及沿着每个边界框生成的一组点。 Voronoi图是基于每个边界的顶点和点的集合生成的。 与公共顶点相关联的每个产生的Voronoi单元被合并以形成多个公共单元（即，映射）。 每个边界框的大小可以与其相关联的顶点的重要性相关联，并且沿着边界框的点可以随机扰动。
-
公开(公告)号：US08970593B2
公开(公告)日：2015-03-03
申请号：US12633233
申请日：2009-12-08
CPC分类号： G06T11/206
摘要： Relational data can be visualized in a map representation. A plurality of vertices and edges are determined based on a set of data identifying objects (i.e., vertices) and relationships (i.e., edges). The vertices and edges are embedded in a planar graph and a Voronoi diagram is generated based at least the plurality of vertices within a set of bounding-points located at least a distance away from the vertices of the map. A bounding-box is associated with each of the vertices, and a set of points generated along each bounding-box. The Voronoi diagram is generated based on the vertices and the set of points of each bounding-box. Each resulting Voronoi cell associated with a common vertex is merged to form a plurality of common cells (i.e., map). The size of each bounding-box can correlate to the importance of its associated vertex, and the points along the bounding-box can be randomly perturbed.
摘要翻译： 关系数据可以在地图表示中可视化。 基于识别对象（即，顶点）和关系（即边缘）的一组数据来确定多个顶点和边缘。 顶点和边缘被嵌入在平面图中，并且基于位于距地图的顶点至少一定距离的一组边界点内的至少多个顶点来生成Voronoi图。 边界框与每个顶点相关联，以及沿着每个边界框生成的一组点。 Voronoi图是基于每个边界的顶点和点的集合生成的。 与公共顶点相关联的每个产生的Voronoi单元被合并以形成多个公共单元（即，映射）。 每个边界框的大小可以与其相关联的顶点的重要性相关联，并且沿着边界框的点可以随机扰动。
-
公开(公告)号：US20110153663A1
公开(公告)日：2011-06-23
申请号：US12643237
申请日：2009-12-21
申请人： Yehuda Koren , Yifan Hu , Christopher T. Volinsky
发明人： Yehuda Koren , Yifan Hu , Christopher T. Volinsky
IPC分类号： G06F17/30
CPC分类号： H04N21/6582 , G06F16/903 , H04N21/44222 , H04N21/4668
摘要： Systems and methods to provide a recommendation engine that uses implicit feedback observations are provided. A particular method includes receiving accessing data comprising a plurality of implicit feedback observations for a plurality of users. The plurality of users includes a first user that requested a recommendation. Each implicit feedback observation is associated with a particular user and a particular item of a plurality of items. The method includes determining a plurality of preference ratings and a plurality of confidence ratings for each user of the plurality of users for each item based on the plurality of implicit feedback observations. The method includes generating a recommendation list of one or more of the plurality of items for the first user based on the plurality of preference ratings and the plurality of confidence ratings.
摘要翻译： 提供了提供使用隐式反馈观察的推荐引擎的系统和方法。 一种特定方法包括接收包括多个用户的多个隐含反馈观察的访问数据。 多个用户包括请求推荐的第一用户。 每个隐式反馈观察与特定用户和多个项目的特定项目相关联。 该方法包括基于多个隐含反馈观察，针对每个项目确定多个用户中的每个用户的多个偏好等级和多个置信度。 该方法包括基于多个偏好等级和多个置信度产生针对第一用户的多个项目中的一个或多个项目的推荐列表。
-
-
-
-
-
搜索结果
6 条记录 (耗时 0.016 秒)
