Patents by Inventor Olivier Chapelle

Olivier Chapelle has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20090150309
    Abstract: An improved system and method is provided for training a multi-class support vector machine to select a common subset of features for classifying objects. A multi-class support vector machine generator may be provided for learning classification functions to classify sets of objects into classes and may include a sparse support vector machine modeling engine for training a multi-class support vector machine using scaling factors by simultaneously selecting a common subset of features iteratively for all classes from sets of features representing each of the classes. An objective function using scaling factors to ensure sparsity of features may be iteratively minimized, and features may be retained and added until a small set of features stabilizes. Alternatively, a common subset of features may be found by iteratively removing at least one feature simultaneously for all classes from an active set of features initialized to represent the entire set of training features.
    Type: Application
    Filed: December 10, 2007
    Publication date: June 11, 2009
    Applicant: Yahoo! Inc.
    Inventors: Olivier Chapelle, Sathiya Keerthi Selvaraj
  • Publication number: 20090138463
    Abstract: Methods, systems, and apparatuses for generating relevance functions for ranking documents obtained in searches are provided. One or more features to be used as predictor variables in the construction of a relevance function are determined. The relevance function is parameterized by one or more coefficients. An ideal query error is defined that measures, for a given query, a difference between a ranking generated by the relevance function and a ranking based on a training set. According to a structured output learning framework, values for the coefficients of the relevance function are determined to substantially minimize an objective function that depends on a continuous upper bound of the defined ideal query error.
    Type: Application
    Filed: November 28, 2007
    Publication date: May 28, 2009
    Applicant: YAHOO! INC.
    Inventor: Olivier Chapelle
  • Publication number: 20090089274
    Abstract: Methods, systems, and apparatuses for generating relevance functions for ranking documents obtained in searches are provided. One or more features to be used as predictor variables in the construction of a relevance function are determined. The relevance function is parameterized by one or more coefficients. A query error is defined that measures a difference between a relevance ranking generated by the relevance function and a training set relevance ranking based on a query and a set of scored documents associated with the query. The query error is a continuous function of the coefficients and aims at approximating errors measures commonly used in Information Retrieval. Values for the coefficients of the relevance function are determined that substantially minimize an objective function that depends on the defined query error.
    Type: Application
    Filed: September 28, 2007
    Publication date: April 2, 2009
    Applicant: YAHOO! INC.
    Inventor: Olivier Chapelle
  • Publication number: 20080301070
    Abstract: Learning machines, such as support vector machines, are used to analyze datasets to recognize patterns within the dataset using kernels that are selected according to the nature of the data to be analyzed. Where the datasets possesses structural characteristics, locational kernels can be utilized to provide measures of similarity among data points within the dataset. The locational kernels are then combined to generate a decision function, or kernel, that can be used to analyze the dataset. Where an invariance transformation or noise is present, tangent vectors are defined to identify relationships between the invariance or noise and the data points. A covariance matrix is formed using the tangent vectors, then used in generation of the kernel.
    Type: Application
    Filed: October 30, 2007
    Publication date: December 4, 2008
    Inventors: Peter L. Bartlett, Andre Elisseeff, Bernhard Schoelkopf, Olivier Chapelle
  • Publication number: 20080097940
    Abstract: Support vector machines are used to classify data contained within a structured dataset such as a plurality of signals generated by a spectral analyzer. The signals are pre-processed to ensure alignment of peaks across the spectra. Similarity measures are constructed to provide a basis for comparison of pairs of samples of the signal. A support vector machine is trained to discriminate between different classes of the samples. to identify the most predictive features within the spectra. In a preferred embodiment feature selection is performed to reduce the number of features that must be considered.
    Type: Application
    Filed: October 30, 2007
    Publication date: April 24, 2008
    Inventors: Asa Ben-Hur, Andre Elisseeff, Olivier Chapelle, Jason Weston
  • Publication number: 20080027886
    Abstract: This invention concerns data mining, that is the extraction of information, from “unlearnable” data sets. In particular it concerns apparatus and a method for this purpose. The invention involves creating a finite training sample from the data set (14). Then training (50) a learning device (32) using a supervised learning algorithm to predict labels for each item of the training sample. Then processing other data from the data set with the trained learning device to predict labels and determining whether the predicted labels are better (learnable) or worse (anti-learnable) than random guessing (52). And, using a reverser (34) to apply negative weighting to the predicted labels if it is worse (anti-learnable) (54).
    Type: Application
    Filed: July 18, 2005
    Publication date: January 31, 2008
    Inventors: Adam Kowalczyk, Alex Smola, Cheng Ong, Olivier Chapelle
  • Publication number: 20050228591
    Abstract: Support vector machines are used to classify data contained within a structured dataset such as a plurality of signals generated by a spectral analyzer. The signals are preprocessed to ensure alignment of peaks across the spectra. Similarity measures are constructed to provide a basis for comparison of pairs of samples of the signal. A support vector machine is trained to discriminate between different classes of the samples. to identify the most predictive features within the spectra. In a preferred embodiment feature selection is performed to reduce the number of features that must be considered.
    Type: Application
    Filed: October 9, 2002
    Publication date: October 13, 2005
    Inventors: Asa Hur, Andre Ellisseeff, Olivier Chapelle, Jason Weston