Patents by Inventor Patrice Y. Simard
Patrice Y. Simard 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).
-
Patent number: 9104960Abstract: Methods, systems, and computer-storage media having computer-usable instructions embodied thereon for calculating event probabilities are provided. The event may be a click probability. Event probabilities are calculated using a system optimized for runtime model accuracy with an operable learning algorithm. Bin counting techniques are used to calculate event probabilities based on a count of event occurrences and non-event occurrences. Linear parameters, such and counts of clicks and non-clicks, may also be used in the system to allow for runtime adjustments.Type: GrantFiled: June 20, 2011Date of Patent: August 11, 2015Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Leon Bottou, Kumar Chellapilla, Patrice Y. Simard, David Max Chickering
-
Publication number: 20150161365Abstract: Human Interaction Proofs (“HIPs”, sometimes referred to as “captchas”), may be generated automatically. An captcha specification language may be defined, which allows a captcha scheme to be defined in terms of how symbols are to be chosen and drawn, and how those symbols are obscured. The language may provide mechanisms to specify the various ways in which to obscure symbols. New captcha schemes may be generated from existing specifications, by using genetic algorithms that combine features from existing captcha schemes that have been successful. Moreover, the likelihood that a captcha scheme has been broken by attackers may be estimated by collecting data on the time that it takes existing captcha schemes to be broken, and using regression to estimate the time to breakage as a function of either the captcha's features or its measured quality.Type: ApplicationFiled: February 18, 2015Publication date: June 11, 2015Inventors: Geoffrey J. Hulten, Patrice Y. Simard, Darko Kirovski, Jesper B. Lind, Christopher A. Meek
-
Patent number: 8978144Abstract: Human Interaction Proofs (“HIPs”, sometimes referred to as “captchas”), may be generated automatically. An captcha specification language may be defined, which allows a captcha scheme to be defined in terms of how symbols are to be chosen and drawn, and how those symbols are obscured. The language may provide mechanisms to specify the various ways in which to obscure symbols. New captcha schemes may be generated from existing specifications, by using genetic algorithms that combine features from existing captcha schemes that have been successful. Moreover, the likelihood that a captcha scheme has been broken by attackers may be estimated by collecting data on the time that it takes existing captcha schemes to be broken, and using regression to estimate the time to breakage as a function of either the captcha's features or its measured quality.Type: GrantFiled: May 19, 2014Date of Patent: March 10, 2015Assignee: Microsoft CorporationInventors: Geoffrey J. Hulten, Patrice Y. Simard, Darko Kirovski, Jesper B. Lind, Christopher A. Meek
-
Publication number: 20150019211Abstract: A collection of data that is extremely large can be difficult to search and/or analyze. Relevance may be dramatically improved by automatically classifying queries and web pages in useful categories, and using these classification scores as relevance features. A thorough approach may require building a large number of classifiers, corresponding to the various types of information, activities, and products. Creation of classifiers and schematizers is provided on large data sets. Exercising the classifiers and schematizers on hundreds of millions of items may expose value that is inherent to the data by adding usable meta-data. Some aspects include active labeling exploration, automatic regularization and cold start, scaling with the number of items and the number of classifiers, active featuring, and segmentation and schematization.Type: ApplicationFiled: November 8, 2013Publication date: January 15, 2015Applicant: Microsoft CorportionInventors: PATRICE Y. SIMARD, DAVID G. GRANGIER, LEON BOTTOU, SALEEMA A. AMERSHI
-
Publication number: 20150019460Abstract: A collection of data that is extremely large can be difficult to search and/or analyze. Relevance may be dramatically improved by automatically classifying queries and web pages in useful categories, and using these classification scores as relevance features. A thorough approach may require building a large number of classifiers, corresponding to the various types of information, activities, and products. Creation of classifiers and schematizers is provided on large data sets. Exercising the classifiers and schematizers on hundreds of millions of items may expose value that is inherent to the data by adding usable meta-data. Some aspects include active labeling exploration, automatic regularization and cold start, scaling with the number of items and the number of classifiers, active featuring, and segmentation and schematization.Type: ApplicationFiled: November 8, 2013Publication date: January 15, 2015Applicant: Microsoft CorporationInventors: PATRICE Y. SIMARD, DAVID MAX CHICKERING, APARNA LAKSHMIRATAN, DENIS X. CHARLES, LEON BOTTOU
-
Publication number: 20150019204Abstract: A collection of data that is extremely large can be difficult to search and/or analyze. Relevance may be dramatically improved by automatically classifying queries and web pages in useful categories, and using these classification scores as relevance features. A thorough approach may require building a large number of classifiers, corresponding to the various types of information, activities, and products. Creation of classifiers and schematizers is provided on large data sets. Exercising the classifiers and schematizers on hundreds of millions of items may expose value that is inherent to the data by adding usable meta-data. Some aspects include active labeling exploration, automatic regularization and cold start, scaling with the number of items and the number of classifiers, active featuring, and segmentation and schematization.Type: ApplicationFiled: November 8, 2013Publication date: January 15, 2015Applicant: Microsoft CorporationInventors: PATRICE Y. SIMARD, DAVID MAX CHICKERING, DAVID G. GRANGIER, DENIS X. CHARLES, LEON BOTTOU, CARLOS GARCIA JURADO SUAREZ
-
Publication number: 20150019461Abstract: A collection of data that is extremely large can be difficult to search and/or analyze. Relevance may be dramatically improved by automatically classifying queries and web pages in useful categories, and using these classification scores as relevance features. A thorough approach may require building a large number of classifiers, corresponding to the various types of information, activities, and products. Creation of classifiers and schematizers is provided on large data sets. Exercising the classifiers and schematizers on hundreds of millions of items may expose value that is inherent to the data by adding usable meta-data. Some aspects include active labeling exploration, automatic regularization and cold start, scaling with the number of items and the number of classifiers, active featuring, and segmentation and schematization.Type: ApplicationFiled: November 8, 2013Publication date: January 15, 2015Applicant: Microsoft CorporationInventors: PATRICE Y. SIMARD, DAVID MAX CHICKERING, DAVID G. GRANGIER, DENIS X. CHARLES, LEON BOTTOU, SALEEMA A. AMERSHI, APARNA LAKSHMIRATAN, CARLOS GARCIA JURADO SUAREZ
-
Publication number: 20150019463Abstract: A collection of data that is extremely large can be difficult to search and/or analyze. Relevance may be dramatically improved by automatically classifying queries and web pages in useful categories, and using these classification scores as relevance features. A thorough approach may require building a large number of classifiers, corresponding to the various types of information, activities, and products. Creation of classifiers and schematizers is provided on large data sets. Exercising the classifiers and schematizers on hundreds of millions of items may expose value that is inherent to the data by adding usable meta-data. Some aspects include active labeling exploration, automatic regularization and cold start, scaling with the number of items and the number of classifiers, active featuring, and segmentation and schematization.Type: ApplicationFiled: November 8, 2013Publication date: January 15, 2015Applicant: Microsoft CorporationInventors: PATRICE Y. SIMARD, DAVID MAX CHICKERING, DAVID G. GRANGIER, APARNA LAKSHMIRATAN, SALEEMA A. AMERSHI
-
Patent number: 8922559Abstract: Various embodiments provide techniques for graph clustering. In one or more embodiments, a participation graph is obtained that represents relationships between entities. An auxiliary graph is constructed based on the participation graph. The auxiliary graph may be constructed such that the auxiliary graph is less dense than the participation graph and is therefore computationally less complex to analyze. Clusters in the auxiliary graph are determined by solving an objective function defined for the auxiliary graph. Clusters determined for the auxiliary graph may then be utilized to ascertain clusters in the participation graph that solve a related objective function defined for the participation graph.Type: GrantFiled: March 26, 2010Date of Patent: December 30, 2014Assignee: Microsoft CorporationInventors: Denis X. Charles, David M Chickering, Patrice Y Simard, Reid M Andersen
-
Publication number: 20140259104Abstract: Human Interaction Proofs (“HIPs”, sometimes referred to as “captchas”), may be generated automatically. An captcha specification language may be defined, which allows a captcha scheme to be defined in terms of how symbols are to be chosen and drawn, and how those symbols are obscured. The language may provide mechanisms to specify the various ways in which to obscure symbols. New captcha schemes may be generated from existing specifications, by using genetic algorithms that combine features from existing captcha schemes that have been successful. Moreover, the likelihood that a captcha scheme has been broken by attackers may be estimated by collecting data on the time that it takes existing captcha schemes to be broken, and using regression to estimate the time to breakage as a function of either the captcha's features or its measured quality.Type: ApplicationFiled: May 19, 2014Publication date: September 11, 2014Applicant: Microsoft CorporationInventors: Geoffrey J. Hulten, Patrice Y. Simard, Darko Kirovski, Jesper B. Lind, Christopher A. Meek
-
Patent number: 8739276Abstract: Human Interaction Proofs (“HIPs”, sometimes referred to as “captchas”), may be generated automatically. An captcha specification language may be defined, which allows a captcha scheme to be defined in terms of how symbols are to be chosen and drawn, and how those symbols are obscured. The language may provide mechanisms to specify the various ways in which to obscure symbols. New captcha schemes may be generated from existing specifications, by using genetic algorithms that combine features from existing captcha schemes that have been successful. Moreover, the likelihood that a captcha scheme has been broken by attackers may be estimated by collecting data on the time that it takes existing captcha schemes to be broken, and using regression to estimate the time to breakage as a function of either the captcha's features or its measured quality.Type: GrantFiled: June 22, 2010Date of Patent: May 27, 2014Assignee: Microsoft CorporationInventors: Geoffrey J. Hulten, Patrice Y. Simard, Darko Kirovski, Jesper B. Lind, Christopher A. Meek
-
Patent number: 8676806Abstract: The claimed subject matter provides a system and/or a method that facilitates collecting and organizing electronic documents. An interface component can receive a document. A manager component can automatically file the document into a category based at least in part upon a portion of static metadata associated with the document and a portion of metadata dynamically generated from an inference related to the portion of static metadata associated with the document.Type: GrantFiled: November 1, 2007Date of Patent: March 18, 2014Assignee: Microsoft CorporationInventors: Patrice Y. Simard, Lewis C. Levin, Christopher H. Prately
-
Patent number: 8509563Abstract: A system for generating soft copy (digital) versions of hard copy documents uses images of the hard copy documents. The images may be captured using a device suitable for capturing images, like a camera phone. Once available, the images may be processed to improve their suitability for document generation. The images may then be processed to recognize and generate soft copy versions of the documents represented by the images.Type: GrantFiled: February 2, 2006Date of Patent: August 13, 2013Assignee: Microsoft CorporationInventors: Merle Michael Robinson, Matthieu T. Uyttendaele, Zhengyou Zhang, Patrice Y. Simard
-
Patent number: 8428358Abstract: A system and method for labeling radicals in East Asian characters is described. The identity of the radical and the location of the radical in a character may be stored for future reference.Type: GrantFiled: May 31, 2005Date of Patent: April 23, 2013Assignee: Microsoft CorporationInventors: Frank J. Eisenhart, James A. Pittman, Patrice Y. Simard
-
Publication number: 20120323677Abstract: Methods, systems, and computer-storage media having computer-usable instructions embodied thereon for calculating event probabilities are provided. The event may be a click probability. Event probabilities are calculated using a system optimized for runtime model accuracy with an operable learning algorithm. Bin counting techniques are used to calculate event probabilities based on a count of event occurrences and non-event occurrences. Linear parameters, such and counts of clicks and non-clicks, may also be used in the system to allow for runtime adjustments.Type: ApplicationFiled: June 20, 2011Publication date: December 20, 2012Applicant: MICROSOFT CORPORATIONInventors: LEON BOTTOU, KUMAR CHELLAPILLA, PATRICE Y. SIMARD, DAVID MAX CHICKERING
-
Publication number: 20110314537Abstract: Human Interaction Proofs (“HIPs”, sometimes referred to as “captchas”), may be generated automatically. An captcha specification language may be defined, which allows a captcha scheme to be defined in terms of how symbols are to be chosen and drawn, and how those symbols are obscured. The language may provide mechanisms to specify the various ways in which to obscure symbols. New captcha schemes may be generated from existing specifications, by using genetic algorithms that combine features from existing captcha schemes that have been successful. Moreover, the likelihood that a captcha scheme has been broken by attackers may be estimated by collecting data on the time that it takes existing captcha schemes to be broken, and using regression to estimate the time to breakage as a function of either the captcha's features or its measured quality.Type: ApplicationFiled: June 22, 2010Publication date: December 22, 2011Applicant: MICROSOFT CORPORATIONInventors: Geoffrey J. Hulten, Patrice Y. Simard, Darko Kirovski, Jesper B. Lind, Christopher A. Meek
-
Publication number: 20110251889Abstract: Various embodiments provide techniques for inventory clustering. In one or more embodiments, a set of inventory to be processed is placed into an initial cluster. The inventory can be related to impressions for advertising that are defined by values for a set of attributes. Recursive division of the initial cluster is performed by selecting an attribute and deriving child clusters that are constrained by one or more values of the attributes in accordance with one or more clustering algorithms. The clustering algorithms are configured to derive an optimum number of clusters by repetitively generating smaller child clusters and measuring a cost associated with adding additional clusters. Additional child clusters can be formed in this manner until the measured cost to add more clusters outweighs a benefit of adding more clusters.Type: ApplicationFiled: April 9, 2010Publication date: October 13, 2011Applicant: MICROSOFT CORPORATIONInventors: Patrice Y. Simard, David M. Chickering, Denis X. Charles
-
Publication number: 20110238490Abstract: Various embodiments provide techniques for auction flighting. In one or more embodiments, a control group and a test group are designated for participants who compete one to another in online auctions. An inclusive model may then be employed for testing of new conditions for auctions using the groups. In particular, multiple auctions can be conducted and/or simulated, such that control conditions are applied in auctions that do not include at least one member of the test group, and test conditions are applied in auctions having members from both the test group and the control group. A response to the test conditions can then be measured by analyzing behaviors of the participants in the auctions conducted with the control conditions in comparison to behaviors of participants in the auctions conducted with the test conditions.Type: ApplicationFiled: March 25, 2010Publication date: September 29, 2011Applicant: Microsoft CorporationInventors: Patrice Y. Simard, David M. Chickering, Denis X. Charles
-
Publication number: 20110234594Abstract: Various embodiments provide techniques for graph clustering. In one or more embodiments, a participation graph is obtained that represents relationships between entities. An auxiliary graph is constructed based on the participation graph. The auxiliary graph may be constructed such that the auxiliary graph is less dense than the participation graph and is therefore computationally less complex to analyze. Clusters in the auxiliary graph are determined by solving an objective function defined for the auxiliary graph. Clusters determined for the auxiliary graph may then be utilized to ascertain clusters in the participation graph that solve a related objective function defined for the participation graph.Type: ApplicationFiled: March 26, 2010Publication date: September 29, 2011Applicant: MICROSOFT CORPORATIONInventors: Denis X. Charles, David M. Chickering, Patrice Y. Simard, Reid M. Andersen
-
Publication number: 20100318500Abstract: An archive of items, which are computing data accessed by a user, is created at a semantic object level. The object archiving may group seemingly disparate items as a composite object, which may then be stored to enable retrieval by the user at a later point in time. The composite object may include metadata from the various items to enable identifying the composite object, providing retrieval capabilities (e.g., search, etc.), and so forth. In some aspects, an archiving process may extract item data from an item that is accessed by a computing device. Next, the item may be selected by a schema for inclusion in a composite object when the item data meets criteria specified in the schema. The composite object(s) may then be stored in an object store as an archive (backup).Type: ApplicationFiled: June 16, 2009Publication date: December 16, 2010Applicant: MICROSOFT CORPORATIONInventors: Elissa E.S. Murphy, Patrice Y. Simard, Navjot Virk, Kamal Jain, Mathew J. Dickson