Inventors list

Assignees list

Classification tree browser

Top 100 Inventors

Top 100 Assignees

Fuxman, CA

Ariel Fuxman, Mountain View, CA US

Patent application number	Description	Published
20100287060	PROVIDING TIME-SENSITIVE INFORMATION FOR PURCHASE DETERMINATIONS - A method, system, and medium are provided that are directed to providing a user with time-sensitive information that is usable to determine when to purchase a product. In accordance with embodiments of the technology, exemplary steps include using historical product information to generate time-sensitive information. Moreover, in response to receiving from a user a request to receive information describing a given product, time-sensitive information is caused to be presented. For example, time-sensitive information might be usable by the user to determine when to purchase the given product and an alternative product.	11-11-2010
20100318539	LABELING DATA SAMPLES USING OBJECTIVE QUESTIONS - Described is a technology for obtaining labeled sample data. Labeling guidelines are converted into binary yes/no questions regarding data samples. The questions and data samples are provided to judges who then answer the questions for each sample. The answers are input to a label assignment algorithm that associates a label with each sample based upon the answers. If the guidelines are modified and previous answers to the binary questions are maintained, at least some of the previous answers may be used in re-labeling the samples in view of the modification.	12-16-2010

Ariel Fuxman, San Jose, CA US

Patent application number	Description	Published
20080243765	METHOD FOR GENERATING NESTED MAPPING SPECIFICATIONS IN A SCHEMA MAPPING FORMALISM - A method for generating nested mapping specifications and transformation queries based thereon. Basic mappings are generated based on source and target schemas and correspondences between elements of the schemas. A directed acyclic graph (DAG) is constructed whose edges represent ways in which each basic mapping is nestable under any of the other basic mappings. Any transitively implied edges are removed from the DAG. Root mappings of the DAG are identified. Trees of mappings are automatically extracted from the DAG, where each tree of mappings is rooted at a root mapping and expresses a nested mapping specification.	10-02-2008
20080243772	METHOD AND SYTSEM FOR GENERATING NESTED MAPPING SPECIFICATIONS IN A SCHEMA MAPPING FORMALISM AND FOR GENERATING TRANSFORMATION QUERIES BASED THEREON - A method and system for generating nested mapping specifications and transformation queries based thereon. Basic mappings are generated based on source and target schemas and correspondences between elements of the schemas. A directed acyclic graph (DAG) is constructed whose edges represent ways in which each basic mapping is nestable under any of the other basic mappings. Any transitively implied edges are removed from the DAG. Root mappings of the DAG are identified. Trees of mappings are automatically extracted from the DAG, where each tree of mappings is rooted at a root mapping and expresses a nested mapping specification. A transformation query is generated from the nested mapping specification by generating a first query for transforming source data into flat views of the target and a second query for nesting flat view data according to the target format. Generating the first query includes applying default Skolemization to the specification.	10-02-2008
20090006331	ENTITY-BASED BUSINESS INTELLIGENCE - A method is disclosed for conducting a query to transform data in a pre-existing database, the method comprising: collecting database information from the pre-existing database, the database information including inconsistent dimensional tables and fact tables; running an entity discovery process on the inconsistent dimensional tables and the fact tables to produce entity mapping tables; using the entity mapping tables to resolve the inconsistent dimensional tables into resolved dimensional tables; and running the query on a resolved database to obtain a query result, the resolved database including the resolved dimensional table.	01-01-2009
20090006349	ENTITY-BASED BUSINESS INTELLIGENCE - A method is disclosed for conducting a query to transform data in a pre-existing database, the method comprising: collecting database information from the pre-existing database, the database information including inconsistent dimensional tables and fact tables; running an entity discovery process on the inconsistent dimensional tables and the fact tables to produce entity mapping tables; using the entity mapping tables to resolve the inconsistent dimensional tables into resolved dimensional tables; and running the query on a resolved database to obtain a query result, the resolved database including the resolved dimensional table.	01-01-2009
20090228353	QUERY CLASSIFICATION BASED ON QUERY CLICK LOGS - Methods are provided for the classification of search engine queries and associated documents based on search engine query click logs. One or more seed documents or queries are provided that contain content that is representative of a category. A query click log containing information regarding queries entered by at least one user into the search engine and documents subsequently clicked in search engine results corresponding with the queries is analyzed to determine which one or more queries resulted in clicks on the seed documents. Information is stored associating the one or more queries with the category if they resulted in clicks on the seed documents.	09-10-2009

Ariel D. Fuxman, Mountain View, CA US

Patent application number	Description	Published
20100185577	OBJECT CLASSIFICATION USING TAXONOMIES - As provided herein objects from a source catalog, such as a provider's catalog, can be added to a target catalog, such as an enterprise master catalog, in a scalable manner utilizing catalog taxonomies. A baseline classifier determines probabilities for source objects to target catalog classes. Source objects can be assigned to those classes with probabilities that meet a desired threshold and meet a desired rate. A classification cost for target classes can be determined for respective unassigned source objects, which can comprise determining an assignment cost and separation cost for the source objects for respective desired target classes. The separation and assignment costs can be combined to determine the classification cost, and the unassigned source objects can be assigned to those classes having a desired classification cost.	07-22-2010
20110066650	QUERY CLASSIFICATION USING IMPLICIT LABELS - Described is a technology for automatically generating labeled training data for training a classifier based upon implicit information associated with the data. For example, whether a query has commercial intent can be classified based upon whether the query was submitted at a commercial website's search portal, as logged in a toolbar log. Positive candidate query-related data is extracted from the toolbar log based upon the associated implicit information. A click log is processed to obtain negative query-related data. The labeled training data is automatically generated by separating at least some of the positive candidate query data from the remaining positive candidate query data based upon the negative query data. The labeled training data may be used to train a classifier, such as to classify an online search query as having a certain type of intent or not.	03-17-2011