-
公开(公告)号：US20100060643A1
公开(公告)日：2010-03-11
申请号：US12206691
申请日：2008-09-08
IPC分类号： G06T11/00
CPC分类号： G06T11/206
摘要： A system and method for drawing directed acyclic graphs is disclosed. In particular, an algorithm, as implemented in a method and system, to aesthetically layout directed acyclic graphs is presented. The algorithm includes methods to reduce the number of edge crossings and increase the number of straight edges in such drawings. The algorithm keeps short and straight edges wherever possible and gives preference to vertical edges. It also provides an edge-crossing reduction heuristic to refine the layout obtained after standard median heuristic layout, and further provides a method to focus on important paths in the graph through layout.
摘要翻译： 公开了用于绘制有向无环图的系统和方法。 特别地，呈现了在方法和系统中实现的用于美观地布置有向无环图的算法。 该算法包括减少边缘交叉的数量并增加这些图中的直边数的方法。 该算法尽可能保持短和直的边缘，并优先于垂直边缘。 它还提供了一个边缘交叉减少启发式来改进在标准中间启发式布局之后获得的布局，并进一步提供了一种通过布局集中在图中重要路径的方法。
-
公开(公告)号：US20090064053A1
公开(公告)日：2009-03-05
申请号：US12201400
申请日：2008-08-29
申请人： Stuart L. Crawford , Gaurav Chhaparwal , Navin Doshi , Kashyap Babu Rao Kolipaka , Sergei Tolmanov , Michael Steele , Megan Thorsen
发明人： Stuart L. Crawford , Gaurav Chhaparwal , Navin Doshi , Kashyap Babu Rao Kolipaka , Sergei Tolmanov , Michael Steele , Megan Thorsen
IPC分类号： G06F3/048
CPC分类号： G06F3/04845 , G06T11/206
摘要： Techniques for visualization of decision logic are provided. In one aspect, the techniques can be implemented by providing a control within a graphical user interface to a user. The control can display a plurality of graphical user interface elements corresponding to linked nodes within a hierarchical structure. An input identifying a selected graphical user interface element within the control can be generated by a user. A selected node within the hierarchical structure can be identified based on the selected graphical user interface element. In response to a request from a user, modifying an appearance of a subset of the linked nodes within the hierarchical structure based on a desired visualization criteria, the linked nodes within the hierarchical structure and the selected node.
摘要翻译： 提供了决策逻辑可视化的技术。 在一个方面，可以通过在用户的图形用户界面内提供控制来实现这些技术。 该控件可以显示与层级结构内的链接节点相对应的多个图形用户界面元素。 可以由用户生成识别控制内的所选择的图形用户界面元素的输入。 可以基于所选择的图形用户界面元素来识别分层结构内的选定节点。 响应于来自用户的请求，基于期望的可视化标准，在分层结构内的所链接的节点和所选择的节点修改层次结构内的链接节点的子集的外观。
-
公开(公告)号：US08730241B2
公开(公告)日：2014-05-20
申请号：US12206687
申请日：2008-09-08
IPC分类号： G06T11/20
CPC分类号： G06T11/206
摘要： A system and method for drawing curved edges in graphs is disclosed. The system and method implement a heuristic algorithm to draw curved edges in graphs using Bezier curves. The algorithm assumes that every pair of nodes has a unique edge between them. It also assumes that the graph is “leveled,” which means the nodes can be grouped such that all the nodes in a group are laid out at the same y location in a vertical layout. Any generic graph can be converted to a leveled graph, so the techniques described in the algorithm are applicable to any graph.
摘要翻译： 公开了用于在曲线图中绘制弯曲边缘的系统和方法。 系统和方法实现启发式算法，使用贝塞尔曲线绘制曲线边缘。 该算法假设每对节点在它们之间具有独特的边缘。 它还假设图是“被调平”的，这意味着可以对节点进行分组，使得组中的所有节点布置在垂直布局中的相同y位置。 任何通用图形都可以转换为一个水平图，因此算法中描述的技术适用于任何图形。
-
公开(公告)号：US08312389B2
公开(公告)日：2012-11-13
申请号：US12201400
申请日：2008-08-29
申请人： Stuart L. Crawford , Gaurav Chhaparwal , Navin Doshi , Kashyap Babu Rao Kolipaka , Sergei Tolmanov , Michael Steele , Megan Thorsen
发明人： Stuart L. Crawford , Gaurav Chhaparwal , Navin Doshi , Kashyap Babu Rao Kolipaka , Sergei Tolmanov , Michael Steele , Megan Thorsen
CPC分类号： G06F3/04845 , G06T11/206
摘要： Techniques for visualization of decision logic are provided. In one aspect, the techniques can be implemented by providing a control within a graphical user interface to a user. The control can display a plurality of graphical user interface elements corresponding to linked nodes within a hierarchical structure. An input identifying a selected graphical user interface element within the control can be generated by a user. A selected node within the hierarchical structure can be identified based on the selected graphical user interface element. In response to a request from a user, modifying an appearance of a subset of the linked nodes within the hierarchical structure based on a desired visualization criteria, the linked nodes within the hierarchical structure and the selected node.
摘要翻译： 提供了决策逻辑可视化的技术。 在一个方面，可以通过在用户的图形用户界面内提供控制来实现这些技术。 该控件可以显示与层级结构内的链接节点相对应的多个图形用户界面元素。 可以由用户生成识别控制内的所选择的图形用户界面元素的输入。 可以基于所选择的图形用户界面元素来识别分层结构内的选定节点。 响应于来自用户的请求，基于期望的可视化标准，在分层结构内的所链接的节点和所选择的节点修改层次结构内的链接节点的子集的外观。
-
5.发明授权Article and method for finding a compact representation to visualize complex decision trees 有权找到紧凑表示以便可视化复杂决策树的文章和方法公开(公告)号：US07937335B2
公开(公告)日：2011-05-03
申请号：US12854090
申请日：2010-08-10
申请人： Stuart Crawford , Gaurav Chhaparwal , Kashyap Babu Rao Kolipaka , Navin Doshi , Sergei Tolmanov
发明人： Stuart Crawford , Gaurav Chhaparwal , Kashyap Babu Rao Kolipaka , Navin Doshi , Sergei Tolmanov
CPC分类号： G06F17/30994
摘要： The invention comprises an article and method for transforming a complex or large decision tree having multiple variables; multiple values for each variable; and, multiple outcomes for each combination of variables and their associated values, into a compact, efficient graphical representation to provided enhanced ease of use and interaction by a human user. More particularly, the invention comprises a computationally efficient method for transforming an input decision tree into an optimal compact representation by computing a particular ordering of variables in the decision tree that first leads to a Directed Acyclic Graph, or “DAG,” with a minimum number of nodes. The method then converts the DAG into an exception-based DAG, or “EDAG,” with exactly one exception, having an optimal, minimum number of nodes with increased comprehensibility for a user.
摘要翻译： 本发明包括用于变换具有多个变量的复杂或大的决策树的文章和方法; 每个变量的多个值; 以及将变量及其相关联的每个组合的多个结果转换成紧凑，高效的图形表示，以提供人类用户增强的易用性和交互性。 更具体地，本发明包括一种计算有效的方法，用于通过计算决策树中首先导向定向非循环图的变量的特定排序或具有最小数目的“DAG”将输入决策树变换为最佳紧凑表示 的节点。 然后，该方法将DAG转换为基于异常的DAG或“EDAG”，只有一个例外，具有对用户具有更高可理解性的最佳最小数量的节点。
-
6.发明授权Article and method for finding a compact representation to visualize complex decision trees 有权找到紧凑表示以便可视化复杂决策树的文章和方法公开(公告)号：US07831526B1
公开(公告)日：2010-11-09
申请号：US11845291
申请日：2007-08-27
申请人： Stuart Crawford , Gaurav Chhaparwal , Kashyap Babu Rao Kolipaka , Navin Doshi , Sergei Tolmanov
发明人： Stuart Crawford , Gaurav Chhaparwal , Kashyap Babu Rao Kolipaka , Navin Doshi , Sergei Tolmanov
CPC分类号： G06F17/30994
摘要： The invention comprises an article and method for transforming a complex or large decision tree having multiple variables; multiple values for each variable; and, multiple outcomes for each combination of variables and their associated values, into a compact, efficient graphical representation to provided enhanced ease of use and interaction by a human user. More particularly, the invention comprises a computationally efficient method for transforming an input decision tree into an optimal compact representation by computing a particular ordering of variables in the decision tree that first leads to a Directed Acyclic Graph, or “DAG,” with a minimum number of nodes. The method then converts the DAG into an exception-based DAG, or “EDAG,” with exactly one exception, having an optimal, minimum number of nodes with increased comprehensibility for a user.
摘要翻译： 本发明包括用于变换具有多个变量的复杂或大的决策树的文章和方法; 每个变量的多个值; 以及将变量及其相关联的每个组合的多个结果转换成紧凑，高效的图形表示，以提供人类用户增强的易用性和交互性。 更具体地，本发明包括一种计算有效的方法，用于通过计算决策树中首先导向定向非循环图的变量的特定排序或具有最小数目的“DAG”将输入决策树变换为最佳紧凑表示 的节点。 然后，该方法将DAG转换为基于异常的DAG或“EDAG”，只有一个例外，具有对用户具有更高可理解性的最佳最小数量的节点。
-
公开(公告)号：US20100060642A1
公开(公告)日：2010-03-11
申请号：US12206687
申请日：2008-09-08
IPC分类号： G06T11/00
CPC分类号： G06T11/206
摘要： A system and method for drawing curved edges in graphs is disclosed. The system and method implement a heuristic algorithm to draw curved edges in graphs using Bezier curves. The algorithm assumes that every pair of nodes has a unique edge between them. It also assumes that the graph is “leveled,” which means the nodes can be grouped such that all the nodes in a group are laid out at the same y location in a vertical layout. Any generic graph can be converted to a leveled graph, so the techniques described in the algorithm are applicable to any graph.
摘要翻译： 公开了用于在曲线图中绘制弯曲边缘的系统和方法。 系统和方法实现启发式算法，使用贝塞尔曲线绘制曲线边缘。 该算法假设每对节点在它们之间具有独特的边缘。 它还假设图是“被调平”的，这意味着可以对节点进行分组，使得组中的所有节点布置在垂直布局中的相同y位置。 任何通用图形都可以转换为一个水平图，因此算法中描述的技术适用于任何图形。
-
公开(公告)号：US08266090B2
公开(公告)日：2012-09-11
申请号：US12201555
申请日：2008-08-29
申请人： Stuart L. Crawford , Michael Steele , Navin Doshi , Sergei Tolmanov , Kashyap Babu Rao Kolipaka , Gaurav Chhaparwal , Megan Thorsen , Chris Erickson
发明人： Stuart L. Crawford , Michael Steele , Navin Doshi , Sergei Tolmanov , Kashyap Babu Rao Kolipaka , Gaurav Chhaparwal , Megan Thorsen , Chris Erickson
CPC分类号： G06N7/00
摘要： A request to compare strategies is received. The first strategy can be graphically represented by a first set of linked nodes arranged in a first form of decision logic. The second strategy can be graphically represented by a second set of linked nodes arranged in a second form of decision logic. The first set of linked nodes can be converted to a first modified set of linked nodes arranged in a third form of decision logic. The second set of linked nodes can be converted to a second modified set of linked nodes arranged in the third form of decision logic. A color-coded visual representation of the first modified set of linked nodes and the second modified set of linked nodes can be provided to a user. Related apparatus, techniques, and articles are also described.
摘要翻译： 收到比较策略的请求。 第一策略可以由以第一种形式的决策逻辑排列的第一组链接节点图形化地表示。 第二策略可以以第二种决策逻辑形式排列的第二组链接节点图形化地表示。 可以将第一组链接节点转换成以第三种形式的决策逻辑排列的第一修改的链接节点集合。 可以将第二组链接节点转换为以第三种形式的决策逻辑排列的第二修改的链接节点集合。 可以向用户提供第一修改的链接节点集合和第二修改的链接节点集合的颜色编码的视觉表示。 还描述了相关装置，技术和制品。
-
公开(公告)号：US08237716B2
公开(公告)日：2012-08-07
申请号：US12206691
申请日：2008-09-08
CPC分类号： G06T11/206
摘要： A system and method for drawing directed acyclic graphs is disclosed. In particular, an algorithm, as implemented in a method and system, to aesthetically layout directed acyclic graphs is presented. The algorithm includes methods to reduce the number of edge crossings and increase the number of straight edges in such drawings. The algorithm keeps short and straight edges wherever possible and gives preference to vertical edges. It also provides an edge-crossing reduction heuristic to refine the layout obtained after standard median heuristic layout, and further provides a method to focus on important paths in the graph through layout.
摘要翻译： 公开了用于绘制有向无环图的系统和方法。 特别地，呈现了在方法和系统中实现的用于美观地布置有向无环图的算法。 该算法包括减少边缘交叉的数量并增加这些图中的直边数的方法。 该算法尽可能保持短和直的边缘，并优先于垂直边缘。 它还提供了一个边缘交叉减少启发式来改进在标准中间启发式布局之后获得的布局，并进一步提供了一种通过布局集中在图中重要路径的方法。
-
10.发明申请ARTICLE AND METHOD FOR FINDING A COMPACT REPRESENTATION TO VISUALIZE COMPLEX DECISION TREES 有权用于发现可视化复杂决策树的紧凑表示的文章和方法公开(公告)号：US20100306167A1
公开(公告)日：2010-12-02
申请号：US12854090
申请日：2010-08-10
申请人： Stuart Crawford , Gaurav Chhaparwal , Kashyap Babu Rao Kolipaka , Navin Doshi , Sergei Tolmanov
发明人： Stuart Crawford , Gaurav Chhaparwal , Kashyap Babu Rao Kolipaka , Navin Doshi , Sergei Tolmanov
IPC分类号： G06N5/02
CPC分类号： G06F17/30994
摘要： The invention comprises an article and method for transforming a complex or large decision tree having multiple variables; multiple values for each variable; and, multiple outcomes for each combination of variables and their associated values, into a compact, efficient graphical representation to provided enhanced ease of use and interaction by a human user. More particularly, the invention comprises a computationally efficient method for transforming an input decision tree into an optimal compact representation by computing a particular ordering of variables in the decision tree that first leads to a Directed Acyclic Graph, or “DAG,” with a minimum number of nodes. The method then converts the DAG into an exception-based DAG, or “EDAG,” with exactly one exception, having an optimal, minimum number of nodes with increased comprehensibility for a user.
摘要翻译： 本发明包括用于变换具有多个变量的复杂或大的决策树的文章和方法; 每个变量的多个值; 以及将变量及其相关联的每个组合的多个结果转换成紧凑，高效的图形表示，以提供人类用户增强的易用性和交互性。 更具体地，本发明包括一种计算有效的方法，用于通过计算决策树中首先导向定向非循环图的变量的特定排序或具有最小数目的“DAG”将输入决策树变换为最佳紧凑表示 的节点。 然后，该方法将DAG转换为基于异常的DAG或“EDAG”，只有一个例外，具有对用户具有更高可理解性的最佳最小数量的节点。
-
-
-
-
-
-
-
-
-
搜索结果
11 条记录 (耗时 0.013 秒)
