摘要:
A computer system, method, and media for associating locations with ranked websites are provided. The computer system includes a search engine, a log database, and a location database that are employed to respond to search requests from users by returning appropriately ranked websites to the user. The websites are ranked using the location of the website and the location of the user to select websites to receive high ranks. Additionally, the search engine includes a correction feature that reevaluates locations for a website or user when a large number of obtained locations suggest a different location than a currently associated location for the website or the user.
摘要:
A computer system, method, and media for associating locations with ranked websites are provided. The computer system includes a search engine, a log database, and a location database that are employed to respond to search requests from users by returning appropriately ranked websites to the user. The websites are ranked using the location of the website and the location of the user to select websites to receive high ranks. Additionally, the search engine includes a correction feature that reevaluates locations for a website or user when a large number of obtained locations suggest a different location than a currently associated location for the website or the user.
摘要:
Methods, computer-storage media, and graphical user interfaces are provided for identifying and presenting rich related sites for task-oriented search queries. Upon receipt of a search query input by a user, one or more query logs are analyzed to determine if the search query is a related to a task being performed by the user. If the query is determined to be a task-oriented search query, search results are identified, as is one or more Uniform Resource Locators (URLs) related to a particular search result. The related URL is presented to the user in association with the particular search result. Additional controls, e.g., search tools that facilitate querying of those URLs determined to be relevant to a particular search result, may also be provided to aid the user in performing the task at hand.
摘要:
Computer-readable media and computerized methods for identifying candidate points on a graphical depiction of relative popularity of an entity (e.g., entertainer, sports team, and the like) are provided. Points on the graphical depiction are ranked based on a number of user-submitted web queries that reference the entity that are received during a particular time frame. Peak points and slope values (i.e., derived from an angle of inclination of inclines on the graphical depiction) may be captured by analyzing movements in the rank of an entity over time. An algorithmic process may then be applied to the peak points and slope values to determine points of interest of the entity's popularity, such as the highest-ranked periods and/or dramatic positive movements in rank of the entity. These points of interest are selected as candidate points and are surfaced as icons on a visual representation of the graphical depiction.
摘要:
Methods, systems, and media are provided for identifying and clustering queries that are rising in popularity. Resultant clustered queries can be compared to other stored queries using textual and temporal correlations. Fresh indices containing information and results from recently crawled content sources are searched to obtain the most recent query activity. Historical indices are also searched to obtain temporally correlated information and results that match the clustered query stream. A weighted average acceleration of a spike can be calculated to distinguish between a legitimate spike and a non-legitimate spike. Legitimate clusters are combined with other stored clusters and presented as grouped content results to a user output device.
摘要:
An approach is provided for determining related queries for a given search query based on the linking structure of electronic documents within a document set. Document titles are used to represent potential search queries and links between the electronic documents are used to determine relationships between the potential search queries. As such, the document set may be represented as a directed graph in which document titles (which represent potential search queries) are nodes and links are edges between the nodes. When a particular search query is received, a corresponding node is identified and related queries are determined by identifying other nodes having connections with that node.
摘要:
An approach is provided for determining related queries for a given search query based on the linking structure of electronic documents within a document set. Document titles are used to represent potential search queries and links between the electronic documents are used to determine relationships between the potential search queries. As such, the document set may be represented as a directed graph in which document titles (which represent potential search queries) are nodes and links are edges between the nodes. When a particular search query is received, a corresponding node is identified and related queries are determined by identifying other nodes having connections with that node.
摘要:
An inversion of the basic format of searching is provided herein. Instead of receiving a search query and providing web page results, a search engine receives a web page identifier as search input from an end user, determines related search queries for the associated web page, and provides the related search queries to the end user issuing the search. Related search queries for web pages may also be used to refine search engines performing the basic form of searching by facilitating the determination of web pages to index and the ranking of web pages as search results to user queries. Additionally, related search queries may be used in advertising revenue generation and sharing.
摘要:
An approach is provided for determining related queries for a given search query based on the linking structure of electronic documents within a document set. Document titles are used to represent potential search queries and links between the electronic documents are used to determine relationships between the potential search queries. As such, the document set may be represented as a directed graph in which document titles (which represent potential search queries) are nodes and links are edges between the nodes. When a particular search query is received, a corresponding node is identified and related queries are determined by identifying other nodes having connections with that node.
摘要:
A system and method of metadata refinement using behavioral patterns is disclosed. In some embodiments, user behavioral data for results of a search query is received. The results can include an untagged item and a plurality of tagged items. A determination can then be made that the tagged items have been assigned a first type of metadata not assigned to the untagged item. The untagged item can then be identified as a candidate to be tagged with the first type of metadata assigned to the tagged items based on the user behavioral data. In some embodiments, the user behavioral data comprises clickstream data indicating that a user selected the untagged item and the tagged items during a single search event.