SYSTEM AND METHOD FOR RANKING SEARCH RESULTS USING CLICK
DISTANCE
Cross-Reference to Related Applications
The present invention is related to a patent application having serial
number , entitled: "System and Method for Incorporating Anchor Text into
Ranking Search Results", filed concurrently with this application. The present invention is also related to a patent application having serial number 10/804,326, entitled "Field Weighting in Text Document Searching", filed on March 18, 2004. The related applications are assigned to the assignee of the present patent application and are hereby incorporated by referepce.
Background of the Invention
In a text document search, a user typically enters a query into a search engine. The search engine evaluates the query against a database of indexed documents and returns a ranked list of documents that best satisfy the query. A score, representing a measure of how well the document satisfies the query, is algorithmically generated by the search engine. Commonly-used scoring algorithms rely on splitting the query up into search terms and using statistical information about the occurrence of individual terms in the body of text documents to be searched. The documents are listed in rank order according to their corresponding scores so the user can see the best matching search results at the top of the search results list.
Another evaluation that certain search engines may employ to improve the quality of the results is to modify the rank of the results by a selected ranking function. One exemplary prior art ranking function determines that when one page links to another page, it is effectively casting a vote for the other page. The more votes that are cast for a page, the more important the page. The ranking function can also take into account who cast the vote. The more important the page, the more important
their vote. These votes are accumulated and used as a component of the ratings of the pages on the network.
A ranking function is used to improve the quality of the ranking. However, the effectiveness of the ranking function may be affected by the topology of the network. For example, the ranking function using the votes described above may be less effectual in an intranet setting. An intranet is a network that uses some of the same protocols as the Internet, but is accessible only by a subset of users, such as employees of a corporation. The pages of an intranet are not structured or connected exactly like the Internet, and so the relevancy of the results produced by a ranking function may not be reduced as compared to the Internet setting.
Summary of the Invention
Embodiments of the present invention are related to a system and method for ranking search results according to a new function referred to as click distance. The click distance function takes advantage of the hierarchical structure of an intranet. An intranet usually follows a tree structure, with a root node and subsequent branches extending to other nodes from that root. Often the root node of the intranet is referred to as its homepage. Other sites outside of the intranet setting may also be based on a hierarchical structure, and click distance for these sites would also be highly applicable for ranking the site's pages.
Click distance is a query-independent relevance measure that measures the number of "clicks" required to reach a given page of the site. In the tree structure, the number of clicks is represented by the number of branches traversed on the path from the root node. Once the click distance is determined for a page, the click distance is incorporated into the score for the page. The page's score incorporating the click distance determines the page's rank among the other pages within the search results.
In one aspect of the present invention, the network is first "crawled" to generate a table of properties associated with the links and pages of the network. "Crawling" refers to automatically collecting several documents (or any analogous discrete unit of information) into a database referred to as an index. Crawling traverses
multiple documents on the network by following document reference links within certain documents, and then processing each document as found. The documents are processed by identifying key words or general text in the documents to create the index.
An exemplary index can be an inverted list that has a column of words and a column indicating in which documents those words can be found. When a user enters in one or more search terms, the results are obtained and the present invention applies a ranking algorithm that includes the click distance function. The click distance function positively or negatively affects the score of certain pages, refining the results returned to the user.
In another aspect of the invention, a URL (Uniform Resource Locator) depth property is added to the ranking algorithm to further refine the results. The URL depth property measures the number of levels in the URL to provide a check against the click distance function and adjust the page's score accordingly.
Brief Description of the Drawings
FIGURE 1 illustrates an exemplary computing device that may be used in one exemplary embodiment of the present invention.
FIGURE 2 illustrates a system for ranking search results according to click distance in accordance with the present invention.
FIGURE 3 illustrates an exemplary network graph in accordance with the present invention.
FIGURE 4 illustrates an exemplary hierarchical network graph in accordance with the present invention.
FIGURE 5 illustrates a logical flow diagram of an exemplary process for calculating the click distance in accordance with the present invention.
FIGURE 6 illustrates a logical flow diagram of an exemplary process for using the click distance in ranking search results in accordance with the present invention.
Detailed Description
The present invention now will be described more fully hereinafter with reference to the accompanying drawings, which form a part hereof, and which show, by way of illustration, specific exemplary embodiments for practicing the invention. This invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art. Among other things, the present invention may be embodied as methods or devices. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. The following detailed description is, therefore, not to be taken in a limiting sense.
Illustrative Operating Environment
With reference to FIGURE 1, one exemplary system for implementing the invention includes a computing device, such as computing device 100. Computing device 100 may be configured as a client, a server, mobile device, or any other computing device. In a very basic configuration, computing device 100 typically includes at least one processing unit 102 and system memory 104. Depending on the exact configuration and type of computing device, system memory 104 may be volatile (such as RAM), non-volatile (such as ROM, flash memory, etc.) or some combination of the two. System memory 104 typically includes an operating system 105, one or more applications 106, and may include program data 107. In one embodiment, application 106 includes a search ranking application 120 for implementing the functionality of the present invention. This basic configuration is illustrated in FIGURE 1 by those components within dashed line 108.
Computing device 100 may have additional features or functionality. For example, computing device 100 may also include additional data storage devices (removable and/or non-removable) such as, for example, magnetic disks, optical disks, or tape. Such additional storage is illustrated in FIGURE 1 by removable storage 109
and non-removable storage 110. Computer storage media may include volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information, such as computer readable instructions, data structures, program modules, or other data. System memory 104, removable storage 109 and non-removable storage 110 are all examples of computer storage media. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by computing device 100. Any such computer storage media may be part of device 100. Computing device 100 may also have input device(s) 112 such as keyboard, mouse, pen, voice input device, touch input device, etc. Output device(s) 114 such as a display, speakers, printer, etc. may also be included. Computing device 100 also contains communication connections 116 that allow the device to communicate with other computing devices 118, such as over a network. Communication connection 116 is one example of communication media. Communication media may typically be embodied by computer readable instructions, data structures, program modules, or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and includes any information delivery media. The term "modulated data signal" means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media. The term computer readable media as used herein includes both storage media and communication media.
Illustrative Embodiments for Ranking Searches by Click Distance
Embodiments of the present invention are related to a ranking function for a search engine. The quality of a search engine is typically determined by the relevance of the documents according to the ranks assigned by the ranking function.
The ranking function can be based on multiple features. Some of these features may depend on the query, while others are considered query independent. This invention utilizes a query-independent measure of relevance referred to as click distance Click distance is the number of "clicks" a user will have to do from the homepage of the intranet (the most authoritative URL on the intranet, or one of the most authoritative URLs) to the given page. On a web graph, the click distance can be represented as the shortest path between the homepage and the given page. In one embodiment, an algorithm performs breadth first traversal and computes distance between a given node to all other nodes in the graph. The traversal can take N iterations to complete, where N is the diameter of the graph (maximum shortest distance), to compute click distance for the intranet. The variable N in this case is much smaller than the total number of nodes on the graph. For example, N for the present invention may be between 5 and 60 depending on the network. Other ranking functions can require 40-50 iterations to cover the graph (e.g., page rank), causing the other ranking functions to be several times slower than using click distance.
FIGURE 2 illustrates a system for ranking search results according to click distance in accordance with the present invention. The search engine 200 receives a query containing multiple query terms. Each query term may include multiple component terms, such as when the query term is a phrase (e.g., the phrase "document management system" may be considered a single query term"). In addition, a query may include one or more operators, such as Boolean operators, constraints, etc., which are commonly supported by known search engines.
A plurality of documents on a distributed network, represented by documents 210, 212, 214, and 216, are available for searching. In practice, a search engine may search any number of documents and typically search collections containing large numbers (e.g., millions) of documents. The volume of documents may be reduced from the Internet setting to the intranet setting, but the reduction is usually from billions to millions so that the relative number documents is still quite large. An indexing module (not shown) generates individual document statistics (e.g., 218, 220, 222, and 224) for each document. The document statistics are stored in an index 226.
Search engine 200 consults index 226 to determine a search score 228 for each document based on the query and the corresponding document statistics. In the present invention, one of the documents statistics included is the click distance of the document. In another embodiment, another document statistic included is the URL depth associated with the document. Click distance and URL depths are then combined with query dependent statistics to form a document's final score. Typically, document scores 228 are then ranked in descending order to give the user a list of documents that are considered by the search algorithm to be most relevant to the query.
In the illustrated system, the search engine 200 represents a click distance ranking search engine, which considers the click distance of a document in determining the document's search score. Click distance rating of a document leverages the presence of the document in a hierarchically structured site (see FIGURE 3), measuring the distance from the site's homepage to the document. In one instance, the click distance from the homepage is a measure of the importance of the page, where pages closer in the hierarchy to the homepage are considered more important than the pages lower in the hierarchy. However, other scenarios may exist where the opposite holds true, where documents lower in the hierarchy are considered more than those pages higher in the hierarchy. Click distance is therefore considered a query-independent relevance measure since it rates the document's importance overall rather than according to the query (e.g., a query-dependent ranking function would be counting the number of times a search term appears in a document).
FIGURE 3 illustrates an exemplary network graph in accordance with the present invention. The network graph is comprised of nodes (e.g., 310) and edges or links (e.g., 320). The nodes (e.g., 310) represent the pages and other resources that are on the network that may be returned as results to a search query. The links (e.g., 320) connect each one of these pages together through the use of navigation links listed on the pages. A set of link information may be gathered for each page that can be used in calculating the click distance for a particular page.
In one embodiment, node 330 represents the highest authority page or root node on the network for a group of documents. The click distance for the
remaining pages of the network may be calculated from node 330. For example, node 340 has a click distance of two "clicks" from node 330. As stated above, "clicks" refers to the number of branches traversed on the shortest path from the highest authority node. Other paths from node 330 could have been chosen to reach node 340, but click distance is concerned with the shortest path.
Network graph 300 is shown with nodes that do not conform to a particular order, and may be similar to the Internet in that aspect. With the lack of order, the applicability of click distance for ranking pages may be difficult to conceptualize. However, often the network of pages and resources does conform to an applied order as shown in FIGURE 4 below.
FIGURE 4 illustrates an exemplary hierarchical network graph in accordance with the present invention. Hierarchical network graph 400 is similar to network graph 300 shown in FIGURE 3 in that it also includes nodes (e.g., 410) and links (e.g., 420). However, hierarchical network graph 400 is based on the inherent hierarchy of a structured site or intranet. Accordingly, hierarchical network graph 400 may be conceptualized as a tree structure with branches extending from a root node.
For hierarchical network graph 400, the applicability and calculation of click distance is more recognizable. For example, node 330 corresponds to the highest authority node or root node of the tree. Node 340 therefore has an associated click distance of 3, being 3 clicks or user navigations from the root node. Stated differently, since a user is required to traverse 3 branches of the tree to navigate from node 330 to node 340, the click distance is also 3.
The network graphs represented in FIGURES 3 and 4 are examples of graphs that are constructed in memory during the indexing of the documents for calculating the click distance. Constructing a graph during indexing allows the click distance to be included among the document statistics stored in the index and used for ranking the pages. Example processes for generating the click distance property and using the click distance property in ranking documents are described below in relation to FIGURES 5 and 6.
FIGURE 5 illustrates a logical flow diagram of an exemplary process for calculating the click distance (CD) in accordance with the present invention. Process 500 starts at block 502 where documents on a distributed network have been indexed and the network graph has been generated. In one embodiment, network graph is generated from data gathered by a process where link and anchor text information is gathered and attributed to specific target documents of the anchor. This process and the concept of anchor text is described more fully in a patent application having serial
number , entitled: "System and Method for Incorporating Anchor Text into
Ranking Search Results", filed concurrently with this application that is hereby incorporated by reference. Processing continues at block 504.
At block 504, the network graph is loaded into memory. This network graph is the structural representation of the document identification (e.g., document ED) and linking information gathered from the network. Examples of the network graph are shown in FIGURES 3 and 4. The network graph represents the nodes or pages of a site or intranet. Each node has an associated click distance property that has a value or weight. In one embodiment, this click distance property is concatenated onto the end of the document ID. Processing continues at block 506.
At block 506, click distance (CD) values for the nodes are initialized. The highest authority nodes are referred to as assigned nodes. These nodes are assigned a click distance value of 0 (zero). More than one high authority node may be designate for a single network graph. For example, an administrator may rank a set of 100 nodes manually and designate them all as high authority nodes. Additionally, high authority nodes do not need to have a click distance of 0 (zero), any number may be assigned by an administrator. Changing the click distance of the high authority nodes does not alter the remaining algorithm, but simply provides a method for manually designating the importance of a node. For example, an administrator can improve the click distance score of some nodes. In other cases the administrator can decrease the click distance score (by forcing click distance to be higher than computed by the algorithm by default). The click distance for each of the unassigned nodes is initialized to a maximum value. In one embodiment, the maximum value essentially sets the click
distance value to infinity. Assigning the infinity value to a node makes it easily recognizable as a node that has not had its click distance calculated. With the initializations of the click distance values complete, processing moves to block 508.
At block 508, the nodes that have an associated click distance other than the maximum value are inserted into a queue. In one example, this step only occurs in a first iteration. The nodes inserted into the queue correspond to the highest authority nodes since their click distance values are set to 0 (zero), a value other than the maximum value. Once the nodes with click distance value other than the maximum are added to the queue, processing continues at decision block 510.
At decision block 510, a determination is made whether the queue is empty. An empty queue signifies that no more nodes need the click distance of their target nodes calculated. If the queue is empty, processing moves to block 512 where process 500 ends. However, if the queue is not empty, processing continues at block 514.
At block 514, a node is removed from the queue. Removing the node from the queue initiates the calculation of the click distances for the target nodes associated with that document. Target nodes correspond to documents that have a link to them from an originating document. In this case, the originating document is the document corresponding to the node removed from the queue. Once this node is removed, processing moves to block 516.
At block 516, the next target node is fetched. The next target node refers the next document among the documents linked to by the originating document. Once the next target node is fetched, processing continues to decision block 518.
At decision block 518, a determination is made whether the click distance associated with the target node is greater than the click distance of the current page plus one (CD +1). In one embodiment, the only way the condition in block 518 is met is when the target node has a click distance of infinity (assuming that the high authority node is set to zero and an administrator has not manually set a click distance). For example, if the current click distance is 1, then CD +1=2. A click distance of 2 is less than infinity and the condition is met. Determining whether the target click
distance is greater than the click distance plus one prevents target documents with a lower click distance from being changed. Using the previous example, if the click distance of the target node is 1, and the current click distance is also 1, then the target click distance is not greater than CD + 1 = 2. In this instance, the shorter path to the target node has already been recorded and therefore need not be updated. Accordingly, when the target click distance is not greater than the current click distance plus one, processing advances to decision block 522. However, if the target click distance is greater than the current click distance plus one, processing moves to block 520.
At block 520, the click distance value of the target node is updated and the target node is added to the queue as a node where click distance calculation of its targets needs to be done. The target node is updated with a new click distance value to remove the infinity value and set the nodes calculated click distance value. In one embodiment, the click distance value of the node is set to the current click distance value plus one (CD + 1). Processing continues at decision block 522.
At decision block 522, a determination is made whether all the target nodes have been fetched for the current node removed from the queue. If there are target nodes left to fetch for the current node, processing returns to block 516 where the next target node is fetched. However, if all the target nodes corresponding to the current node have been fetched, processing returns to decision block 510 to recheck if the queue is now empty. Again, once the queue is empty, processing moves to block 512, where process 500 ends.
It is possible that not all of the nodes in a network are connected to the initial high authority nodes. Accordingly, in another embodiment of the present invention, the nodes that are not connected to the high authority nodes are assumed to have a low importance and are assigned a click distance that is less than average for the network graph.
FIGURE 6 illustrates a logical flow diagram of an exemplary process for using the click distance in ranking search results in accordance with the present invention. Process 600 starts at block 602 where a query has been requested and the
click distance for each of the documents on the network has been calculated. Processing continues at block 604.
At block 604, the click distance value for each of the documents is merged with the other document statistics (see FIGURE 2) in the index. Merging the click distance values with the other document statistics allows for a faster query response time since all the information related to ranking is clustered together. Accordingly, each document listed in the index has an associated click distance value after the merge. Once the merge is complete, processing moves to block 606.
At block 606, a scoring function is populated with the set of document statistics, including the click distance, to calculate a score for a particular document. The click distance provides a query-independent factor to the scoring function. The other portion of the scoring function corresponds to the query-dependent or content-related portion of the scoring function. In one embodiment, the scoring function is a sum of query-dependent (QD) and query-independent (QID) scoring functions:
(Equation Removed)
The QD function can be any document scoring function. In one embodiment, the QD scoring function corresponds to the field weighted scoring function described in patent application serial number 10/804,326, entitled "Field Weighting in Text Document Searching", filed on March 18, 2004 and hereby incorporated by reference. As provided by the 10/804,326 patent application the following is a representation of the field weighted scoring function:
(Equation Removed)
Wherein the terms are defined as follows: wtf is the weighted term frequency or sum of term frequencies of a given terms multiplied by weights across all properties; wdl is the weighted document length; avwdl is the average weighted document length; N is the number of documents on the network (i.e., the number of documents crawled); n is the number of documents containing the given query term; and ki and b are constants. These terms and the equation above are described in detail in the 10/804,326 patent application.
The QID function can be any transformation of click-distance and other document statistics (such as URL depth). In one embodiment this function is as follows:
Wherein the terms for the function are defined as follows: wcd is the weight of the query independent component; bcd is the weight of the click distance; bud is the weight of the URL depth; CD is the Click Distance; UD is the URL Depth; and Kcd is the click distance saturation constant. The weighted terms (wcd) bcd, and bud) assist in defining the importance of each of their related terms and ultimately the shape of the scoring functions. The URL depth (UD) is an addition to the query-independent component to smooth the effect of the click distance on the scoring function. In some cases, a document that is not very important (i.e., has a large URL depth) may have a short click distance. The URL depth counts the number of slashes in a document's URL. For example, www.example.com\dl\d2\d3\d4.htm includes four slashes and would therefore have a URL depth of 4. This document however, may have a link directly from the main page www.example.com giving it a click distance of 1. Including the URL depth term in function (3) and weighting it against the click distance, compensates for the high click distance score to more accurately reflect the page's rank within the hierarchy. Depending on the network, a URL depth of 3 or more may be considered a deep link. For this embodiment, the present invention adds the
two functions of (2) and (3) to receive the scoring function (Score), such that the new scoring function becomes:
(Equation Removed)
In other embodiments, the URL depth may be removed from the scoring function or other factors may be added to the scoring function to improve the accuracy of either the query-dependent or query-independent component. Furthermore, the query-inedependent component may be incorporated into other ranking functions not shown for improvement of the ranking results without departing from the spirit or scope of the invention. Once scoring function (4) is populated with the document statistics for a particular document, processing proceeds to block 608.
At block 608, the scoring function is executed and the relevance score for the document is calculated. Once the relevance score is calculated, it is stored in memory and associated with that particular document. Processing then moves to decision block 610.
At decision block 610, a determination is made whether relevance scores for all the documents have been calculated according to scoring function (4). The scores may be calculated serially as shown or in parallel. If all the scores have not been calculated, processing returns to block 606 where the scoring function is populated with the next set of document statistics. However, if the all the scores have been calculated, processing continues to block 612.
At block 612, the search results of the query are ranked according to their associated scores. The scores now take into account the click distance and URL depth of each of the documents. Accordingly, the ranking of the documents has been refined so that documents higher in the hierarchy of an intranet or site are ranked higher the other documents where all other factors are the same. Once the search results are ranked, processing proceeds to block 614, where process 600 ends.
After process 600 is complete, the ranked documents may be returned to the user by the various operations associated with the transmission and display of results by a search engine. The documents corresponding to the higher precision results may then be selected and viewed at the user' discretion.
The above specification, examples and data provide a complete description of the manufacture and use of the composition of the invention. Since many embodiments of the invention can be made without departing from the spirit and scope of the invention, the invention resides in the claims hereinafter appended.

We Claim:
1. A system for ranking search results, comprising a search engine on a computing device, the search engine configured to execute computer-executable instructions, which when executed by the computing system cause the computing system to perform a method comprising:
discovering a plurality of documents on a network;
recording document and link information for each of the plurality of documents on the network;
generating a representation of the network from the document and link information, wherein the representation of the network includes a plurality of nodes, each document being represented by one of the plurality of nodes, and wherein the plurality of nodes includes at least two highest authority nodes and at least two non-highest authority nodes;
computing a plurality of click distances by:
determining a first click distance for a first non-highest authority node, the first click distance being a first number of branches traversed on a first shortest path between the first non-highest authority node and a first highest authority node;
determining a second click distance for the first non-highest authority node, the second click distance being a second number of branches traversed on a second shortest path between the first non-highest authority node and a second highest authority node;
determining a third click distance for a second non-highest authority node, the third click distance being a third number of branches traversed on a third shortest path between the second non-highest authority node and the first highest authority node; and
determining a fourth click distance for the second non-highest authority node, the fourth click distance being a fourth number of branches traversed on a fourth shortest path between the second non-highest authority node and the second highest authority node;
storing the plurality of click distances in memory, such that the first and second click distances are associated with a first document, and the third and fourth click distances are associated with a second document;
calculating search rank results using at least one of the click distances associated with each of the first and second documents as a query-independent relevance measure in ranking the plurality of documents; and
storing search rank results in memory
2. The system as claimed in claim 1, wherein generating a representation of the network further comprises generating a network graph and storing the network graph into memory.
3. The system as claimed in claim 1, wherein computing a plurality of click distances further comprises merging the plurality of click distances into an index that includes one or more other ranking values that correspond to each of the first and second documents.
4. The system as claimed in claim 3 further comprising populating a scoring function is-with the plurality of click distances and the one or more other ranking values for producing a score by which the first and second documents are ranked.
5. The system as claimed in claim 1, wherein calculating search rank results using at least one of the click distances associated with each of the first and second documents as a query-independent relevance measure further comprises using a component corresponding to the plurality of click distances in a scoring function for determining a relevance score for each of the documents.
6. The system as claimed in claim 5, wherein the relevance score is offset by a Uniform Resource Locator depth property that smoothes an effect of a click distance on the scoring function when a click distance for a node is disproportionate to a depth of the node in the representation of the network.
7. The system as claimed in claim 1, wherein calculating the search rank results further comprises ranking the first and second documents according to a scoring function (score) that is determined according to at least: the at least one of the click distances associated with each of the first and second documents (CD), a weight of a query-independent component (wcd), a weight of the click distance (bcd), a weight of a URL depth (bud), the URL depth (UD) and a click distance saturation constant (Kcd).
8. The system as claimed in claim 1 wherein calculating the search rank results further comprises ranking the first and second documents according to a scoring function (score) that is determined according to at least: the at least one of the click distances associated with each of the first and second documents (CD), a weighted term frequency
(wtf), a weighted document length (wdl), an average weighted document length (avwdl), a number of documents on the network (N); a number of documents containing a query term (n), a weight of a query-independent component (wca), a weight of the click distance (bcd), a weight of a URL depth (bud), the URL depth (UD), a click distance saturation constant (Kcd) and other constant (ki, b).
9. The system as claimed in claim 8, wherein the scoring function (score) is given
by:
(Equation Removed)
10. The system as claimed in claim 1 further comprising: allowing the at least one of the click distances associated with each of the first and second documents to be manually changed.
11. A method for ranking search results, the method comprising:
discovering a plurality of documents stored on one or more computing devices in a network of computing devices;
recording document and link information for each of the plurality of documents;
generating a representation of the network from the document and link information, wherein the representation of the network includes a plurality of nodes, each document being represented by one of the plurality of nodes, and wherein the plurality of
nodes includes at least two highest authority nodes and at least two non-highest authority nodes;
computing a plurality of click distances by:
determining a first click distance for a first non-highest authority node, the first click distance being a first number of branches traversed on a first shortest path between the first non-highest authority node and a first highest authority node;
determining a second click distance for the first non-highest authority node, the second click distance being a second number of branches traversed on a second shortest path between the first non-highest authority node and a second highest authority node;
determining a third click distance for a second non-highest authority node, the third click distance being a third number of branches traversed on a third shortest path between the second non-highest authority node and the first highest authority node; and
determining a fourth click distance for the second non-highest authority node, the fourth click distance being a fourth number of branches traversed on a fourth shortest path between the second non-highest authority node and the second highest authority node;
storing the plurality of click distances in memory on a computing device in the network, such that the first and second click distances are associated with a first document, and the third and fourth click distances are associated with a second document;
calculating search rank results using at least one of the click distances associated with each of the first and second documents as a query-independent relevance measure in ranking the plurality of documents; and
storing the search rank results in the memory on the computing device.
12. The method as claimed in claim 11, wherein generating a representation of the network further comprises generating a network graph and storing the network graph into the memory.
13. The method as claimed in claim 11, wherein computing a plurality of click distances further comprises merging the plurality of click distances into an index that includes one or more other ranking values that correspond to each of the first and second documents.
14. The method as claimed in claim 12, further comprising populating a scoring function with the plurality of click distances and the one or more other ranking values for producing a score by which the first and second documents are ranked.
15. The method as claimed in claim 11, wherein calculating search rank results using at least one of the click distances associated with each of the first and second documents as a query-independent relevance measure further comprises using a component corresponding to the plurality of click distances in a scoring function for determining a relevance score for each of the documents.
16. The method as claimed in claim 15, wherein the relevance score is offset by a Uniform Resource Locator depth property that smoothes an effect of a click distance on
the scoring function when a click distance for a node is disproportionate to a depth of the node in the representation of the network.
17. The method as claimed in claim 11, wherein calculating the search rank results further comprises ranking the first and second documents according to a scoring function (score) that is determined according to at least: the at least one of the click distances associated with each of the first and second documents (CD), a weight of a query-independent component (wcd), a weight of the click distance (bcd), a weight of a URL depth (bud), the URL depth (UD) and a click distance saturation constant (Kcd).
18. The method as claimed in claim 11, wherein calculating the search rank results further comprises ranking the first and second documents according to a scoring function (score) that is determined according to at least: the at least one of the click distances associated with each of the first and second documents (CD), a weighted term frequency (wtf), a weighted document length (wdl), an average weighted document length (avwdl), a number of documents on the network (N); a number of documents containing a query term (n), a weight of a query-independent component (wcd), a weight of the click distance (bcd), a weight of a URL depth (bud), the URL depth (UD), a click distance saturation constant (Kcd) and other constant (k1, b).
19. The method as claimed in claim 18, wherein the scoring function (score) is given by:
(Equation Removed)
20. The method as claimed in claim 11, further comprising: allowing the at least one of the click distances associated with each of the first and second documents to be manually changed.