摘要:
Methods and computer-readable media are provided for determining suggested queries. A user enters a search website, and the user is identified based on a user identification. Suggested queries are determined based on a group associated with the user. This association is created by extracting queries from data logs, categorizing the queries into groups based on their respective subject matter, associating the user with one or more groups, and determining suggested queries for each group. The suggested queries are communicated for display.
摘要:
A gaming environment is provided by an MVP gaming system provider in which “most valuable player” (MVP) gamers may compete. MVP gamers may be identified using achievements, gamer scores, game play during sanctioned gaming events, or other indicia of game skills. The MVP gamers may be sponsored by advertisers, and the MVP gamers' avatars may be branded based on sponsorship during gaming events. The sponsorships may be brokered by the MVP gaming system provider. Some gaming events may be sanctioned gaming events that are coordinated by the MVP gaming system provider and “televised” to allow viewers to watch the gaming events. Tutorials from MVP gamers may also be provided to gamers for viewing to assist in their game play. Further, gamers may be able to rent the avatars of MVP gamers for use during their game play.
摘要:
Data, such as product data or airline flight data, is represented using structured data tuples, tables, or as data with related metadata and tags, and stored by a search engine. Partial queries are received by the search engine from a user and are used to generate a dialog between the search engine and the user. The dialog may include suggested query completions for the partial queries that correspond to a schema associated with the data tuples. The suggested query completions may be determined using attribute combinations of attributes and attribute values, or metadata and tags associated with the data tuples, including known synonyms and misspellings. The user may interact with the query completions in the dialog, and the search engine may revise the dialog and the query completions according to the interactions. A user may query data tuples without knowing the schema used by the underlying data structures.
摘要:
A long-term personal agent program, executable as network service and/or on one or more user computing devices and related method for identifying opportunities and making recommendations on behalf of one or more users, are disclosed herein. In one example, the personal agent program includes a monitoring engine configured to monitor and interpret a user's activities over time with a plurality of sensing and logging methodologies according to user authorization, the use of statistical methods for learning to understand a user's goals and behavioral patterns from data, and the use of procedures for computing the expected value of information guiding sensing and logging in different contexts. The personal agent further may include a recommendation methodology configured to make suggestions and to take actions on behalf of the user, in the present moment as well as for future times, based on inferences about user goals and opportunities in the world.
摘要:
Methods and systems for automatically synthesizing product information from multiple data sources into an on-line catalog are disclosed, and in particular, for automatically synthesizing the product information based on attribute-value pairs. Information for a product may be obtained, via entity extraction, feed ingestion, and other mechanisms, from a plurality of structured and unstructured data sources having different taxonomies and schemas. Product information may additionally or alternatively be obtained or derived based on popularity data. The product information may be cleansed, segmented and normalized. The product information may be clustered so closest products, attribute names and attribute values are associated. A representative value for an attribute name may be determined, and the on-line catalog may be updated so that entries are comprehensive, meaningful and useful to a catalog user. Updates from at least 500 million different data sources may be scheduled to occur as frequently as several times daily.
摘要:
Systems and methods for dynamic pricing in real-time marketplace transactions are provided. A method may include receiving a request from a bid agent associated with a location-aware user device, and an offer for goods/services from an offer agent that is associated with a merchant device. The offer may include an inventory and one or more locations of the goods/services. The method includes determining a location of the location-aware user device, and determining whether the inventory and the one or more locations of the goods/services are sufficient to satisfy the request. If so, then the method includes establishing a real-time dynamic marketplace session between the offer agent and the bid agent to facilitate a negotiation for the goods/services. Upon receiving an acceptance from the offer agent for a bid from the bid agent, the method includes processing a purchase transaction for the goods/services.
摘要:
Previously received queries from a search log are analyzed to determine a category of structured data associated with each query. For example, the categories may correspond to consumer product categories such as televisions, digital cameras, etc. For each category, the terms of the queries associated with the category are correlated with the attributes and attribute values of the structured data tuples associated with the category. The attributes may be ranked based on the correlation. When a subsequent query is received, the category of the query is determined and the ranked attributes associated with the category are used to select facets that are displayed to the user along with the search results.
摘要:
A structured query may specify attribute values for attributes. An estimate of the number of items that will match the structured query if it is applied to a structured database is determined. If the estimated number of items is below a threshold, the structured query may be relaxed to form new candidate structured queries. The number of candidate queries may be determined based on a desired running time. Each of the candidate structured queries may be determined by changing one or more attribute values of the attributes of the structured query. Estimates of the number of items each of the candidate structured queries will match is determined, and the candidate structured query that has the highest matching estimation is used to query the database. The matching results may be output.
摘要:
Described is answering online web queries from a structured data store, such as a products database. An online web search query is modified into an evaluation expression for accessing a structured data store (e.g., a database, XML file, a flat table) to find search results. A query is matched to a pattern, which is used to generate the expression, as well as determine to which structured data store the query is routed. Tokens (e.g., words) in the query are processed against a dictionary of token classes (sets of tokens) and patterns (sets of token classes) to annotate the query to map the query to the matching pattern. A translation process generates the expression based on translation hints that correspond to the matching pattern. Also described is offline mining of query logs to generate the dictionaries.
摘要:
A structured query may specify attribute values for attributes. An estimate of the number of items that will match the structured query if it is applied to a structured database is determined. If the estimated number of items is below a threshold, the structured query may be relaxed to form new candidate structured queries. The number of candidate queries may be determined based on a desired running time. Each of the candidate structured queries may be determined by changing one or more attribute values of the attributes of the structured query. Estimates of the number of items each of the candidate structured queries will match is determined, and the candidate structured query that has the highest matching estimation is used to query the database. The matching results may be output.