Method for Calculating Score for Search Query
First Claim
1. A method for calculating a score for a query that is input by a user to a search engine, the method comprising the steps of:
- storing historical data including a query log and click-through data, the query log including a keyword as the query, a URL as a search result by the search engine, and ranking of the URL, and the click-through data being related to the URL;
analyzing the historical data for generating a graph structure of a query definition, wherein the query is a node and a plurality of nodes are connected by URLs that are common to the plurality of nodes, the URLs being browsed based on the search result corresponding to the query of the node;
extracting, from the graph structure, combinations of recommendation source queries and recommended queries which are connected by URLs;
calculating a score for the combinations extracted in the extracting step, based on the click-through data and ranking data; and
associating at least one combination extracted in the extracting step with one recommendation source query.
3 Assignments
0 Petitions
Accused Products
Abstract
A method and system for automatically calculating, regarding an input search query, a score for evaluating a new query or URL which is a candidate for recommendation information according to a user'"'"'s search intention. To this end, a recommendation server 10 extracts recommended queries or URLs regarding a certain query, and configures a graph structure in which a plurality of queries are sequentially connected via URLs, based on historical data of URLs searched and browsed by the user in the past. The recommendation server 10 then calculates a score for indicating a degree of popularity of each query, by analyzing a relationship between input and output of edges, i.e. a linking relationship of URLs, in which each query is a node in this graph structure.
181 Citations
13 Claims
-
1. A method for calculating a score for a query that is input by a user to a search engine, the method comprising the steps of:
-
storing historical data including a query log and click-through data, the query log including a keyword as the query, a URL as a search result by the search engine, and ranking of the URL, and the click-through data being related to the URL; analyzing the historical data for generating a graph structure of a query definition, wherein the query is a node and a plurality of nodes are connected by URLs that are common to the plurality of nodes, the URLs being browsed based on the search result corresponding to the query of the node; extracting, from the graph structure, combinations of recommendation source queries and recommended queries which are connected by URLs; calculating a score for the combinations extracted in the extracting step, based on the click-through data and ranking data; and associating at least one combination extracted in the extracting step with one recommendation source query. - View Dependent Claims (2)
-
-
3. A method for calculating a score for a query that is input by a user to a search engine in a server that is connected, via a network, to a terminal device and a search server provided with the predetermined search engine, the method comprising the steps of:
-
storing, as historical data, a query input to the search engine from the terminal device, a URL browsed based on a search result of the search engine in response to the input of the query, and ranking of the URL browsed in the search result, so as to be associated with one another; extracting, based on the stored historical data, combinations including recommendation source queries, URLs and recommended queries, wherein, among a plurality of queries associated with the same URL, each respective query having an evaluation value high in ranking is included in the recommended queries, and wherein queries other than the recommended queries are the recommendation source queries; and calculating a score for each query input by the user, by analyzing a relationship between input and output of edges in a graph structure which is configured by a set of the extracted combinations, and in which a plurality of queries are connected via URLs, wherein each query is a node of the graph structure. - View Dependent Claims (5, 7, 8, 9, 10, 11)
-
-
4. A method for calculating a score for a URL associated with a query that is input by a user to a search engine in a server that is connected, via a network, to a terminal device and a search server provided with the search engine, the method comprising the steps of:
-
storing, as historical data, a query input to the search engine from the terminal device, a URL browsed based on a search result of the search engine in response to the input of the query, and ranking of the URL browsed in the search result, so as to be associated with one another; extracting, based on the stored historical data, combinations including recommendation source queries, URLs and recommended queries, wherein, among a plurality of queries associated with the same URL, each respective query having an evaluation value high in ranking is included in the recommended queries, and wherein queries other than the recommended queries are the recommendation source queries; and calculating a score for each of the URLs, by analyzing a relationship between input and output of edges in a graph structure which is configured by a set of the extracted combinations, and in which a plurality of URLs are connected via queries, wherein each URL is a node of the graph structure. - View Dependent Claims (6)
-
-
12. An apparatus for calculating a score for a query that is input by a user to a search engine, the apparatus being connected, via a network, to a terminal device and a search server provided with the predetermined search engine, the apparatus comprising:
-
storing means for storing, as historical data, a query input to the search engine from the terminal device, a URL browsed based on a search result of the search engine in response to the input of the query, and ranking of the URL browsed in the search result, so as to be associated with one another; extracting means for extracting, based on the stored historical data, combinations including recommendation source queries, URLs and recommended queries, wherein, among a plurality of queries associated with the same URL, each respective query having an evaluation value high in ranking is included in the recommended queries, and wherein queries other than the recommended queries are the recommendation source queries; and calculating means for calculating a score for each query input by the user, by analyzing a relationship between input and output of edges in a graph structure which is configured by a set of the extracted combinations, and in which a plurality of queries are connected via URLs, wherein each query is a node of the graph structure.
-
-
13. An apparatus for calculating a score for a URL associated with a query that is input by a user to a search engine, the apparatus being connected, via a network, to a terminal device and a search server provided with the predetermined search engine, the apparatus comprising:
-
storing means for storing, as historical data, a query input to the search engine from the terminal device, a URL browsed based on a search result of the search engine in response to the input of the query, and ranking of the URL browsed in the search result, so as to be associated with one another; extracting means for extracting, based on the stored historical data, combinations including recommendation source queries, URLs and recommended queries, wherein, among a plurality of queries associated with the same URL, each respective query having an evaluation value high in ranking is included in the recommended queries, and wherein queries other than the recommended queries are the recommendation source queries; and calculating means for calculating a score for each of the URLs, by analyzing a relationship between input and output of edges in a graph structure which is configured by a set of the extracted combinations, and in which a plurality of URLs are connected via queries, wherein each URL is a node of the graph structure.
-
Specification