Patents by Inventor Usama M. Fayyad
Usama M. Fayyad 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: 9495452Abstract: Techniques are described for generating an authority value of a first one of a plurality of documents. A first component of the authority value is generated with reference to outbound links associated with the first document. The outbound links enable access to a first subset of the plurality of documents. A second component of the authority value is generated with reference to a second subset of the plurality of documents. Each of the second subset of documents represents a potential starting point for a user session. A third component of the authority value is generated representing a likelihood that a user session initiated by any of a population of users will end with the first document. The first, second, and third components of the authority value are combined to generate the authority value. At least one of the first, second, and third components of the authority value is computed with reference to user data relating to at least some of the outbound links and the second subset of documents.Type: GrantFiled: October 9, 2009Date of Patent: November 15, 2016Assignee: Yahoo! Inc.Inventors: Pavel Berkhin, Usama M. Fayyad, Prabhakar Raghavan, Andrew Tomkins
-
Publication number: 20140249914Abstract: Methods and apparatus are described for optimally allocating an online advertising budget for a search engine marketing (SEM) campaign among a fixed set of keywords.Type: ApplicationFiled: March 7, 2014Publication date: September 4, 2014Applicant: Yahoo! Inc.Inventors: Pavel Berkhin, Usama M. Fayyad, Scott Gaffney, Bassel Ojjeh, Rajesh Girish Parekh, Andrew Tomkins
-
Patent number: 8712832Abstract: Methods and apparatus are described for optimally allocating an online advertising budget for a search engine marketing (SEM) campaign among a fixed set of keywords.Type: GrantFiled: December 12, 2006Date of Patent: April 29, 2014Assignee: Yahoo! Inc.Inventors: Pavel Berkhin, Usama M. Fayyad, Scott Gaffney, Bassel Ojjeh, Rajesh Girish Parekh, Andrew Tomkins
-
Publication number: 20110015991Abstract: A variety of techniques are described by which keyword sets and target audience profiles may be generalized in a systematic and effective way with reference to relationships between keywords, profiles, and the data of an underlying user population.Type: ApplicationFiled: September 22, 2010Publication date: January 20, 2011Applicant: YAHOO! INC.Inventors: Usama M. Fayyad, Pavel Berkhin, Andrew Tomkins, Rajesh Girish Parekh, Jignashu Parikh, David Wellspring Sculley, II
-
Patent number: 7822745Abstract: A variety of techniques are described by which keyword sets and target audience profiles may be generalized in a systematic and effective way with reference to relationships between keywords, profiles, and the data of an underlying user population.Type: GrantFiled: May 31, 2006Date of Patent: October 26, 2010Assignee: Yahoo! Inc.Inventors: Usama M. Fayyad, Pavel Berkhin, Andrew Tomkins, Rajesh Girish Parekh, Jignashu Parikh, David Wellspring Sculley, II
-
Publication number: 20100023513Abstract: Techniques are described for generating an authority value of a first one of a plurality of documents. A first component of the authority value is generated with reference to outbound links associated with the first document. The outbound links enable access to a first subset of the plurality of documents. A second component of the authority value is generated with reference to a second subset of the plurality of documents. Each of the second subset of documents represents a potential starting point for a user session. A third component of the authority value is generated representing a likelihood that a user session initiated by any of a population of users will end with the first document. The first, second, and third components of the authority value are combined to generate the authority value. At least one of the first, second, and third components of the authority value is computed with reference to user data relating to at least some of the outbound links and the second subset of documents.Type: ApplicationFiled: October 9, 2009Publication date: January 28, 2010Applicant: YAHOO! INC.Inventors: Pavel Berkhin, Usama M. Fayyad, Prabhakar Raghavan, Andrew Tomkins
-
Patent number: 7624104Abstract: A first component of an authority value is generated with reference to outbound links associated with a document and corresponding to a first subset of a plurality of documents. A second component of the authority value is generated with reference to a second subset of the plurality of documents that represent potential starting points for user sessions. A third component of the authority value is generated representing a likelihood that a user session initiated by any of a population of users will end with the document. At least one of the first, second, and third components of the authority value is computed with reference to user data relating to at least some of the outbound links and the second subset of documents.Type: GrantFiled: June 22, 2006Date of Patent: November 24, 2009Assignee: Yahoo! Inc.Inventors: Pavel Berkhin, Usama M. Fayyad, Prabhakar Raghavan, Andrew Tomkins
-
Patent number: 7596587Abstract: Methods and apparatus are described for storing a plurality of objects in a plurality of storage options. An importance index is generated for each of the plurality of objects with reference to importance data associated with each object. At least a portion of the importance data represents relevance of the associated object relative to a population of users interacting with the plurality of objects. Each of the objects is stored in a selected one of the storage options with reference to the corresponding importance index and a hierarchy of the storage options. The hierarchy of storage options represents at least partial ordering of the storage options with reference to economic costs and efficiency of retrieval.Type: GrantFiled: July 19, 2006Date of Patent: September 29, 2009Assignee: Yahoo! Inc.Inventors: Pavel Berkhin, Usama M. Fayyad, Shanmugasundaram Ravikumar
-
Patent number: 7424439Abstract: Data mining for managing marketing resources is disclosed. In one embodiment, a method for managing a marketing campaign includes the following. First, the method provides a data mining engine capable of being trained with training data and capable thereof of performing inference relative to the training data and on future data. Next, the method provides a user database defining observed characteristics of each one of a set of users. The characteristics include at least one of one or more user's attributes, and one or more of the user's preferences. Finally, the data mining engine is trained with a set of training data comprising the user data base, and a predetermined characteristic pertaining to the market campaign is input to the engine, such that, in response to the input, a subset of the users in the database is obtained that have the highest correlation to the characteristic.Type: GrantFiled: September 22, 1999Date of Patent: September 9, 2008Assignee: Microsoft CorporationInventors: Usama M. Fayyad, Bassel Y. Ojjeh
-
Publication number: 20080140489Abstract: Methods and apparatus are described for optimally allocating an online advertising budget for a search engine marketing (SEM) campaign among a fixed set of keywords.Type: ApplicationFiled: December 12, 2006Publication date: June 12, 2008Applicant: YAHOO! INC.Inventors: Pavel Berkhin, Usama M. Fayyad, Scott Gaffney, Bassel Ojjeh, Rajesh Girish Parekh, Andrew Tomkins
-
Publication number: 20080021859Abstract: Methods and apparatus are described for storing a plurality of objects in a plurality of storage options. An importance index is generated for each of the plurality of objects with reference to importance data associated with each object. At least a portion of the importance data represents relevance of the associated object relative to a population of users interacting with the plurality of objects. Each of the objects is stored in a selected one of the storage options with reference to the corresponding importance index and a hierarchy of the storage options. The hierarchy of storage options represents at least partial ordering of the storage options with reference to economic costs and efficiency of retrieval.Type: ApplicationFiled: July 19, 2006Publication date: January 24, 2008Inventors: Pavel Berkhin, Usama M. Fayyad, Shanmugasundaram Ravikumar
-
Publication number: 20080010281Abstract: Techniques are described for generating an authority value of a first one of a plurality of documents. A first component of the authority value is generated with reference to outbound links associated with the first document. The outbound links enable access to a first subset of the plurality of documents. A second component of the authority value is generated with reference to a second subset of the plurality of documents. Each of the second subset of documents represents a potential starting point for a user session. A third component of the authority value is generated representing a likelihood that a user session initiated by any of a population of users will end with the first document. The first, second, and third components of the authority value are combined to generate the authority value. At least one of the first, second, and third components of the authority value is computed with reference to user data relating to at least some of the outbound links and the second subset of documents.Type: ApplicationFiled: June 22, 2006Publication date: January 10, 2008Inventors: Pavel Berkhin, Usama M. Fayyad, Prabhakar Raghavan, Andrew Tomkins
-
Publication number: 20070282785Abstract: A variety of techniques are described by which keyword sets and target audience profiles may be generalized in a systematic and effective way with reference to relationships between keywords, profiles, and the data of an underlying user population.Type: ApplicationFiled: May 31, 2006Publication date: December 6, 2007Inventors: Usama M. Fayyad, Pavel Berkhin, Andrew Tomkins, Rajesh Girish Parekh, Jignashu Parikh, David Wellspring Sculley
-
Patent number: 6643645Abstract: Retrofitting recommender systems, so that they can scale to large data, is disclosed. The principal notion is to reduce data requirements of existing recommender engines by performing a type of data reduction that minimizes the loss of information given the engine. The reductions covered in this invention are designed to be easily implemented on a database system, and are intended to have minimal impact on an existing implementation of a recommender system. In one embodiment, a method repeats reducing the data by a number of records, until an accuracy threshold or a performance requirement is met. If the accuracy threshold is met first, the method repeats removing a highest-frequency dimension from the data, until the performance requirement is also met. The reduced data is provided to the recommender system, which generates predictions based on the reduced data, and a query.Type: GrantFiled: February 8, 2000Date of Patent: November 4, 2003Assignee: Microsoft CorporationInventors: Usama M. Fayyad, Paul S. Bradley, Bassel Y. Ojjeh
-
Patent number: 6567936Abstract: A generalization of frequent item sets to error-tolerant frequent item sets (ETF) is disclosed, together with its application in data clustering using error-tolerant frequent item sets to either build clusters or as an initialization technique for standard clustering algorithms. Efficient feasible computational algorithms for computing ETF's from very large databases is presented. In one embodiment, a method determines a plurality of weak ETF's, which are strongly tolerant of errors, and determines a plurality of strong ETF's therefrom, which are less tolerant of errors. The resulting clusters can be used as an initial model for a standard clustering approach, or may themselves be used as the end clusters. In one embodiment, the data covered by the strong clusters is removed from the data, and the process is repeated, until no more weak clusters can be found.Type: GrantFiled: February 8, 2000Date of Patent: May 20, 2003Assignee: Microsoft CorporationInventors: Cheng Yang, Usama M. Fayyad, Paul S. Bradley
-
Patent number: 6496208Abstract: Method and apparatus for displaying and navigating data organized in the form of a graph structure (hierarchy or network) is presented. The invention has application for displaying a system of interconnected nodes such as a graph, a network, an organizational chart, a flowchart etc. wherein data or information is associated with nodes of the system. A user interface is implemented as an ActiveX control having a viewer component for displaying and navigating graph structur (for example a data mining model over data records or a directory structure over a set of files). The viewer component updates the contents of related windows that display different aspects of the components (nodes) of the data structure. A thumbnail window presents the user with an overview of the data structure. A layout window presents a more detailed view of part of the graph structure. Other windows display context and detailed properties associated with particular selected nodes.Type: GrantFiled: April 28, 1999Date of Patent: December 17, 2002Assignee: Microsoft CorporationInventors: Jeff Bernhardt, Usama M. Fayyad
-
Patent number: 6490582Abstract: Iterative validation for efficiently determining error-tolerant frequent itemsets is disclosed. A description of the application of error-tolerant frequent itemsets to efficiently determining clusters as well as initializing clustering algorithms are also given. In one embodiment, a method determines a sample set of error-tolerant frequent itemsets (ETF's) within a uniform random sample of data within a database. This sample set of ETF's is independently validated, so that, for example, spurious ETF's and spurious dimensions within the ETF's can be removed. The validated sample set of ETF's, is added to the set of ETF's for the database. This process is repeated with additional uniform samples that are mutually exclusive from prior uniform samples, to continue building the database's set of ETF's, until no new sample sets can be found.Type: GrantFiled: February 8, 2000Date of Patent: December 3, 2002Assignee: Microsoft CorporationInventors: Usama M. Fayyad, Cheng Yang, Paul S. Bradley
-
Patent number: 6216134Abstract: A system that provides for the graphic visualization of the categories of a collection of records. The graphic visualization is referred to as “category graph.” The system optionally displays the category graph as a “similarity graph” or a “hierarchical map.” When displaying a category graph, the system displays a graphic representation of each category. The system displays the category graph as a similarity graph or a hierarchical map in a way that visually illustrates the similarity between categories. The display of a category graph allows a data analyst to better understand the similarity and dissimilarity between categories. A similarity graph includes a node for each category and an arc connecting nodes representing categories whose similarity is above a threshold. A hierarchical map is a tree structure that includes a node for each base category along with nodes representing combinations of similar categories.Type: GrantFiled: June 25, 1998Date of Patent: April 10, 2001Assignee: Microsoft CorporationInventors: David E. Heckerman, David Maxwell Chickering, Usama M. Fayyad, Christopher A. Meek