专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US06038574A Method and apparatus for clustering a collection of linked documents using co-citation analysis 失效
标题翻译：使用共同引用分析对链接文档集合进行聚类的方法和装置
公开(公告)号：US06038574A
公开(公告)日：2000-03-14
申请号：US44693
申请日：1998-03-18
申请人： James E. Pitkow , Peter L. Pirolli , Jock D. Mackinlay , Stuart K. Card
发明人： James E. Pitkow , Peter L. Pirolli , Jock D. Mackinlay , Stuart K. Card
IPC分类号： G06F17/30 , G06F17/21
CPC分类号： G06F17/3061 , Y10S707/99935 , Y10S707/99943
摘要： The method and apparatus of the present invention generates clusters of documents in a collection of linked documents based on co-citation analysis. The frequency linkage is determined for each document in the collection. In other words, the number of times each document is linked to by another document in the collection is determined. Further, a minimum frequency linkage (link frequency threshold) is specified based on a predetermined minimum frequency of document linkage. Additionally, a list of pairs of documents that are linked to by the same document is created so that each of the pairs of documents has a count of the number of times (co-citation frequency) that they are both linked to by another document. Pairs of linked documents are clustered using a suitable co-citation technique.
摘要翻译：本发明的方法和装置基于共同引用分析，在链接文档的集合中生成文档集合。为集合中的每个文档确定频率联系。换句话说，确定集合中另一个文档链接到每个文档的次数。此外，基于文档链接的预定最小频率来指定最小频率链接（链接频率阈值）。此外，创建由相同文档链接到的文档对的列表，使得每对文档具有它们被另一个文档链接的次数（共同引用频率）的计数。使用合适的共引用技术将对的链接文档聚类。

2. 发明授权

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

3. 发明授权

US6151595A Methods for interactive visualization of spreading activation using time tubes and disk trees 失效
公开(公告)号：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.

4. 发明授权

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

5. 发明授权

US07017110B1 System and method for inferring user information need in hypermedia linked document collection 有权
标题翻译：用于推断用户信息的系统和方法需要超媒体链接的文档收集
公开(公告)号：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.
摘要翻译：本发明提供了一种用于在超媒体文档的集合中推断信息需求的系统和方法，其基于用户的超文本链接遍历决定通常基于该用户的信息需要的性质的观察。系统识别集合中的多个文档之间的超媒体联动结构。这些文件包括可能与用户信息需要相关的内容项。然后，系统接受表示用户的超媒体链接遍历历史的用户路径项目，并将网络流模型应用于超媒体链接信息中的用户路径项目，以便创建文档向量。系统还确定文档收集中的内容项目的分布，然后将文档向量与内容项目分布进行比较，以确定推断的信息需求。

6. 发明授权

US6098064A Prefetching and caching documents according to probability ranked need S list 失效
标题翻译：预取和缓存文件按概率排列需要S列表
公开(公告)号：US6098064A
公开(公告)日：2000-08-01
申请号：US83645
申请日：1998-05-22
申请人： Peter L. Pirolli , James E. Pitkow
发明人： Peter L. Pirolli , James E. Pitkow
IPC分类号： G06F17/30 , H04L29/06 , H04L29/08
CPC分类号： H04L67/20 , G06F17/30902 , H04L29/06 , H04L67/28 , H04L67/2847 , H04L67/2852 , H04L69/329 , Y10S707/99932 , Y10S707/99935
摘要： A method is presented for determining whether to prefetch and cache documents on a computer. In one embodiment, documents are prefetched and cached on a client computer from servers located on the Internet in accordance with their computed need probability. Those document with a higher need probability are prefetched and cached before documents with lower need probabilities. The need probability for a document is computed using both a document context factor and a document history factor. The context factor of the need probability of a document is determined by computing the correlation between words in the document and a context Q of the operating environment. The history factor of the need probability of a document is determined by integrating both the recency of document use and the frequency of document use.
摘要翻译：提出了一种用于确定是否在计算机上预取和缓存文档的方法。在一个实施例中，根据其计算出的需求概率，将文档从位于因特网上的服务器预取和缓存在客户端计算机上。那些具有较高需求概率的文档在具有较低需求概率的文档之前被预取和缓存。使用文档上下文因素和文档历史因子来计算文档的需求概率。通过计算文档中的单词和操作环境的上下文Q之间的相关性来确定文档的需要概率的上下文因素。通过整合文件使用的新近度和文档使用频率来确定文档的需求概率的历史因素。

7. 发明授权

US06182091B2 Method and apparatus for finding related documents in a collection of linked documents using a bibliographic coupling link analysis 有权
标题翻译：使用书目耦合链接分析在链接文档的集合中查找相关文档的方法和装置
公开(公告)号：US06182091B2
公开(公告)日：2001-01-30
申请号：US09407789
申请日：1999-09-29
申请人： James E. Pitkow , Peter L. Pirolli
发明人： James E. Pitkow , Peter L. Pirolli
IPC分类号： G06F1721
CPC分类号： G06F17/3061 , Y10S707/99935 , Y10S707/99943
摘要： A method and apparatus for identifying related documents in a collection of linked documents. In the method the link structure of documents to other documents are analyzed. By analyzing only the link structure, a process intensive content analysis of the documents is avoided. A citation analysis technique, such as bibliographic coupling analysis, is performed on the set of documents to extract link information. For bibliographic coupling analysis that information would include the number of other documents that a given pair of documents link to. By using the link information, related documents are identified using a suitable analysis technique, such as clustering or spreading activation.
摘要翻译：一种用于在链接文档的集合中识别相关文档的方法和装置。在该方法中，分析了文件与其他文档的链接结构。通过仅分析链接结构，避免了文档的过程密集内容分析。对文献集执行引文分析技术，如书目耦合分析，以提取链接信息。对于书目耦合分析，信息将包括给定的一对文档链接到的其他文档的数量。通过使用链接信息，使用合适的分析技术（例如聚类或扩展激活）来识别相关文档。

8. 发明授权

US5895470A System for categorizing documents in a linked collection of documents 失效
标题翻译：用于对文档的链接集合中的文档进行分类的系统
公开(公告)号：US5895470A
公开(公告)日：1999-04-20
申请号：US842926
申请日：1997-04-09
申请人： Peter L. Pirolli , James E. Pitkow , Ramana B. Rao
发明人： Peter L. Pirolli , James E. Pitkow , Ramana B. Rao
IPC分类号： G06F17/30
CPC分类号： G06F17/3069 , G06F17/30705 , G06F17/30864 , G06F17/30873 , Y10S707/917 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945
摘要： A system for extracting and analyzing information from a collection of linked documents at a locality to enable categorization of documents and prediction of documents relevant to a focus document. The system obtains and analyzes topology, usage and path information from for a collection at a locality, e.g. a web locality on the world wide web. For categorization, document meta information is represented as document vectors. Predefined criteria is applied to the document vectors to create lists of "similar" types of documents. For relevance prediction, networks representing topology, usage path and text similarity amongst the documents in the collection are created. A spreading activation technique is applied to the networks starting at a focus document to predict the documents relevant to the focus document. Using category and relevance prediction information, tools can be built to enable a user to more efficiently traverse through the collection of linked documents.
摘要翻译：一种用于从一个地点的链接文档集合中提取和分析信息的系统，以便对文档进行分类和与焦点文档相关的文档的预测。该系统从一个地点的集合中获取和分析拓扑，使用和路径信息，例如。万维网上的网站。对于分类，文档元信息被表示为文档向量。将预定义的标准应用于文档向量以创建“类似”类型的文档的列表。对于相关性预测，创建代表集合中的文档之间的拓扑，使用路径和文本相似性的网络。传播激活技术应用于从焦点文档开始的网络，以预测与焦点文档相关的文档。使用类别和相关性预测信息，可以构建工具以使用户能够更有效地遍历链接文档的集合。

9. 发明授权

US06941321B2 System and method for identifying similarities among objects in a collection 失效
标题翻译：用于识别集合中的对象之间的相似性的系统和方法
公开(公告)号：US06941321B2
公开(公告)日：2005-09-06
申请号：US09421767
申请日：1999-10-19
申请人： Hinrich Schuetze , Francine R. Chen , Peter L. Pirolli , James E. Pitkow , Ed H. Chi , Jun Li
发明人： Hinrich Schuetze , Francine R. Chen , Peter L. Pirolli , James E. Pitkow , Ed H. Chi , Jun Li
IPC分类号： G06F17/30
CPC分类号： G06F17/3071 , 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.
摘要翻译：用于从集合中浏览，检索和推荐信息的系统和方法使用集合中的文档的多模态特征，以及用户先前浏览和检索行为的分析。系统和方法以各种公开的方法为前提，用于定量表示文档集合中的文档，作为多维向量空间中的向量，定量地确定文档之间的相似性，并根据这些相似性对文档进行聚类。系统和方法还依赖于定量表示用户群体中的用户的方法，定量地确定用户之间的相似性，根据这些相似性对用户进行聚类，并且通过类似于文档集合直观地表示用户群。

10. 发明授权

US06922699B2 System and method for quantitatively representing data objects in vector space 有权
标题翻译：用于定量表示向量空间中的数据对象的系统和方法
公开(公告)号：US06922699B2
公开(公告)日：2005-07-26
申请号：US09421416
申请日：1999-10-19
申请人： Hinrich Schuetze , Francine R. Chen , Peter L. Pirolli , James E. Pitkow , Ed H. Chi , Jun Li , Ullas Gargi
发明人： Hinrich Schuetze , Francine R. Chen , Peter L. Pirolli , James E. Pitkow , Ed H. Chi , Jun Li , Ullas Gargi
IPC分类号： G06F17/30
CPC分类号： G06F17/30253 , G06F17/3025 , G06F17/30616 , G06F17/3071 , Y10S707/99933 , 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.
摘要翻译：用于从集合中浏览，检索和推荐信息的系统和方法使用集合中的文档的多模态特征，以及用户先前浏览和检索行为的分析。系统和方法以各种公开的方法为前提，用于定量表示文档集合中的文档，作为多维向量空间中的向量，定量地确定文档之间的相似性，并根据这些相似性对文档进行聚类。系统和方法还依赖于定量表示用户群体中的用户的方法，定量地确定用户之间的相似性，根据这些相似性对用户进行聚类，并且通过类似于文档集合直观地表示用户群。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式