公开(公告)号：WO0067159A3

公开(公告)日：2002-03-28

申请号：PCT/US0012042

申请日：2000-05-04

Applicant: XEROX CORP

Inventor： ADAR EYTAN ,  BREUEL THOMAS M ,  CASS TODD A ,  PITKOW JAMES E ,  SCHUETZE HINRICH

IPC: G06F17/30

CPC classification number: G06F17/30884 ,  Y10S707/99933 ,  Y10S707/99934

Abstract: A search and recommendation system employs the preferences and profiles of individual users and groups within a community of users, as well as information derived from shared document bookmarks, to augment Internet searches, re-rank search results, and provide recommendations for documents based on a subject-matter query. The search and recommendation system operates in the context of a shared bookmark manager, which stores individual users' bookmarks (some of which may be published or shared for group use) on a centralized bookmark database connected to the Internet. The shared bookmark manager is implemented as a distributed program, portions of which operate on users' terminals and other portions of which operate on the centralized bookmark database.

Abstract translation: 搜索和推荐系统采用用户社区内的个人用户和组的偏好和简档，以及从共享文档书签获得的信息，以增强互联网搜索，重新排列搜索结果，并提供基于 主题查询。 搜索和推荐系统在共享书签管理器的上下文中操作，该管理器在连接到因特网的集中式书签数据库上存储单个用户的书签（其中一些可以被发布或共享用于组使用）。 共享书签管理器被实现为分布式程序，其中的一部分在用户终端上操作，其他部分在集中式书签数据库上操作。

公开(公告)号：AU4695900A

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

申请号：AU4695900

申请日：2000-05-04

Applicant: XEROX CORP

Inventor： ADAR EYTAN ,  BREUEL THOMAS M ,  CASS TODD A ,  PITKOW JAMES E ,  SCHUETZE HINRICH

IPC: G06F17/30

Abstract: A search and recommendation system employs the preferences and profiles of individual users and groups within a community of users, as well as information derived from categorically organized content pointers, to augment Internet searches, re-rank search results, and provide recommendations for objects based on an initial subject-matter query. The search and recommendation system operates in the context of a content pointer manager, which stores individual users' content pointers (some of which may be published or shared for group use) on a centralized content pointer database connected to the Internet. The shared content pointer manager is implemented as a distributed program, portions of which operate on users' terminals and other portions of which operate on the centralized content pointer database. A user's content pointers are organized in accordance with a local topical categorical hierarchy. The hierarchical organization is used to define a relevance context within which returned objects are evaluated and ordered.

公开(公告)号：BR0002300A

公开(公告)日：2001-01-02

申请号：BR0002300

申请日：2000-05-05

Applicant: XEROX CORP

Inventor： ADAR EYTAN ,  BREUEL THOMAS M ,  CASS TODD A ,  PITKOW JAMES E ,  SCHUETZE HINRICH

IPC: G06F17/30 ,  G06F7/06

Abstract: A search and recommendation system employs the preferences and profiles of individual users and groups within a community of users, as well as information derived from categorically organized content pointers, to augment Internet searches, re-rank search results, and provide recommendations for objects based on an initial subject-matter query. The search and recommendation system operates in the context of a content pointer manager, which stores individual users' content pointers (some of which may be published or shared for group use) on a centralized content pointer database connected to the Internet. The shared content pointer manager is implemented as a distributed program, portions of which operate on users' terminals and other portions of which operate on the centralized content pointer database. A user's content pointers are organized in accordance with a local topical categorical hierarchy. The hierarchical organization is used to define a relevance context within which returned objects are evaluated and ordered.

公开(公告)号：BR9901365A

公开(公告)日：2000-03-28

申请号：BR9901365

申请日：1999-04-19

Applicant: XEROX CORP

Inventor： PIROLLI PETER L T ,  PITKOW JAMES E ,  CHI ED H ,  CARD STUART K ,  MACKINLAY JOCK D ,  GOSSWELLER RICH

IPC: G06F17/30

Abstract: 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.

公开(公告)号：CA2339319A1

公开(公告)日：2001-09-30

申请号：CA2339319

申请日：2001-03-02

Applicant: XEROX CORP

Inventor： PITKOW JAMES E ,  CHI ED H ,  PIROLLI PETER L

IPC: G06F17/30 ,  G06F17/00 ,  G06F11/30 ,  G06F17/60

Abstract: 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 identifie d 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 t o an initial condition.

公开(公告)号：BR9901367A

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

申请号：BR9901367

申请日：1999-04-19

Applicant: XEROX CORP

Inventor： CHI ED H ,  PIROLLI PETER L T ,  PITKOW JAMES E ,  GOSSWELLER RICH ,  MACKINLAY JOCK D ,  CARD STUART K

IPC: G06F12/00 ,  G06F17/30

Abstract: 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.

公开(公告)号：DE60044220D1

公开(公告)日：2010-06-02

申请号：DE60044220

申请日：2000-01-24

Applicant: XEROX CORP

Inventor： CHEN FRANCINE R ,  SCHUETZE HINRICH ,  GARGI ULLAS ,  PITKOW JAMES E ,  PIROLLI PETER L ,  CHI ED H ,  LI JUN ,  NILES LESLIE T

IPC: G06F17/30 ,  G06F12/00

公开(公告)号：DE60029914T2

公开(公告)日：2007-01-18

申请号：DE60029914

申请日：2000-12-15

Applicant: XEROX CORP

Inventor： GLANCE NATALIE S ,  HUBERMAN BERNARDO A ,  ADAMIC LADA A ,  PITKOW JAMES E

IPC: G06F12/00 ,  G06F17/30

Abstract: A system (10) and method of caching uses quality or value attributes, provided for example, by a recommender system (16) or by a dynamical analysis of site accesses, which are attached to cached information to prioritize items in the cache (24). Documents are prioritized in the cache according to the relative value of their content. Value data may be provided from a recommender system (16) which provides a value for a document according to user recommendations (using explicit recommendations) or from statistical analysis of site visits from unique users (implicit recommendations) or a combination of the two to identify the higher value documents. The caching method may also be used to improve performance of a recommender system (16).

公开(公告)号：DE60029914D1

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

申请号：DE60029914

申请日：2000-12-15

Applicant: XEROX CORP

Inventor： GLANCE NATALIE S ,  HUBERMAN BERNARDO A ,  ADAMIC LADA A ,  PITKOW JAMES E

IPC: G06F12/00 ,  G06F17/30

Abstract: A system (10) and method of caching uses quality or value attributes, provided for example, by a recommender system (16) or by a dynamical analysis of site accesses, which are attached to cached information to prioritize items in the cache (24). Documents are prioritized in the cache according to the relative value of their content. Value data may be provided from a recommender system (16) which provides a value for a document according to user recommendations (using explicit recommendations) or from statistical analysis of site visits from unique users (implicit recommendations) or a combination of the two to identify the higher value documents. The caching method may also be used to improve performance of a recommender system (16).

公开(公告)号：BR9901366A

公开(公告)日：2000-09-12

申请号：BR9901366

申请日：1999-04-19

Applicant: XEROX CORP

Inventor： PITKOW JAMES E ,  PIROLLI PETER L T ,  CHI ED H ,  CARD STUART K ,  MACKINLAY JOCK D ,  GOSSWELLER RICH

IPC: G06F12/00 ,  G06F17/30

Abstract: 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.