公开(公告)号：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.

公开(公告)号：US07043702B2

公开(公告)日：2006-05-09

申请号：US09809388

申请日：2001-03-15

申请人： Ed H. Chi ,  Peter L. T. Pirolli ,  James E. Pitkow

发明人： Ed H. Chi ,  Peter L. T. Pirolli ,  James E. Pitkow

IPC分类号： G06G3/00

CPC分类号： G06F17/30873

摘要： A method and system for visualizing actual and predicted usage patterns through a web site is provided. A plurality of web pages may be represented as a node and visualized on a dome tree. The dome tree is a three-dimensional image of a dome, with a portion of the outer wall removed, displayed on a two-dimensional monitor. Paths into and out of each node are displayed using a variety of colors and patterns and information relating to the nodes and paths may also be accessed. By designating a web page as the root node each of the associated pages are laid out within the dome tree radially based on actual usage information. Predicted information for each node is displayed as a bar near the node, thereby assisting a user in understanding the relationship between actual and predicted usage patterns.

摘要翻译： 提供了通过网站可视化实际和预测的使用模式的方法和系统。 多个网页可以被表示为节点并且在圆顶树上可视化。 穹顶是圆顶的三维图像，外壁的一部分被去除，显示在二维监视器上。 使用各种颜色显示每个节点的进出路径，并且也可以访问与节点和路径有关的信息。 通过指定网页作为根节点，根据实际使用信息，每个相关联的页面都在径向内放置在圆顶树中。 每个节点的预测信息在节点附近显示为一个条，从而帮助用户了解实际和预测使用模式之间的关系。

公开(公告)号：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.

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

公开(公告)号：US07260643B2

公开(公告)日：2007-08-21

申请号：US09820988

申请日：2001-03-30

申请人： Ed H. Chi ,  Jeffery M Heer ,  Peter L. T. Pirolli

发明人： Ed H. Chi ,  Jeffery M Heer ,  Peter L. T. Pirolli

IPC分类号： G06F15/173

CPC分类号： G06F17/30867

摘要： Techniques for determining user types based on multi-modal clustering are provided. The topology, content and usage of a document collection or web site is determined. The user paths are identified using longest repeating subsequence techniques and a multi-modal information need vector is determined for each significant user path. Multi-modal vectors for each document in the significant path, content, uniform resource locators, inlink and outlink multi-modal vectors are determined and combined based on path position and access frequency. Multi-modal clustering is performed based on a multi-modal similarity function and a specified measure of similarity using a type of multi-modal clustering such as K-means or wavefront clustering. The identified clusters may be further analyzed based on changes to the weighting of the corresponding content, url, inlinks and outlinks multi-modal feature vectors.

摘要翻译： 提供了基于多模式聚类来确定用户类型的技术。 确定文档集合或网站的拓扑，内容和用法。 使用最长的重复子序列技术来识别用户路径，并且为每个重要用户路径确定多模态信息需求向量。 基于路径位置和访问频率确定并组合有效路径中的每个文档的多模态向量，内容，统一资源定位符，inlink和outlink多模态向量。 基于多模式相似度函数和使用诸如K均值或波前聚类的多模式聚类的类型的指定度量进行多模态聚类。 可以基于对相应内容，url，inlinks和outlinks多模态特征向量的权重的改变来进一步分析所识别的集群。

公开(公告)号：US07203899B2

公开(公告)日：2007-04-10

申请号：US10063344

申请日：2002-04-12

申请人： Ed H. Chi ,  Peter L. T. Pirolli

发明人： Ed H. Chi ,  Peter L. T. Pirolli

IPC分类号： G06F17/00

CPC分类号： H04L67/22 ,  H04L29/06 ,  H04L69/329

摘要： Systems and methods measure the navigability of a web site by determining the rate at which simulated users absorb information scent. This note can be viewed as a measurement of accomplishing the users' information goals. As users reach their target information, the users terminate their navigation in the web site. Thus, the rate at which users finish is a measurement of the navigability of the web site.

摘要翻译： 系统和方法通过确定模拟用户吸收信息气味的速率来测量网站的导航性。 该笔记可以被看作是完成用户信息目标的衡量标准。 当用户达到其目标信息时，用户终止其在网站上的导航。 因此，用户完成的速度是衡量网站的导航性。

公开(公告)号：US07017110B1

公开(公告)日：2006-03-21

申请号：US09540063

申请日：2000-03-31

申请人： Ed H. Chi ,  Peter L. Pirolli ,  James E. Pitkow

发明人： Ed H. Chi ,  Peter L. Pirolli ,  James E. Pitkow

IPC分类号： G06F17/00

CPC分类号： G06F17/30855 ,  G06F17/30867 ,  G06F17/30882

摘要： The present invention provides a system and method for inferring information need in a collection of hypermedia documents that is based on the observation that a user's hypertext link traversal decisions are typically based on the nature of that user's information need. The system identifies the hypermedia linkage structure among the plurality of documents in the collection. The documents include content items that may be relevant to a user information need. The system then accepts a user path item that represents a user's hypermedia link traversal history and applies a network flow model to the user path item in the hypermedia link information in order to create a document vector. The system also determines the distribution of the content items in the document collection, and then compares the document vector to the content item distribution in order to determine an inferred information need.

摘要翻译： 本发明提供了一种用于在超媒体文档的集合中推断信息需求的系统和方法，其基于用户的超文本链接遍历决定通常基于该用户的信息需要的性质的观察。 系统识别集合中的多个文档之间的超媒体联动结构。 这些文件包括可能与用户信息需要相关的内容项。 然后，系统接受表示用户的超媒体链接遍历历史的用户路径项目，并将网络流模型应用于超媒体链接信息中的用户路径项目，以便创建文档向量。 系统还确定文档收集中的内容项目的分布，然后将文档向量与内容项目分布进行比较，以确定推断的信息需求。

公开(公告)号：US06671711B1

公开(公告)日：2003-12-30

申请号：US09540976

申请日：2000-03-31

申请人： Peter L. Pirolli ,  Ed H. Chi ,  James E. Pitkow

发明人： Peter L. Pirolli ,  Ed H. Chi ,  James E. Pitkow

IPC分类号： G06F900

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

摘要： The present invention also provides a system and method for predicting user traffic flow in a collection of hypermedia documents by determining the association strength of the hypermedia links. Hypermedia links are identified among a plurality of documents, where the documents include content items such as keywords that may or may not be relevant to a user information need. The distribution of the content items in the document collection is then determined. An information item is received as input, and is compared to the content items. In response to the comparison, association strengths are assigned to the hypermedia links. A network flow model uses the association strengths of the hypermedia links to predict user traffic flow in response to an initial condition.

摘要翻译： 本发明还提供了一种用于通过确定超媒体链路的关联强度来预测超媒体文档集合中的用户业务流的系统和方法。 在多个文档中标识超媒体链接，其中文档包括诸如关键字之类的内容项目，这些关键字可能与用户信息需要相关也可能不相关。 然后确定文档集合中的内容项目的分发。 作为输入接收信息项，并与内容项进行比较。 响应于比较，将关联强度分配给超媒体链接。 网络流模型使用超媒体链路的关联强度来响应于初始条件来预测用户业务流。

公开(公告)号：US06598054B2

公开(公告)日：2003-07-22

申请号：US09425039

申请日：1999-10-19

申请人： Hinrich Schuetze ,  Peter L. Pirolli ,  James E. Pitkow ,  Ed H. Chi ,  Jun Li

发明人： Hinrich Schuetze ,  Peter L. Pirolli ,  James E. Pitkow ,  Ed H. Chi ,  Jun Li

IPC分类号： G06F1700

CPC分类号： G06F17/30713 ,  G06F17/30994 ,  Y10S707/99944 ,  Y10S707/99945

摘要： A system and method for browsing, retrieving, and recommending information from a collection uses multi-modal features of the documents in the collection, as well as an analysis of users' prior browsing and retrieval behavior. The system and method are premised on various disclosed methods for quantitatively representing documents in a document collection as vectors in multi-dimensional vector spaces, quantitatively determining similarity between documents, and clustering documents according to those similarities. The system and method also rely on methods for quantitatively representing users in a user population, quantitatively determining similarity between users, clustering users according to those similarities, and visually representing clusters of users by analogy to clusters of documents.

摘要翻译： 用于从集合中浏览，检索和推荐信息的系统和方法使用集合中的文档的多模态特征，以及用户先前浏览和检索行为的分析。 系统和方法以各种公开的方法为前提，用于定量表示文档集合中的文档，作为多维向量空间中的向量，定量地确定文档之间的相似性，并根据这些相似性对文档进行聚类。 系统和方法还依赖于定量表示用户群体中的用户的方法，定量地确定用户之间的相似性，根据这些相似性对用户进行聚类，并且通过类似于文档集合直观地表示用户群。

公开(公告)号：US06567797B1

公开(公告)日：2003-05-20

申请号：US09425038

申请日：1999-10-19

申请人： Hinrich Schuetze ,  James E. Pitkow ,  Peter L. Pirolli ,  Ed H. Chi ,  Jun Li

发明人： Hinrich Schuetze ,  James E. Pitkow ,  Peter L. Pirolli ,  Ed H. Chi ,  Jun Li

IPC分类号： G06F700

CPC分类号： G06F17/3061 ,  G06F17/3025 ,  G06F17/30268 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935

摘要： A system and method for browsing, retrieving, and recommending information from a collection uses multi-modal features of the documents in the collection, as well as an analysis of users' prior browsing and retrieval behavior. The system and method are premised on various disclosed methods for quantitatively representing documents in a document collection as vectors in multi-dimensional vector spaces, quantitatively determining similarity between documents, and clustering documents according to those similarities. The system and method also rely on methods for quantitatively representing users in a user population, quantitatively determining similarity between users, clustering users according to those similarities, and visually representing clusters of users by analogy to clusters of documents.

摘要翻译： 用于从集合中浏览，检索和推荐信息的系统和方法使用集合中的文档的多模态特征，以及用户先前浏览和检索行为的分析。 系统和方法以各种公开的方法为前提，用于定量表示文档集合中的文档，作为多维向量空间中的向量，定量地确定文档之间的相似性，并根据这些相似性对文档进行聚类。 系统和方法还依赖于定量表示用户群体中的用户的方法，定量地确定用户之间的相似性，根据这些相似性对用户进行聚类，并且通过类似于文档集合直观地表示用户群。