Patent Document ID: 9098571
Application ID: 13357385

Base Claim:
1. A method for analyzing search query relationships, the method comprising the following operations performed by one or more processors: receiving, over an electronic network, log data relating to a plurality of search queries received from users; generating a click graph representing relationships among a plurality of queries and a plurality of visited query results associated with each of the plurality of queries, wherein the click graph depicts at least one first layer relationship between a first query and a second query in the plurality of queries, the first layer relationship indicating that at least one of the plurality of visited query results is associated with both the first query and the second query, and further wherein the click graph depicts at least one second layer relationship between the first query and second query in the plurality of queries, the second layer relationship indicating that each of the first and second queries has a first layer relationship to a third query; computing a numeric value representing a degree of the at least one second layer relationship; identifying temporal similarities between at least one pair of the plurality of queries, the temporal similarities determined based on a temporal distance between peaks in frequency of occurrence for both queries in the at least one pair of the plurality of queries; evaluating the at least one pair of queries based on the generated click graph and the identified temporal similarities to determine whether the at least one pair of queries are related; and designating the queries in the at least one pair of queries as related based on the computed value being greater than zero and the temporal distance being below a threshold value.

---

Claim 4:
4. The computer-implemented method of claim 1 , wherein the temporal distance is a Euclidean distance.