Patents by Inventor Shiby Thomas
Shiby Thomas 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: 9135309Abstract: A computer-implemented method of creating a data mining model in a database management system comprises accepting a database language statement at the database management system, the database language statement indicating a dataset and a data mining model to be created from the dataset, and creating, in the database management system, the indicated data mining model using the indicated dataset, wherein creation and application of the data mining model does not require moving data to a separate data mining engine.Type: GrantFiled: November 18, 2011Date of Patent: September 15, 2015Assignee: Oracle International CorporationInventors: Wei Li, Shiby Thomas, Joseph Yarmus, Ari W. Mozes, Mahesh Jagannath
-
Publication number: 20120066260Abstract: A computer-implemented method of creating a data mining model in a database management system comprises accepting a database language statement at the database management system, the database language statement indicating a dataset and a data mining model to be created from the dataset, and creating, in the database management system, the indicated data mining model using the indicated dataset, wherein creation and application of the data mining model does not require moving data to a separate data mining engine.Type: ApplicationFiled: November 18, 2011Publication date: March 15, 2012Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: Wei LI, Shiby THOMAS, Joseph YARMUS, Ari W. MOZES, Mahesh JAGANNATH
-
Patent number: 8065326Abstract: Decision trees are efficiently represented in a relational database. A computer-implemented method of representing a decision tree model in relational form comprises providing a directed acyclic graph comprising a plurality of nodes and a plurality of links, each link connecting a plurality of nodes, encoding a tree structure by including in each node a parent-child relationship of the node with other nodes, encoding in each node information relating to a split represented by the node, the split information including a splitting predictor and a split value, and encoding in each node a target histogram.Type: GrantFiled: February 1, 2006Date of Patent: November 22, 2011Assignee: Oracle International CorporationInventors: Wei Li, Shiby Thomas, Joseph Yarmus, Ari W. Mozes, Mahesh Jagannath
-
Publication number: 20110282815Abstract: A system, software module, and computer program product for performing association rule based data mining that improved performance in model building, good integration with the various databases throughout the enterprise, flexible specification and adjustment of the models being built, and flexible model arrangement and export capability. The software module for performing association rule based data mining in an electronic data processing system comprises: a model setup block operable to receive client input including information specifying a setup of a association rule data mining models, generate the model setup, generate parameters for the model setup based on the received information, a modeling algorithms block operable to select and initialize a association rule modeling algorithm based on the generated model setup, and a model building block operable to receive training data and build a association rule model using the training data and the selected association rule modeling algorithm.Type: ApplicationFiled: May 16, 2011Publication date: November 17, 2011Applicant: ORACLE INTERNATIONAL CORPORATIONInventor: Shiby THOMAS
-
Patent number: 7962483Abstract: A system, software module, and computer program product for performing association rule based data mining that improved performance in model building, good integration with the various databases throughout the enterprise, flexible specification and adjustment of the models being built, and flexible model arrangement and export capability. The software module performs association rule based data mining in an electronic data processing system. A model setup block operable to receive client input including information specifying a setup of a association rule data mining models, generate the model setup, generate parameters for the model setup based on the received information. A modeling algorithms block operable to select and initialize a association rule modeling algorithm based on the generated model setup, and a model building block operable to receive training data and build a association rule model using the training data and the selected association rule modeling algorithm.Type: GrantFiled: December 20, 2002Date of Patent: June 14, 2011Assignee: Oracle International CorporationInventor: Shiby Thomas
-
Patent number: 7720790Abstract: Techniques are provided for (1) extending SQL to support direct invocation of frequent itemset operations, (2) improving the performance of frequent itemset operations by clustering itemset combinations to more efficiently use previously produced results, and (3) making on-the-fly selection of the occurrence counting technique to use during each phase of a multiple phase frequent itemset operation. When directly invoked in an SQL statement, a frequent itemset operation may receive input from results of operations specified in the SQL statement, and provide its results directly to other operations specified in the SQL statement. By clustering itemset combinations, resources may be used more efficiently by retaining intermediate information as long as it is useful, and then discarding it to free up volatile memory.Type: GrantFiled: August 18, 2003Date of Patent: May 18, 2010Assignee: Oracle International CorporationInventors: Wei Li, Jiansheng Huang, Ari Mozes, Shiby Thomas, Mark Douglas Callaghan
-
Patent number: 7571159Abstract: A method, system, and computer program product for counting predictor-target pairs for a decision tree model provides the capability to generate count tables that is quicker and more efficient than previous techniques. A method of counting predictor-target pairs for a decision tree model, the decision tree model based on data stored in a database, the data comprising a plurality of rows of data, at least one predictor and at least one target, comprises generating a bitmap for each split node of data stored in a database system by intersecting a parent node bitmap and a bitmap of a predictor that satisfies a condition of the node, intersecting each split node bitmap with each predictor bitmap and with each target bitmap to form intersected bitmaps, and counting bits of each intersected bitmap to generate a count of predictor-target pairs.Type: GrantFiled: February 1, 2006Date of Patent: August 4, 2009Assignee: Oracle International CorporationInventors: Shiby Thomas, Wei Li, Joseph Yarmus, Mahesh Jagannath, Ari W. Mozes
-
Publication number: 20070192341Abstract: A method, system, and computer program product for counting predictor-target pairs for a decision tree model provides the capability to generate count tables that is quicker and more efficient than previous techniques. A method of counting predictor-target pairs for a decision tree model, the decision tree model based on data stored in a database, the data comprising a plurality of rows of data, at least one predictor and at least one target, comprises generating a bitmap for each split node of data stored in a database system by intersecting a parent node bitmap and a bitmap of a predictor that satisfies a condition of the node, intersecting each split node bitmap with each predictor bitmap and with each target bitmap to form intersected bitmaps, and counting bits of each intersected bitmap to generate a count of predictor-target pairs.Type: ApplicationFiled: February 1, 2006Publication date: August 16, 2007Inventors: Shiby Thomas, Wei Li, Joseph Yarmus, Mahesh Jagannath, Ari Mozes
-
Publication number: 20070179966Abstract: Decision trees are efficiently represented in a relational database. A computer-implemented method of representing a decision tree model in relational form comprises providing a directed acyclic graph comprising a plurality of nodes and a plurality of links, each link connecting a plurality of nodes, encoding a tree structure by including in each node a parent-child relationship of the node with other nodes, encoding in each node information relating to a split represented by the node, the split information including a splitting predictor and a split value, and encoding in each node a target histogram.Type: ApplicationFiled: February 1, 2006Publication date: August 2, 2007Inventors: Wei Li, Shiby Thomas, Joseph Yarmus, Ari Mozes, Mahesh Jagannath
-
Patent number: 7051037Abstract: The present invention provides an efficient method and system of data mining using SQL queries for model building and scoring. The invention provides a database management system having a database containing data, a database engine operatively connected to process the data, a SQL server operatively connected to the database and a data mining tool, whereby the data mining tool is based on a Naïve Bayes model. The SQL server uses the data and the Naïve Bayes model to develop the data mining tool. The data mining tool is located is located in the database management system. The data mining tool has a model building system based on at least one SQL query and training data, and a scoring system based on SQL queries.Type: GrantFiled: May 29, 2002Date of Patent: May 23, 2006Assignee: Oracle International CorporationInventors: Shiby Thomas, Marcos M. Campos
-
Publication number: 20050065969Abstract: An integrated solution in which BLAST functionality is integrated into a DBMS provides improved performance and scalability over the conventional approach, in addition to reducing the required hardware resources and reducing the cost of the system. In a database management system, a system for sequence matching and alignment comprises a database table storing sequence information comprising target sequences, a set of query sequences, and a table function operable to match the set of query sequences with target sequences stored in the database table, the table function having an interface including parameters.Type: ApplicationFiled: August 12, 2004Publication date: March 24, 2005Inventor: Shiby Thomas
-
Publication number: 20050050033Abstract: An integrated solution in which BLAST functionality is integrated into a DBMS provides improved performance and scalability over the conventional approach, in addition to reducing the required hardware resources and reducing the cost of the system. In a database management system, a system for sequence matching and alignment comprises a database table storing sequence information comprising target sequences, a query sequence, a table function operable to accept the query sequence and match the query sequence with at least one target sequence stored in the database table, and a structured query language query referencing a database table storing sequence information comprising target sequences, a query sequence, and a table function, the structured query language query evaluatable by the database management system.Type: ApplicationFiled: August 12, 2004Publication date: March 3, 2005Inventors: Shiby Thomas, Mahesh Jagannath, Ramkumar Krishnan
-
Publication number: 20050044087Abstract: Techniques are provided for (1) extending SQL to support direct invocation of frequent itemset operations, (2) improving the performance of frequent itemset operations by clustering itemset combinations to more efficiently use previously produced results, and (3) making on-the-fly selection of the occurrence counting technique to use during each phase of a multiple phase frequent itemset operation. When directly invoked in an SQL statement, a frequent itemset operation may receive input from results of operations specified in the SQL statement, and provide its results directly to other operations specified in the SQL statement. By clustering itemset combinations, resources may be used more efficiently by retaining intermediate information as long as it is useful, and then discarding it to free up volatile memory.Type: ApplicationFiled: August 18, 2003Publication date: February 24, 2005Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: Wei Li, Jiansheng Huang, Ari Mozes, Shiby Thomas, Mark Callaghan
-
Patent number: 6324533Abstract: A method and apparatus for mining data relationships from an integrated database and data-mining system are disclosed. A set of frequent 1-itemsets is generated using a group-by query on data transactions. From these frequent 1-itemsets and the transactions, frequent 2-itemsets are determined. A candidate set of (n+2)-itemsets are generated from the frequent 2-itemsets, where n=1. Frequent (n+2)-itemsets are determined from candidate set and the transaction table using a query operation. The candidate set and frequent (n+2)-itemset are generated for (n+1) until the candidate set is empty. Rules are then extracted from the union of the determined frequent itemsets.Type: GrantFiled: May 29, 1998Date of Patent: November 27, 2001Assignee: International Business Machines CorporationInventors: Rakesh Agrawal, Sunita Sarawagi, Shiby Thomas