Method and apparatus for finding related documents in a collection of linked documents using a bibliographic coupling link analysis

[0002] This Application is a Continuation in Part of U.S. patent application Ser. No. 09/044,693 filed Mar. 18, 1998 entitled “Method and Apparatus For Clustering A Collection of Linked Documents Using Co-Citation Analysis”.

[0003] The present invention is related to the field of analysis of linked collections of documents, and in particular to analyzing the link structure of documents to identify documents having similar content.

[0004] The ever-increasing universe of electronic information, for example as found on the World Wide Web (herein after referred to as the Web), competes for the effectively fixed and limited attention of people. Both consumers and producers of information want to understand what kinds of information are available, how desirable it is, and how its content and use change through time.

[0005] Making sense of very large collections of linked documents and foraging for information in such environments is difficult without specialized aids. Collections of linked documents are often connected together using hypertext links. The basic structure of linked hypertext is designed to promote the process of browsing from one document to another along hypertext links, which is unfortunately very slow and inefficient when hypertext collections become very large and heterogeneous. Two sorts of aids have evolved in such situations. The first are structures or tools that abstract and cluster information in some form of classification system. Examples of such would be library card catalogs and the Yahoo! Web site. The second are systems that attempt to predict the information relevant to a user's needs and to order the presentation of information accordingly. Examples would include search engines such as Lycos, which take a user's specifications of an information need, in the form of words and phrases, and return ranked lists of documents that are predicted to be relevant to the user's need.

[0006] Another system which provides aids in searching for information on the Web is the “Recommend” feature provided on the Alexa Internet Web site (URL: http://www.alexa.com). The “Recommend” feature provides a list of related Web pages that a user may want to retrieve and view based on the Web page that they are currently viewing.

[0007] It has been determined that one way to facilitate information seeking is through automatic categorization of Web Pages. One technique for categorization of Web pages is described by P. Pirolli, J. Pitkow and R. Rao in the publication entitled Silk from a Sow's Ear: Extracting Usable Structures from the Web, Conference on Human Factors in Computing Systems (CHI 96), Vancouver British Columbia, Canada, April 1996. Described therein is a categorization technique wherein each Web page is represented as a feature vector, with features extracted from information about text-content similarity, hypertext connections, and usage patterns. Web pages belonging to the same category, may then be clustered together. Categorization is computed based on inter-document similarities among these feature vectors.

[0008] Another aid for making sense of such collections is clustering. One way to approach the automatic clustering of linked documents is to adapt the existing approaches of clustering standard text documents. Such an approach is described by Cutting et al., in the publication entitled “Scatter/gather: A cluster based approach to browsing large document Collections”, The 15^thAnnual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 318-329, August 1992. However, there are several impracticalities with such existing text-clustering techniques. Text-based clustering typically involves computing inter-document similarities based on content-word frequency statistics. Not only is this often expensive, but, more importantly, its effectiveness was developed and tuned on human-readable texts. It appears, though, that the proportion of human-readable source files for Web pages is decreasing with the infusion of dynamic and programmed pages.

[0009] Another option for performing clustering of document collections is to look at usage patterns. Unfortunately, any clustering based on usage patterns requires access to data that is not usually recorded in any easily accessible format. In the case of the Web, while a moderate amount of usage information is recorded for each requested document at a particular Web site, the log files for other sites are not publicly accessible. Thus while the usage for a particular site can be ascertained, this information is not available for the other 500,000 Web sites that currently exist.

[0010] Other attempts at clustering hypertext typically utilize the hypertext link topology of the collection. Such techniques are described by R. A. Botafogo, E. Rivlin, and B. Schneiderman, Structural Analysis of Hypertexts: Identifying Hierarchies And Useful Metrics, ACM Transactions on Information Systems, 10(2):142-180, 1992. Such a basis for clustering makes intuitive sense since the links of a particular document represent what the author felt was of interest to the reader of the document. These known clustering methods have been applied to collections with several hundred elements, and do not seem particularly suited to scale gracefully to large heterogeneous collections like the Web, where it has been estimated that there are over 70 million text-based documents which currently exist.

[0011] While clustering or categorizing at the document level is important, it is also desirable to be able to cluster at the collection or web site level. Search engines such as Yahoo® can return results to queries separated into categories, web sites and web pages. While this may provide a categorization of sorts relative to the search terms, it does not take into account any relationships that the sites themselves may define. For example, a response to a query may return sites A and B. Suppose site A contains links to site X and Site B contains a link to site Y. The set generated as a result of the query does not indicate the relationships between sites A and X or sites B and Y. This is important because of the inconsistent use of terms as meta-data for the sites could result in some relevant sites being missed.

[0012] Other publications relevant to the invention of the present application:

[0013] Larson, Ray R., Bibliometrics of the World Wide Web: An Exploratory Analysis of the Intellectual Structure of Cyberspace, Proceedings of 59^thASIS Annual Meeting held in Baltimore Md., edited by Steve Hardin, Vol. 33:71-78, Information Today Inc., 1996.

[0014] A method and apparatus for identifying related documents in a collection of linked documents is disclosed. 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 may then be identified using a suitable analysis technique, such as clustering or spreading activation.

[0015] The method of the present invention is preferably practiced on the documents found on the World Wide Web (web pages) and utilizes a form of citation analysis known bibliographic coupling analysis. The method is practiced on a set of web pages and is generally comprised of the steps of: identifying document pairs; finding the bibliographic coupling strength for the document pairs; normalizing the bibliographic coupling strength information; and performing a suitable operation utilizing said bibliographic coupling strength information, such as clustering or spreading activation, to find related web pages.

[0016] FIG. 1 is a block diagram illustrating the underlying structure of a Web Page.

[0017] FIG. 2 is a flowchart illustrating the basic steps for the co-citation analysis and resulting clustering as may be performed in the currently preferred embodiment of the present invention.

[0018] FIG. 3 is a flowchart illustrating the steps for performing an “all pair” clustering of a list of co-cited Web pages as may be performed in the currently preferred embodiment of the present invention.

[0019] FIG. 4 is a flowchart illustrating the steps for performing a statistical clustering of a list of co-cited Web pages as may be performed in the currently preferred embodiment of the present invention.

[0020] FIG. 5 is a diagrammatic representation of a plurality of documents and their links used for the purpose of describing an example of the co-citation analysis of the currently preferred embodiment of the present invention.

[0021] FIGS. 6a-6fis a diagrammatic representation of the list of co-cited pairs generated from FIG. 5 and are used for the purpose of describing an example of the “all-pairs” method of clustering web pages in the currently preferred embodiment of the present invention.

[0022] FIG. 7 is a flowchart illustrating the steps for creating a matrix indicating the bibliographic coupling amongst documents in a collection of linked documents as may be performed in the currently performed embodiment.

[0023] FIG. 8 is a diagrammatic representation of the result of spreading activation to predict relevant web pages to a set of source web pages, as may be performed in the currently preferred embodiment of the present invention.

[0024] FIG. 9 is a flowchart illustrating the steps of using citation analysis and spreading activation for predicting relevant web pages to a set of source web pages, as may be performed in the currently preferred embodiment of the present invention.

[0025] FIG. 10 is a block diagram of a computer based system upon which the currently preferred embodiment of the present invention may be implemented.

[0026] A system for analyzing a retrieved set of linked documents for the purpose of finding closely related document collections (e.g. web sites) is disclosed. The information derived from such a system may be used to aid a user in finding desired information or be fed into other computations useful in analysis of collections of linked documents (e.g. spreading activation), or in creating visualizations of the collections.

[0027] The currently preferred embodiment of the present invention is implemented for analyzing collections of linked documents (i.e. Web Pages) residing on the portion of the Internet known as the World Wide Web (hereinafter the Web). The Web is the portion of the Internet that is used to store and access linked documents. A Web page may have multi-media content as well as relative and absolute links to other pages. A Web Site is a collection of related Web pages associated with an entity having a presence on the World Wide Web such as a company, educational institute or the like.

[0028] In this description, the term Web page is an instance of a linked document and the two terms may be used interchangeably. Moreover, it should be noted that the present invention is not limited to use on the Web and may be utilized in any system which provides access to linked entities, including documents, images, videos, audio, etc.

[0029] It has been observed that a collection of Web pages has a topology that is defined by links contained in the individual Web pages. Links are an indicator on a Web page which refers to another Web page and which can typically be retrieved in a point and click fashion. The link will specify the address, i.e. Uniform Resource Locator or URL, of the other Web page.

[0030] FIG. 1 is a block diagram illustrating the underlying structure of a Web page. As would be known by one of ordinary skill in the art, such a Web page would be typically specified in a mark-up language such as the Hyper-text Mark-Up Language (HTML) or the Extensible Mark-Up Language (XML) and which would be viewable via a Web Browser. A Web Browser is a tool which enables a user to traverse through and view documents residing on the Web. Other rendering means associated with the Browser will permit listening to audio portions of a document or viewing video or image portions of a document. Examples of commercially available Web Browsers include Netscape Navigator™, available from Netscape Communications Corporation, and Internet Explorer™, available from the Microsoft Corporation.

[0031] In any event, the Web Page 101 has text content part 102 and links 103-105. The text content part 102 is merely the standard text of a document. The links 103-105 may be represented on a rendered page as either text (e.g. links 103-104) or image (e.g. link 105). As illustrated in FIG. 1, when the link is represented as text, it is visually distinct from ordinary text. In FIG. 1 the links 103 and 104 are underlined.

[0032] Making sense of the millions of web pages available on the Web is a daunting and difficult task. As a way of circumventing these difficulties, in the currently preferred embodiment of the present invention, co-citation analysis has been utilized as a way to cluster groups of web pages. The adaptation of this clustering technique is based solely on the analysis of hypertext link topology of a collection of Web pages. Unlike earlier link-topology techniques, co-citation analysis builds upon the notion that when a Web page D contains links referring to documents A and B, then A and B are related in some manner in the mind of the person who produced the document. In this example, documents A and B are said to be co-cited. It is important to note that links between document A and document B may or may not exist. Given this property of picking up patterns from the implicit topological structure of hypertext documents, it has been determined that co-citation analysis is useful in telling us something about the semantic structure of a collection and the thinking of the authoring community.

[0033] Overview of Co-Citation Analysis

[0034] Citation indexing, the creation of an index that details the explicit linkages of citations between papers, has been employed as a tool to facilitate the searching and the management of information for over a century, dating back to the legal profession's use of the Shepard's Citationsin 1873. The field underwent major advances during the post World War II increase in scientific expenditures and subsequent explosive increase in the scientific literature. With the intent of ensuring information exchange among scientists, the United States government initiated a number of projects to generate indexes without human involvement. Citation indexing was found to be a powerful yet simple tool, as it replaces an indexer's subjective judgements with author's citations, thus avoiding many of the semantic problems found in term and title based analyses. See the publication E. Garfield. Citation Indexing: ISI Press, Philadelphia, Pa., 1979 for more information.

[0035] It was not until the mid-1970s however that Small and Griffith described a co-citation analysis as a method for measuring the common intellectual interest between a pair of documents. See H. Small and B. Griffith. The structure of scientific literatures, Identifying and graphing specialties, Science Studies, 4(17):17-40, 1974. The principal component of co-citation analysis measures the number of documents that have cited a given pair of documents together. This metric is referred to as co-citation strength. Unlike other forms of citation analysis, co-citation strength is able to reflect the frequency of items being cited over time, thus enabling deeper insight into the development of certain research fields and other semantic structures within a citation index. Similarly, it has been determined that co-citation analysis yields insight into the implicit semantic structures of the Web.

[0036] The original method developed by Small and Griffith takes a citation index as initial input. Recall that a citation index is an index that details the explicit linkages of citations between papers. For all documents in the index, the number of times a document was cited is computed and those documents whose cited frequency falls above a specific threshold are kept for further processing. This prefiltering retains the most important (or at least the most popular) documents. Next, the extracted documents are sorted and all pairs of documents that have been cited together by the same source document are formed. The resulting list contains unique co-citation pairs and their associated frequency of co-occurrence.

[0037] The final step in co-citation analysis creates a set of clusters whose elements are indirectly or directly related by co-citation. This is accomplished by clustering all documents that have at least one document of the co-citation pair in common with the other elements in the cluster. To start, a pair is selected, say AB, and all pairs that contain A or B are added to the cluster. Next, all pairs that include a document that have been included in the cluster are added. This processes repeats until there are no pairs that have a document in common with the elements in the cluster. At this point, a new pair is selected from the remaining pairs to form a new cluster and the processes repeated until all pairs belong to a cluster. This clustering technique is referred to herein as the All-Pairs method.

[0038] Bibliograhic Coupling

[0039] Another well known technique for citation analysis is bibliographic coupling, e.g. see the text “INTRODUCTION TO INFORMETRICS Quantitative Methods in Library, Documentation and Information Science” by Leo Egge and Ronald Rousseau, Elsevier Science Publishers (1990). Bibliographic coupling is the inverse transformation of co-citation analysis. In bibliographic coupling, a document collection is analyzed to create document pairs and an indicator of the number of common documents that they both cite. Since bibliographic coupling is merely the inverse transformation of a co-citation matrix, the resulting analysis techniques described herein with respect to co-citation matrix, other than how to generate a co-citation matrix, would apply equally to bibliographic coupling. A technique for finding pairs and the number of documents they both cite is described below.

[0040] Bibliographic coupling has features that distinguish it from co-citation analysis. First, bibliographic coupling is more time invariant than co-citation analysis, i.e. once two documents are coupled, the coupling strength never changes until one of the document's hyperlink structure changes. The exact opposite occurs with co-citation analysis, since the co-citation/hyperlink strength of a pair of documents depends upon the number of documents that reference it, which changes as more documents are created that reference the pair. Thus, a bibliographic coupling analysis can be computed less frequently than a co-citation analysis. As applied to the Web, bibliographic coupling also reflects the state of field/area at the time the documents were created, providing interesting insights into the evolution of Web pages and ideas and Web sites.

[0041] An exemplary process of bibliographic coupling on a set of documents is described with reference to the flowchart of FIG. 7. Referring to FIG. 7, first document pairs are identified from the set, step 701. For each document pair, the number of documents which each are linked to by both documents is determined, step 702. The number of documents is an indication of the “strength” of the bibliographic coupling. This is accomplished by generating a link index for each document and then comparing the index for each document. Recall that a link index is merely a list of links contained in a document. For web pages, links are identified by specific “tags” placed before them in mark-up language such as HTML (HyperText Mark-up Language) or XML (eXtensible Mark-up Language). Next, the strength values are normalized, step 703. This normalization takes in account the variations in the lengths of the reference lists for each document (i.e. the number of links to other documents). Finally, the strength values can be used as input for subsequent analysis, such clustering or relevance prediction, step 704. Such clustering and relevance prediction techniques described with respect to usage of co-citation lists would apply equally to bibliographic coupling strength information, perhaps with slight modifications. For example, in the aforementioned All-Pairs method of clustering, the clustering could be premised on each of the document pairs added to a cluster having a particular bibliographic coupling strength.

[0042] Application to the Web

[0043] It has been observed that the properties that fueled the development of citation and co-citation analysis are similar to those found between documents on the Web. The links found in Web pages, when employed in a non-random format, provide semantic linkages between objects, much in the same manner that citations link documents to other related documents. The resulting topology of a Web site reflects the organization of a community and its knowledge base, similar to the way in which citations in a scholarly paper reflect a scientific community's organization of knowledge.

[0044] It could be argued that links often serve as just navigational aids. This may be true for example for many of the links found on a “home page” for a particular Web locality. However, the role of hyperlinks for navigation may still be viewed as a hypothesis by the hypertext author(s) that the person interested in the current page will also be interested in browsing the linked pages. It has been determined that given the close resemblance of hyperlinks to citations, meaningful structures would emerge as the result of co-citation analysis on Web site.

[0045] An example of application of co-citation analysis as applied to the Web is found in a publication by Larson, Ray R., Bibliometrics of the World Wide Web: An Exploratory Analysis of the Intellectual Structure of Cyberspace, Proceedings of 59^thASIS Annual Meeting held in Baltimore Maryland, Vol. 33:71-78, Information Today Inc., 1996. In the publication Larson uses co-citation analysis to examine the “bibliometrics” of the Web so as to map its contents.

[0046] Generally speaking, the clustering of Web pages is useful in that it aids in the sense-making of large document collections, i.e. understanding its content and the relationship amongst the various documents. Further, clustering may be used as a real time aid in searching document collections using scatter-gather techniques. The clustering of the present invention may be used in any of these settings.

[0047] Method For Clustering Web Pages

[0048] The currently preferred embodiment of the present invention is implemented using software programs which inspect the mark-up language (e.g. HTML) representations of the documents. As would be known by one of ordinary skill in the art, links are identified by specific “tags” placed before them as defined by the mark-up language. Identification of links is thus accomplished by looking for the specific tags. In any event, the first step is to gather a document collection, step 201. This may be done by a specific query to the Web, using a document retrieval system such as Lycos™, Excite™, etc. or using a Web walker which automatically follows the links on a document and collects the linked documents. Or the document collection could be some randomly selected collection of documents. Or the document collection could be a particular Web site or set of Web sites or even the entire Web itself. Next, for each document, determine the frequency of linkage, i.e. the number of times it is linked to by another document in the collection, step 202. This may be accomplished by maintaining a table data structure having a document identifier field and link count field which is updated upon occurrence of a link to that document. This is done to get a relative sense of the “relatedness” of a document in the context of the particular document collection. Next, the documents are thresholded based on some specified minimum frequency of linkage, step 203 and the unused documents are discarded, step 204. This is essentially done as a matter of computational efficiency as documents below some minimum threshold are deemed “unrelated” to the other documents in the document collection. It should be noted that this threshold value should be established so as not to preclude relevant “young” documents that may not have many links to it at the time of analysis. A good threshold value yields the right number of clusters at the right size. It has been determined that a threshold value that is set too high causes a few clusters with a large number of documents and with many clusters with a small number of documents. If the threshold value is set too low, the result is fewer clusters with fewer documents in each. Note that preferably the threshold value can be changed by a user until the desired cluster characteristics are achieved.

[0049] Next, a co-citation list of pairs of documents that are linked to by the same document is created, step 205. Each of the pairs of documents will also have a count of the number of times (the co-citation frequency) that they were both linked to by another document. The co-citation list may typically be generated and comprised of a table data structure having a first field identifying a co-citation pair and a second field having a count of the number of times that the co-citation pair were linked to by the same document.

[0050] A suitable clustering operation is then performed on the co-citation list to generate co-citation clusters, step 206. Such suitable clustering operations are described in more detail below. The individual documents are then identified from the co-citation clusters and provided as a document cluster, step 207. This is performed since each document is typically referenced in multiple of the co-citation pairs.

[0051] A first type of clustering utilizes a technique known as transitive closure. Transitive closure is generally related to identification of self-contained sets of node link structures, i.e. no node (document) has a link to another node (document) outside of the set. The clustering techniques using transitive closure can be generally described as follows:

[0052] Given S=the set of all documents; V=the links contained in each document; G=<S,V>=the graph of nodes S and links V

[0053] Step 1: Let Result={ }

[0054] Step 2: Pick a node i in S

[0055] Step 3: Find the transitive closure of i in G->C(i)

[0056] Step 4: Reset S<-S-C(i) and Add C(l) to Result Set

[0057] Step 5: Loop Steps 2-4 until S={ }

[0058] Step 6: Return Result Set

[0059] The step 3 may be accomplished using a transitive closure technique such as the well known Floyd-Warshall technique.

[0060] A transitive closure clustering method, referred to as the all-pairs method is described with reference to the flowchart of FIG. 3. The objective of the all-pairs method is to place in a cluster all pairs having at least one common link. Referring to FIG. 3, a first pair having a first page link reference (A) and a second page link reference (B) is selected, step 301. This represents a first cluster. Next, the list is scanned to find all pairs having a link reference to A or a link reference to B, step 302. Each of the pairs so identified is then identified as being in the first cluster, step 303. The steps 302-303 are repeated recursively for each of the co-citation pairs in the cluster until all pairs having a common link reference are included in the first cluster, step 304. The steps 301-304 are then repeated using the remaining pairs of the original co-citation list until all clusters have been identified, step 305. The “all-pairs” method of clustering is described in greater detail below with respect to FIG. 6.

[0061] An alternative technique may use some form of statistical clustering. Such statistical clustering is generally described in the flowchart of FIG. 4. Referring to FIG. 4, first a distance or similarity matrix is computed, step 401. In the currently preferred embodiment, the Euclidean distance matrix on the log transformed co-citation frequencies is computed. However, other known methods that may be utilized include Manhattan, maximum, and binary distance metrics. One may also compute the correlation coefficients for each cell. In any event, the matrix is run through a suitable clustering algorithm, step 402. In the currently preferred embodiment, the Euclidean distance matrix is run through complete linkage clustering method to obtain clustering. However, other forms of clustering may be utilized.

[0062] It should be noted that clustering techniques usually fall into one of two categories: hierarchical techniques (in particular agglomerative and divisive) and partitioning techniques. Agglomerative methods start with each element in a single cluster and successively merges the closest pairs. Common forms of this are Ward's clustering and hierarchical clustering. Divisive methods start with all the elements as one cluster and splits until each element is in a separate cluster. Two common forms of this are diana and mona. Partitioning methods divide the elements into a pre-defined number of clusters. A common form of this is called k-means. For a description of other suitable clustering techniques see the text entitled Finding Groups in Data An Introduction to Cluster Analysis, Leonard Kaufman, Peter J. Rousseeuw, published by John Wiley & Sons, New York, 1990.

[0063] Example of the Co-citation Analysis and Clustering of the Currently Preferred Embodiment

[0064] What follows is an example that illustrates the co-citation analysis of the present invention. It is assumed that each of the documents has met the threshold requirement of being “linked” to a minimum number of times. FIG. 5 illustrates a plurality of documents 501-506 having defined links. As illustrated document A 501 has links 510-511, document B 502 has links 520-521, document C 503 has links 530-532, the document X 504 has links 540-541, document Y 505 has links 550-551 and document Z 506 has links 560-562. It can then be seen that the co-citation pairs from the respective documents are:

[0065] document A 501: (C,D)

[0066] document B 502: (C,D)

[0067] document C 503: (A,B), (A,D), (B,D)

[0068] document X 504: (Z,W)

[0069] document Y F 505: (Z,W)

[0070] document Z 506: (X,Y), (X,W), (Y,W)

[0071] The co-citation list and associated frequency then becomes:

[0072] (C,D):2, (A,D):1, (A,B):1, (B,D):1, (Z,W):2, (X,Y):1, (X,W):1, (Y,W):1

[0073] FIGS. 6a-6fillustrates use of the “all-pairs” method for clustering the co-citation list. Note that the co-citation method does not utilize the frequency of the co-citation. That is typically used in statistical clustering techniques. Referring to FIG. 6a, a list 610 and cluster 1620 are illustrated. The elements 601-607 in the list 610 are the elements in the co-citation list generated with respect to the example of FIG. 5, except for the list pair 600 which is used as the randomly selected initial pairing for cluster 1620.

[0074] Referring to FIG. 6b, added to cluster 1620 are the co-citation pairs from the list which have either a C or D in them. So as illustrated the pairs 601 and 603 have been added to cluster 1 and removed from the list 610.

[0075] Referring now to FIG. 6c, as a result of the addition of co-citation pair 601 to cluster 1, any co-citation pair having an A is added to the cluster. This results in the co-citation pair 600 being added to cluster 1620. Note that as a result of the addition to cluster 1 of co-citation pair 603, the list would be inspected for any pair having a B. But since no pair in the list 610 contains a B, illustration of such a step has been omitted.

[0076] Referring now to FIG. 6d, a cluster 2630 is now being formed. This is illustrated by addition of pair 604 to cluster 2630. Referring now to FIG. 6e, the pairs 606 and 607 have been added to cluster 2630 as a result of the each having a link to W. Finally, referring to FIG. 6f, the pair 605 is added to the cluster 2630 as a result of having a link to Y.

[0077] It should be noted that the citation analysis described above may also be applied to find related document collections (or web sites). Such application is described in co-pending application serial No. Not Yet Assigned, entitled “Method and Apparatus For Finding Related Collections of Linked Documents Using Co-Citation Analysis” and which is assigned to the same assignee as the present application.

[0078] Visualizations of Document Clusters and Collections

[0079] Most current Web browsers provide very little support for helping people gain an overall assessment of the structure and content of large collections of Web pages. Information Visualization could be used to provide an interactive overview of web localities that facilitates navigation and general assessment. Visualizations have been developed that provide new interactive mechanisms for making sense of information sets with thousands of objects. The general approach is to map properties and relations of large collections of objects onto visual, interactive structures.

[0080] The document clustering of the present invention may be used to support such Information Visualization. To the extent that the properties that help users navigate around the space and remember locations or ones that support the unit tasks of the user's work, the visualizations provide value to the user. Visualizations can be applied to the Web by treating the pages of the Web as objects with properties. Each of these visualizations provide an overview of a Web site in terms of some simple property of the pages. For example, the clustering of web pages as may be performed in the present invention may be used to create new document collections for use by other information visualization techniques, such as the WebBook described in co-pending and commonly assigned application Ser. No. 08/525,936 entitled “Display System For Displaying Lists of Linked Documents”, to form and present larger aggregates of related Web pages. Other examples include a Cone Tree which shows the connectivity structure between pages and a Perspective Wall which shows time-indexed accesses of the pages. The cone tree is described in U.S. Pat. No. 5,295,243 entitled “Display of Hierarchical Three-Dimensional Structures With Rotating Substructures”. The Perspective Wall is described in U.S. Pat. No. 5,339,390 entitled “Operating A Processor To Display Stretched Continuation Of A Workspace”.

[0081] Using Citation Networks in Spreading Activation

[0082] The generated co-citation matrix may also be used in combination with a spreading activation technique. The preferred technique used for spreading activation is described in U.S. Pat. No. 5,835,905, which is assigned to the same assignee of the present application and which is incorporated by reference herein. Using the citation link structure may be in place of content similarity information, which can be computationally intensive to obtain.

[0083] As described by P. Pirolli, J. Pitkow and R. Rao in the publication entitled Silk from a Sow's Ear: Extracting Usable Structures from the Web, Conference on Human Factors in Computing Systems (CHI 96), Vancouver British Columbia, Canada, April 1996, spreading activation has been applied to the Web as a technique that can be used to make predictions as to pages relevant to a particular set of source pages. See also the aforementioned U.S. Pat. No. 5,835,905. Spreading activation may also be used to create a document ranking, as described in co-pending application Ser. No. 09/163,595 filed Sep. 29, 1998 and assigned to the same assignee as the present application.

[0084] Spreading Activation

[0085] An activation network can be represented as a graph defined by matrix R, where each off-diagonal element R_i,jcontains the strength of association between nodes i and j, and the diagonal contains zeros. The strengths determine how much activation flows from node to node. The set of source nodes of activation being pumped into the network is represented by a vector C, where C_irepresents the activation pumped in by node i. The dynamics of activation can be modeled over discrete steps t=1, 2, . . . N, with activation at step t represented by a vector A(t), with element A(t, i) representing the activation at node i at step t. The time evolution of the flow of activation is determined by

[0086] A(t)=C+M A(t−1)  Equation 1

[0087] where M is a matrix that determines the flow and decay of activation among nodes. It is specified by

[0088] M=(1−g)I+a R,  Equation 2

[0089] where g<1 is a parameter determining the relaxation of node activity back to zero when it receives no additional activation input, and a is a parameter denoting the amount of activation spread from a node to its neighbors. I is the identity matrix.

[0090] As indicated above, a decay function is a critical analytical component of the spreading activation used in the present invention. A decay function, such as the one described in U.S. patent application Ser. No. 09/535,616, is used to generate decay values for dampening activation through a network. This decay function is referred to as “the law of surfing” and is an indication of the likelihood that a user will “click-on” or traverse to another document in a document collection. In any event, depending on the nature of the decay function, activation values are assumed to be the predicted relevance to the input focus (or the probability that a page will be needed given the pages in the input focus).

[0091] Networks for Spreading Activation

[0092] As noted above, a network is used to represent strength of associations among linked documents as reflected by some predetermined criteria. The network or graph is represented by matrices in the spreading activation equation. That is, each row corresponds to a network node representing a Web page, and similarly each column corresponds to a network node representing a Web page. If we index the 1,2, . . . , N Web pages, there would be i=1,2, . . . N columns and j=1,2, . . . N rows for each matrix representing a graph network. Here, the criteria would be based on the citation structure and network would embody a generated co-citation matrix.

[0093] Each entry in the i^thcolumn and j^throw of a matrix represents the strength of connection between page i and page j (or similarly, the amount of potential activation flow or capacity). As described above, the meaning of these entries varies depending on the type of network through which activation is being spread. In the currently preferred embodiment, the entry values represent citation frequencies between pages.

[0094] The Result of Spreading Activation

[0095] Spreading activation across a network and finding related pages is described conceptually with reference to FIG. 8. Referring to FIG. 8, activation 801 is pumped into one or more of the graph networks 802 at nodes representing some starting set of focus Web pages. The activation flows through the arcs of the graph structure, with the amount of flow modulated by the arc strengths (which might also be thought of as arc flow capacities) and dampened by the probability values provided by the decay function (e.g. the law of surfing). The asymptotic pattern of activation over nodes, as illustrated by bars 804 contained in the nodes at activated network 803, will define a number of hits of other Web pages relative to the starting set of focus Web pages.

[0096] Utilizing citation analysis in combination with spreading activation is described with respect to the flowchart of FIG. 9. First, a collection of documents is identified or otherwise obtained, step 901. This may be as a result of a search, crawl or search. Generally, these documents have some relationship. Next, citation information is generated from the collection of documents, step 902. This can be performed using the steps described above with respect to generation of a co-citation pairs or bibliographic coupled pairs. The citation information is then used to create a citation matrix, which will embody the association matrix, step 903. Creation of the citation matrix is a straightforward task of creating a matrix with the pages on each axis and the matrix entries representing the co-citation frequency.

[0097] An initialization matrix is then created, step 904. The initialization matrix represents the initial focus set of pages at which activation will be started. This focus set of pages may be obtained in various ways such as a current page being viewed, a history of pages of viewed or the results of a search. Spreading activation is then performed using a suitable spreading activation technique, step 905. The spreading activation utilizes the above generated initial activation matrix, citation matrix and a decay function. Activation information relating to the documents in the collection is extracted when a stable pattern of activation across all nodes (i.e. web pages) is settled into, step 906. Relationships may then be determined based on the measured level of activation, step 907. For example, the documents with the highest levels of activation can be identified as related.

[0098] Overview of a Computer Controlled Display System In the Currently Preferred Embodiment of the Present Invention

[0099] The computer based system on which the currently preferred embodiment of the present invention may be implemented is described with reference to FIG. 10. As noted above, the present invention is implemented using software programming instructions for execution on a computer based system. The computer based system and associated operating instructions (e.g. software) embody circuitry used to implement the present invention. Referring to FIG. 10, the computer based system is comprised of a plurality of components coupled via a bus 1001. The bus 1001 may consist of a plurality of parallel buses (e.g. address, data and status buses) as well as a hierarchy of buses (e.g. a processor bus, a local bus and an I/O bus). In any event, the computer system is further comprised of a processor 1002 for executing instructions provided via bus 1001 from Internal memory 1003 (note that the Internal memory 1003 is typically a combination of Random Access and Read Only Memories). The processor 1002 will be used to perform various operations in support extracting raw data from Web site, converting the raw data into the desired feature vectors and topology, usage path and text similarity matrices, categorization and spreading activation. Instructions for performing such operations are retrieved from Internal memory 1003. Such operations that would be performed by the processor 1002 would include the processing steps described in the flowcharts of FIGS. 2-4, 7 and 8 and the accompanying descriptions. The operations would typically be provided in the form of coded instructions in a suitable programming language using well-known programming techniques. The processor 1002 and Internal memory 1003 may be discrete components or a single integrated device such as an Application Specification Integrated Circuit (ASIC) chip.

[0100] Also coupled to the bus 1001 are a keyboard 1004 for entering alphanumeric input, external storage 1005 for storing data, a cursor control device 1006 for manipulating a cursor, a display 1007 for displaying visual output and a network connection 1008. The keyboard 1004 would typically be a standard QWERTY keyboard but may also be telephone like keypad. The external storage 1005 may be fixed or removable magnetic or optical disk drive. The cursor control device 1006, e.g. a mouse or trackball, will typically have a button or switch associated with it to which the performance of certain functions can be programmed. The network connection 1008 provides means for attaching to a network, e.g. a Local Area Network (LAN) card or modem card with appropriate software. The network ultimately attached to is the Internet, but it may be through proxy servers or intermediary networks or dial-up services such as America On-Line®, Prodigy® or CompuServe®.

[0101] Thus, a method and system for analyzing a collection of linked documents for the purposes of identifying related documents is disclosed. While the present invention is described with respect to a preferred embodiment, it would be apparent to one skilled in the art to practice the present invention with other configurations of digital document management and access systems. Such alternate embodiments would not cause departure from the spirit and scope of the present invention.