Method and system for generating a hyperlink-click graph
First Claim
Patent Images
1. A method of ascribing scores to each of a plurality of documents and each of a plurality of search queries, said method comprising:
- generating, from the plurality of search queries and a first subset of the plurality of documents, a click graph representative of relationships between the plurality of search queries and the documents comprising the first subset of documents;
generating, from a second subset of the documents, a hyperlink graph representative of relationships between the documents in the second subset;
generating, by using computer, a hyperlink-click graph from union of hyperlink graph and click graph, wherein;
each node of the hyperlink-click graph corresponds either to one of the plurality of documents or one of the plurality of search queries;
each directed edge between documents corresponds to the relationships defined in the hyperlink graph; and
each undirected edge between documents and search queries corresponds to the relationships defined in the click graph;
conducting a random walk on the hyperlink-click graph which accounts for browsing behavior and searching behavior;
wherein a transition-probability matrix PHC for the random walk is given by;
PHC=α
β
Nc+α
(1−
β
)NH+(1−
α
)1, whereα
is a probability that the random walk follows a link in the hyperlink graph;
β
is a rate at which the random walk switches between searching behavior and browsing behavior;
Nc is a row-stochastic version of
9 Assignments
0 Petitions
Accused Products
Abstract
A method of ascribing scores to web documents and search queries generates a hyperlink-click graph by taking the union of the hyperlink and click graphs, takes a random walk on the hyperlink-click graph, and associates the transition probabilities resulting from the random walk with scores for each of the documents and search queries.
23 Citations
21 Claims
-
1. A method of ascribing scores to each of a plurality of documents and each of a plurality of search queries, said method comprising:
-
generating, from the plurality of search queries and a first subset of the plurality of documents, a click graph representative of relationships between the plurality of search queries and the documents comprising the first subset of documents; generating, from a second subset of the documents, a hyperlink graph representative of relationships between the documents in the second subset; generating, by using computer, a hyperlink-click graph from union of hyperlink graph and click graph, wherein; each node of the hyperlink-click graph corresponds either to one of the plurality of documents or one of the plurality of search queries; each directed edge between documents corresponds to the relationships defined in the hyperlink graph; and each undirected edge between documents and search queries corresponds to the relationships defined in the click graph; conducting a random walk on the hyperlink-click graph which accounts for browsing behavior and searching behavior; wherein a transition-probability matrix PHC for the random walk is given by; PHC=α
β
Nc+α
(1−
β
)NH+(1−
α
)1, whereα
is a probability that the random walk follows a link in the hyperlink graph;β
is a rate at which the random walk switches between searching behavior and browsing behavior;Nc is a row-stochastic version of - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method of ascribing scores to each of a plurality of documents and each of a plurality of search queries, said method comprising:
-
generating, by using a computer, a hyperlink-click graph wherein; each node of the hyperlink-click graph corresponds either to one of the plurality of documents or to one of the plurality of search queries; each directed edge corresponds to a relationship between two of the plurality of documents; and each undirected edge corresponds to a relationship between one of the plurality of search queries and one of the plurality of documents, each document is associated with a search result related to search query; conducting a random walk on the hyperlink-click graph which accounts for browsing behavior and searching behavior; wherein a transition-probability matrix PHC for the random walk is given by; PHC=α
β
Nc+α
(1−
β
)NH+(1−
α
) 1, whereα
is a probability that the random walk follows a link, in the hyperlink-click graph, representative of a relationship between documents of the plurality of documents;62 is a rate at which the random walk switches between searching behavior and browsing behavior; Nc is a row-stochastic version of
-
-
10. A system, comprising:
-
a processor; one or more non-transitory computer-readable media; a click graph generator to generate, from a plurality of search queries and a first subset of a plurality of documents, a click graph representative of relationships between the plurality of search queries and the documents comprising the first subset of documents; a hyperlink graph generator to generate, from a second subset of the documents, a hyperlink graph representative of relationships between the documents in the second subset; a hyperlink-click graph generator to generate a hyperlink-click graph from union of hyperlink graph and click graph, wherein; each node of the hyperlink-click graph corresponds either to one of the plurality of documents or one of the plurality of search queries; each directed edge between documents corresponds to the relationships defined in the hyperlink graph; and each undirected edge between documents and search queries corresponds to the relationships defined in the click graph; and a random walker to; conduct a random walk on the hyperlink-click graph which accounts for browsing behavior and searching behavior; and associate, for each of the plurality of documents and search queries, a transition probability resulting from the random walk with a score; wherein a transition-probability matrix PHC for the random walk is given by; PHC=α
β
Nc+α
(1−
β
)NH+(1−
α
)1, whereα
is a probability that the random walk follows a link in the hyperlink graph;β
is a rate at which the random walk switches between searching behavior and browsing behavior;Nc is a row-stochastic version of
-
-
11. A non-transitory computer-readable medium encoded with a set of instructions which, when performed by a computer, cause the computer to perform steps of ascribing scores to each of a plurality of documents and each of a plurality of search queries, said steps comprising:
-
generating, from the plurality of search queries and a first subset of the plurality of documents, a click graph representative of relationships between the plurality of search queries and the documents comprising the first subset of documents; generating, from a second subset of the documents, a hyperlink graph representative of relationships between the documents in the second subset; generating a hyperlink-click graph from union of hyperlink graph and click graph, wherein; each node of hyperlink-click graph corresponds either to one of the plurality of documents or one of the plurality of search queries; each directed edge between documents corresponds to the relationships defined in the hyperlink graph; and each undirected edge between documents and search queries corresponds to the relationships defined in the click graph; conducting a random walk on the hyperlink-click graph which accounts for browsing behavior and searching behavior; wherein a transition-probability matrix PHC for the random walk is given by; PHC=α
β
Nc+α
(1−
β
)NH+(1−
α
)1, whereα
is a probability that the random walk follows a link in the hyperlink graph;β
is a rate at which the random walk switches between searching behavior and browsing behavior;Nc is a row-stochastic version of - View Dependent Claims (12, 13, 14, 15, 16, 17, 18)
-
-
19. A non-transitory computer-readable medium encoded with a set of instructions which, when performed by a computer, cause the computer to perform steps of ascribing scores to each of a plurality of documents and each of a plurality of search queries, said steps comprising:
-
generating a hyperlink-click graph wherein; each node of hyperlink-click graph corresponds either to one of the plurality of documents or to one of the plurality of search queries; each directed edge corresponds to a relationship between two of the plurality of documents; and each undirected edge corresponds to a relationship between one of the plurality of search queries and one of the plurality of documents, which document is associated with a search result related to a search query; conducting a random walk on the hyperlink-click graph which accounts for browsing behavior and searching behavior; wherein a transition-probability matrix PHC for the random walk is given by; PHC=α
β
Nc+α
(1−
β
)NH+(1α
)1, whereα
is a probability that the random walk follows a link, in the hyperlink-click graph, representative of a relationship between documents of the plurality of documents;β
is a rate at which the random walk switches between searching behavior and browsing behavior;Nc is a row-stochastic version of
-
-
20. A method of generating and using a hyperlink-click graph, wherein the hyperlink-click graph comprises a plurality of nodes, a plurality of directed edges, and a plurality of undirected edges, said method comprising the steps of:
-
taking a union of a hyperlink graph and a click graph, such that; each resultant node corresponds either to one of a plurality of documents or to one of a plurality of search queries; each resultant directed edge corresponds to a relationship between two of the plurality of documents; and each resultant undirected edge corresponds to a relationship between one of a plurality of search queries and one of a plurality of documents, each document is associated with a search result related to a search query;
conducting, by using a computer, a random walk on the union of the hyperlink graph and the click graph which accounts for browsing behavior and searching behavior;wherein a transition-probability matrix PHC for the random walk is given by; PHC=α
β
Nc+α
(1−
β
)NH+(1−
α
) 1, whereα
is the probability that the random walk follows a link, in the union of the hyperlink graph and the click graph, representative of a relationship between documents of the plurality of documents;β
is the rate at which the random walk switches between searching behavior and browsing behavior;Nc is the row-stochastic version of
-
-
21. A non-transitory computer-readable medium encoded with a set of instructions for generating and using a hyperlink-click graph, wherein the hyperlink-click graph comprises a plurality of nodes, a plurality of directed edges, and a plurality of undirected edges, wherein the set of instructions when executed by a computer cause the computer to perform steps comprising:
-
taking a union of a hyperlink graph and a click graph, such that; each resultant node corresponds either to one of a plurality of documents or to one of a plurality of search queries; each resultant directed edge corresponds to a relationship between two of the plurality of documents; and each resultant undirected edge corresponds to a relationship between one of a plurality of search queries and one of a plurality of documents, each document is associated with a search result related to a search query; conducting a random walk on the union of the hyperlink graph and the click graph which accounts for browsing behavior and searching behavior; wherein a transition-probability matrix PHC for the random walk is given by; PHC=α
β
Nc+α
(1−
β
)NH+(1−
α
) 1, whereα
is a probability that the random walk follows a link, in the union of the hyperlink graph and the click graph, representative of a relationship between documents of the plurality of documents;β
is a rate at which the random walk switches between searching behavior and browsing behavior;Nc is a row-stochastic version of
-
Specification