公开(公告)号：US06509898B2

公开(公告)日：2003-01-21

申请号：US09062341

申请日：1998-04-17

申请人： Ed H. Chi ,  Peter L. T. Pirolli ,  James E. Pitkow ,  Rich Gossweller ,  Jock D. Mackinlay ,  Stuart K. Card

发明人： Ed H. Chi ,  Peter L. T. Pirolli ,  James E. Pitkow ,  Rich Gossweller ,  Jock D. Mackinlay ,  Stuart K. Card

IPC分类号： G06T1120

CPC分类号： G06F17/30882 ,  G06F17/30014 ,  G06F17/30855 ,  Y10S707/99933

摘要： A method for generating a tree structure representation of a generalized graph structure for display includes the more important links in the representation. Usage parameters are referenced in generating the tree structure from the generalized graph structure. Frequency, recency, spacing of accesses, and path information are exemplary types of usage parameters. A breadth-first or depth-first traversal of the graph references usage parameters associated with each node or link. The usage parameters which are associated with each node are referenced in order to determine the visitation order. The visitation order is determined by visiting the highest used nodes or links first. A method of displaying the tree structure references the usage parameters to determine the positioning of the nodes in the layout of the tree structure. In a preferred embodiment, the root node is positioned in the center of the layout. In one example, sibling nodes are spread out on links which emanate radially about their parent. The highest-used sibling nodes can be placed farthest apart from each other so as to achieve optimal separation so that they have the most growth space. The lowest-used nodes are then placed in the remaining space between the high-usage nodes. In another example, sibling nodes are positioned at the same radius from the root node. Each leaf node in the hierarchy is assigned the same amount of angular space. The layout angle of each node is a function of the ranking of the node's usage parameter relative to its siblings. Derived usage parameters such as need probability, cocitation clustering, or functions of both node and link usages can alternatively be referenced.

摘要翻译： 用于生成用于显示的广义图形结构的树结构表示的方法包括表示中更重要的链接。 从广义图结构生成树结构时引用使用参数。 频率，新近度，访问间隔和路径信息是使用参数的示例性类型。 图的宽度优先或深度优先遍历引用与每个节点或链接相关联的使用参数。 引用与每个节点相关联的使用参数，以确定访问顺序。 访问次序通过首先访问最高使用的节点或链接来确定。 显示树结构的方法引用使用参数来确定节点在树结构的布局中的定位。 在优选实施例中，根节点位于布局的中心。 在一个示例中，兄弟节点被散布在围绕其父节点辐射的链接上。 最高使用的兄弟节点可以彼此离开最远，以便实现最佳分离，使其具有最大的生长空间。 然后将最低使用的节点放置在高使用率节点之间的剩余空间中。 在另一个示例中，兄弟节点位于与根节点相同的半径处。 层次结构中的每个叶节点被分配相同的角度空间量。 每个节点的布局角度是节点的使用参数相对于其兄弟姐妹的排序的函数。 替代地可以引用派生的使用参数，例如需求概率，串联聚类或节点和链接使用的功能。

公开(公告)号：US06369819B1

公开(公告)日：2002-04-09

申请号：US09062513

申请日：1998-04-17

申请人： James E. Pitkow ,  Peter L. T. Pirolli ,  Ed H. Chi ,  Stuart K. Card ,  Jock D. Mackinlay ,  Rich Gossweller

发明人： James E. Pitkow ,  Peter L. T. Pirolli ,  Ed H. Chi ,  Stuart K. Card ,  Jock D. Mackinlay ,  Rich Gossweller

IPC分类号： G06T1120

CPC分类号： G06F17/3089 ,  Y10S707/99933

摘要： A method for displaying in a coherent manner the changes over time of a web site's structure, usage, and content is disclosed. Time tubes are generated by a method of displaying a related series of graphs. Time tubes illustrate changes in a graph that undergoes one or more transformations from one state to another. The transformations are displayed using the length of the cylindrical tube, filling the length of the time tube with planar slices which represent the data at various stages of the transformations. Time tubes may encode several dimensions of the transformations simultaneously by altering the representation of size, color, and layout among the planar slices. Temporal transformations occur when web pages are added or deleted over time. Value-based transformations include node colors, which may be used to encode a specific page's usage parameter. Spatial transformations include the scaling of physical dimension as graphs expand or contract in size. The states of a graph at various times are represented as a series of related graphs. In a preferred embodiment, an inventory of all existing nodes is performed so as to generate a list of all nodes that have existed at any time. This inventory is used to produce a layout template in which each unique node is assigned a unique layout position. To produce each planar slice, the specific nodes which exist in the slice are placed at their respective positions assigned in the layout template. In another aspect, corresponding nodes in planar slices are linked, such as with translucent streamlines, in response to a user selecting a node in a planar slice by placing his cursor over the selected node, or to show clustering of two or more nodes in one planar slice into a single node in an adjacent planar slice.

摘要翻译： 公开了一种以连贯的方式显示网站结构，使用和内容随时间变化的方法。 时间管是通过显示相关系列图的方法产生的。 时间管示出了经历从一个状态到另一个状态的一个或多个变换的图中的变化。 使用圆柱形管的长度显示变换，用表示在转化的各个阶段的数据的平面切片填充时间管的长度。 时间管可以通过改变平面切片之间的尺寸，颜色和布局的表示来同时编码变换的多个维度。 随着时间的推移，网页被添加或删除时，会发生时间变换。 基于值的变换包括节点颜色，可用于对特定页面的使用参数进行编码。 空间变换包括随着图形扩大或缩小大小的物理维度的缩放。 不同时间的图形状态表示为一系列相关图形。 在优选实施例中，执行所有现有节点的清单以便生成在任何时间已经存在的所有节点的列表。 此清单用于生成布局模板，其中每个唯一节点被分配唯一的布局位置。 为了产生每个平面切片，存在于切片中的特定节点被放置在分配在布局模板中的它们各自的位置。 在另一方面，响应于用户通过将其光标放置在所选择的节点上来选择平面切片中的节点，或者在一个平面切片中的两个或更多个节点的聚类，平面切片中的对应节点（例如具有半透明流线）被链接 平面切片分成相邻平面切片中的单个节点。

公开(公告)号：US6151595A

公开(公告)日：2000-11-21

申请号：US062540

申请日：1998-04-17

申请人： Peter L. T. Pirolli ,  James E. Pitkow ,  Ed H. Chi ,  Stuart K. Card ,  Jock D. Mackinlay ,  Rich Gossweller

发明人： Peter L. T. Pirolli ,  James E. Pitkow ,  Ed H. Chi ,  Stuart K. Card ,  Jock D. Mackinlay ,  Rich Gossweller

IPC分类号： G06F17/30

CPC分类号： G06F17/30882 ,  G06F17/30014 ,  G06F17/30855 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99953

摘要： Methods for displaying results of a spreading activation algorithm and for defining an activation input vector for the spreading activation algorithm are disclosed. A planar disk tree is used to represent the generalized graph structure being modeled in a spreading activation algorithm. Activation bars on some or all nodes of the planar disk tree in the dimension perpendicular to the disk tree encode the final activation level resulting at the end of N iterations of the spreading activation algorithm. The number of nodes for which activation bars are displayed may be a predetermined number, a predetermine fraction of all nodes, or a determined by a predetermined activation level threshold. The final activation levels resulting from activation spread through more than one flow network corresponding to the same generalized graph are displayed as color encoded segments on the activation bars. Content, usage, topology, or recommendation flow networks may be used for spreading activation. The difference between spreading activation through different flow networks corresponding to the same generalized graph may be displayed by subtracting the resulting activation patterns from each network and displaying the difference. The spreading activation input vector is determined by continually measuring the dwell time that the user's cursor spends on a displayed node. Activation vectors at various intermediate steps of the N-step spreading activation algorithm are color encoded onto nodes of disk trees within time tubes. The activation input vector and the activation vectors resulting from all N steps are displayed in a time tube having N+1 planar disk trees. Alternatively, a periodic subset of all N activation vectors are displayed, or a subset showing planar disk trees representing large changes in activation levels or phase shifts are displayed while planar disk trees representing smaller changes in activation levels are not displayed.