专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20070179966A1 System and method for building decision trees in a database 有权
标题翻译：在数据库中构建决策树的系统和方法
公开(公告)号：US20070179966A1
公开(公告)日：2007-08-02
申请号：US11344112
申请日：2006-02-01
申请人： Wei Li , Shiby Thomas , Joseph Yarmus , Ari Mozes , Mahesh Jagannath
发明人： Wei Li , Shiby Thomas , Joseph Yarmus , Ari Mozes , Mahesh Jagannath
IPC分类号： G06F7/00
CPC分类号： G06F17/30539
摘要： 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.
摘要翻译：决策树在关系数据库中有效地表示。以关系形式表示决策树模型的计算机实现的方法包括提供包括多个节点和多个链接的有向无环图，每个链接连接多个节点，通过在每个节点中包括父节点来编码树结构 - 节点与其他节点的关系，在每个节点中对由节点表示的分裂相关的信息进行编码，分割信息包括分割预测器和分割值，以及在每个节点中对目标直方图进行编码。

2. 发明申请

US20070192341A1 System and method for building decision tree classifiers using bitmap techniques 有权
标题翻译：使用位图技术构建决策树分类器的系统和方法
公开(公告)号：US20070192341A1
公开(公告)日：2007-08-16
申请号：US11344193
申请日：2006-02-01
申请人： Shiby Thomas , Wei Li , Joseph Yarmus , Mahesh Jagannath , Ari Mozes
发明人： Shiby Thomas , Wei Li , Joseph Yarmus , Mahesh Jagannath , Ari Mozes
IPC分类号： G06F7/00
CPC分类号： G06F17/30545 , Y10S707/99933 , Y10S707/99945
摘要： 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.
摘要翻译：用于计算决策树模型的预测器 - 目标对的方法，系统和计算机程序产品提供了生成比先前技术更快更有效的计数表的能力。一种对决策树模型计算预测器 - 目标对的方法，基于存储在数据库中的数据的决策树模型，包括多行数据的数据，至少一个预测器和至少一个目标，包括生成位图通过将父节点位图和满足该节点的条件的预测器的位图相交到数据库系统中存储的数据的每个分割节点，将每个分割节点位图与每个预测器位图相交，并与每个目标位图形成相交的位图，并计数每个相交位图的位以产生预测器 - 目标对的计数。

3. 发明授权

US07571159B2 System and method for building decision tree classifiers using bitmap techniques 有权
标题翻译：使用位图技术构建决策树分类器的系统和方法
公开(公告)号：US07571159B2
公开(公告)日：2009-08-04
申请号：US11344193
申请日：2006-02-01
申请人： Shiby Thomas , Wei Li , Joseph Yarmus , Mahesh Jagannath , Ari W. Mozes
发明人： Shiby Thomas , Wei Li , Joseph Yarmus , Mahesh Jagannath , Ari W. Mozes
IPC分类号： G06F7/00 , G06F17/30 , G06F17/00
CPC分类号： G06F17/30545 , Y10S707/99933 , Y10S707/99945
摘要： 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.
摘要翻译：用于计算决策树模型的预测器 - 目标对的方法，系统和计算机程序产品提供了生成比先前技术更快更有效的计数表的能力。一种对决策树模型计算预测器 - 目标对的方法，基于存储在数据库中的数据的决策树模型，包括多行数据的数据，至少一个预测器和至少一个目标，包括生成位图通过将父节点位图和满足该节点的条件的预测器的位图相交到数据库系统中存储的数据的每个分割节点，将每个分割节点位图与每个预测器位图相交，并与每个目标位图形成相交的位图，并计数每个相交位图的位以产生预测器 - 目标对的计数。

4. 发明授权

US09135309B2 System and method for building decision trees in a database 有权
标题翻译：在数据库中构建决策树的系统和方法
公开(公告)号：US09135309B2
公开(公告)日：2015-09-15
申请号：US13300030
申请日：2011-11-18
申请人： Wei Li , Shiby Thomas , Joseph Yarmus , Ari W. Mozes , Mahesh Jagannath
发明人： Wei Li , Shiby Thomas , Joseph Yarmus , Ari W. Mozes , Mahesh Jagannath
IPC分类号： G06F17/30
CPC分类号： G06F17/30539
摘要： 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.
摘要翻译：在数据库管理系统中创建数据挖掘模型的计算机实现的方法包括在数据库管理系统上接受数据库语言语句，指示要从数据集创建的数据集和数据挖掘模型的数据库语言语句，在数据库管理系统中，使用所指示的数据集的指示数据挖掘模型，其中数据挖掘模型的创建和应用不需要将数据移动到单独的数据挖掘引擎。

5. 发明授权

US08065326B2 System and method for building decision trees in a database 有权
标题翻译：在数据库中构建决策树的系统和方法
公开(公告)号：US08065326B2
公开(公告)日：2011-11-22
申请号：US11344112
申请日：2006-02-01
申请人： Wei Li , Shiby Thomas , Joseph Yarmus , Ari W. Mozes , Mahesh Jagannath
发明人： Wei Li , Shiby Thomas , Joseph Yarmus , Ari W. Mozes , Mahesh Jagannath
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30539
摘要： 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.
摘要翻译：决策树在关系数据库中有效地表示。以关系形式表示决策树模型的计算机实现的方法包括提供包括多个节点和多个链接的有向无环图，每个链接连接多个节点，通过在每个节点中包括父节点来编码树结构 - 节点与其他节点的关系，在每个节点中对由节点表示的分裂相关的信息进行编码，分割信息包括分割预测器和分割值，以及在每个节点中对目标直方图进行编码。

6. 发明申请

US20070185896A1 Binning predictors using per-predictor trees and MDL pruning 有权
标题翻译：使用每预测树和MDL修剪的binning预测变量
公开(公告)号：US20070185896A1
公开(公告)日：2007-08-09
申请号：US11344185
申请日：2006-02-01
申请人： Mahesh Jagannath , Chitra Bhagwat , Joseph Yarmus , Ari Mozes
发明人： Mahesh Jagannath , Chitra Bhagwat , Joseph Yarmus , Ari Mozes
IPC分类号： G06F7/00
CPC分类号： G06K9/6282
摘要： Binning of predictor values used for generating a data mining model provides useful reduction in memory footprint and computation during the computationally dominant decision tree build phase, but reduces the information loss of the model and reduces the introduction of false information artifacts. A method of binning data in a database for data mining modeling in a database system, the data stored in a database table in the database system, the data mining modeling having selected at least one predictor and one target for the data, the data including a plurality of values of the predictor and a plurality of values of the target, the method comprises constructing a binary tree for the predictor that splits the values of the predictor into a plurality of portions, pruning the binary tree, and defining as bins of the predictor leaves of the tree that remain after pruning, each leaf of the tree representing a portion of the values of the predictor.
摘要翻译：用于生成数据挖掘模型的预测值的分组在计算主导的决策树构建阶段提供了有用的减少内存占用和计算，但减少了模型的信息丢失并减少了虚假信息工件的引入。一种在数据库中对数据进行数据挖掘建模的方法，数据库系统中存储的数据库中存储的数据，数据挖掘建模已经为数据选择了至少一个预测因子和一个目标，数据包括所述预测器的多个值和所述目标的多个值，所述方法包括为所述预测器构建二叉树，所述预测器将所述预测器的值分割成多个部分，修剪所述二叉树，并且将所述二叉树定义为所述预测器修剪后保留的树的叶子，树的每个叶表示预测值的一部分值。

7. 发明申请

US20050246354A1 Non-negative matrix factorization in a relational database management system 有权
标题翻译：关系数据库管理系统中的非负矩阵分解
公开(公告)号：US20050246354A1
公开(公告)日：2005-11-03
申请号：US10927083
申请日：2004-08-27
申请人： Pablo Tamayo , George Tang , Mark McCracken , Mahesh Jagannath , Marcos Campos , Boriana Milenova , Joseph Yarmus , Pavani Kuntala
发明人： Pablo Tamayo , George Tang , Mark McCracken , Mahesh Jagannath , Marcos Campos , Boriana Milenova , Joseph Yarmus , Pavani Kuntala
IPC分类号： G06F7/00
CPC分类号： G06F17/30592 , G06F17/30539
摘要： An implementation of NMF functionality integrated into a relational database management system provides the capability to apply NMF to relational datasets and to sparse datasets. A database management system comprises a multi-dimensional data table operable to store data and a processing unit operable to perform non-negative matrix factorization on data stored in the multi-dimensional data table and to generate a plurality of data tables, each data table being smaller than the multi-dimensional data table and having reduced dimensionality relative to the multi-dimensional data table. The multi-dimensional data table may be a relational data table.
摘要翻译：集成到关系数据库管理系统中的NMF功能的实现提供了将NMF应用于关系数据集和稀疏数据集的能力。数据库管理系统包括可操作以存储数据的多维数据表和可操作以对存储在多维数据表中的数据执行非负矩阵分解并生成多个数据表的处理单元，每个数据表为小于多维数据表并且相对于多维数据表具有降低的维度。多维数据表可以是关系数据表。

8. 发明授权

US08280915B2 Binning predictors using per-predictor trees and MDL pruning 有权
标题翻译：使用每预测树和MDL修剪的binning预测变量
公开(公告)号：US08280915B2
公开(公告)日：2012-10-02
申请号：US11344185
申请日：2006-02-01
申请人： Mahesh Jagannath , Chitra Bhagwat , Joseph Yarmus , Ari W. Mozes
发明人： Mahesh Jagannath , Chitra Bhagwat , Joseph Yarmus , Ari W. Mozes
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06K9/6282
摘要： Binning of predictor values used for generating a data mining model provides useful reduction in memory footprint and computation during the computationally dominant decision tree build phase, but reduces the information loss of the model and reduces the introduction of false information artifacts. A method of binning data in a database for data mining modeling in a database system, the data stored in a database table in the database system, the data mining modeling having selected at least one predictor and one target for the data, the data including a plurality of values of the predictor and a plurality of values of the target, the method comprises constructing a binary tree for the predictor that splits the values of the predictor into a plurality of portions, pruning the binary tree, and defining as bins of the predictor leaves of the tree that remain after pruning, each leaf of the tree representing a portion of the values of the predictor.
摘要翻译：用于生成数据挖掘模型的预测值的分组在计算主导的决策树构建阶段提供了有用的减少内存占用和计算，但减少了模型的信息丢失并减少了虚假信息工件的引入。一种在数据库中对数据进行数据挖掘建模的方法，数据库系统中存储的数据库中存储的数据，数据挖掘建模已经为数据选择了至少一个预测因子和一个目标，数据包括所述预测器的多个值和所述目标的多个值，所述方法包括为所述预测器构建二叉树，所述预测器将所述预测器的值分割成多个部分，修剪所述二叉树，并且将所述二叉树定义为所述预测器修剪后保留的树的叶子，树的每个叶表示预测值的一部分值。

9. 发明申请

US20050050033A1 System and method for sequence matching and alignment in a relational database management system 审中-公开
标题翻译：关系数据库管理系统中序列匹配和对齐的系统和方法
公开(公告)号：US20050050033A1
公开(公告)日：2005-03-03
申请号：US10916462
申请日：2004-08-12
申请人： Shiby Thomas , Mahesh Jagannath , Ramkumar Krishnan
发明人： Shiby Thomas , Mahesh Jagannath , Ramkumar Krishnan
IPC分类号： G06F17/30 , G06F19/00 , G06F7/00
CPC分类号： G06F16/24553 , G06F16/2474 , G16B30/00 , G16B50/00
摘要： 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.
摘要翻译：将BLAST功能集成到DBMS中的集成解决方案除了减少所需的硬件资源并降低系统成本外，还提供了比传统方法更好的性能和可扩展性。在数据库管理系统中，用于序列匹配和对齐的系统包括存储包括目标序列的序列信息的数据库表，查询序列，可用于接受查询序列并将查询序列与存储在该查询序列中的至少一个目标序列匹配的表函数数据库表，以及引用存储包括目标序列，查询序列和表函数的序列信息的数据库表的结构化查询语言查询，可由数据库管理系统评估的结构化查询语言查询。

10. 发明授权

US06859808B1 Mapping logical row identifiers for primary B+tree-like structures to physical row identifiers 有权
标题翻译：将主B +树状结构的逻辑行标识符映射到物理行标识符
公开(公告)号：US06859808B1
公开(公告)日：2005-02-22
申请号：US09867678
申请日：2001-05-31
申请人： Eugene I. Chong , Jagannathan Srinivasan , Souripriya Das , Charles G. Freiwald , Aravind Yalamanchi , Mahesh Jagannath , Anh-Tuan Tran , Ramkumar Krishnan
发明人： Eugene I. Chong , Jagannathan Srinivasan , Souripriya Das , Charles G. Freiwald , Aravind Yalamanchi , Mahesh Jagannath , Anh-Tuan Tran , Ramkumar Krishnan
IPC分类号： G06F17/30
CPC分类号： G06F17/30327 , Y10S707/968 , Y10S707/99933 , Y10S707/99942 , Y10S707/99943
摘要： A mapping mechanism for a primary B+tree in a database management system. The primary B+tree includes a plurality of rows. The mapping mechanism includes introducing a mapping table that includes a plurality of rows, including a row for each row of the primary B+tree, and that stores the logical identifier of the corresponding primary B+tree row. In addition, reverse mapping is provided by augmenting a primary B+tree to include in each primary B+tree row a physical row identifier of the corresponding mapping table row. An auxiliary structure created on a primary B+tree can make use of the proposed mapping mechanism. Specifically, the auxiliary structures refers to primary B+tree rows indirectly by storing the physical row identifier of the corresponding mapping table row.
摘要翻译：数据库管理系统中主B +树的映射机制。主B +树包括多行。映射机制包括引入包括多个行的映射表，包括主B +树的每一行的一行，并存储对应的主B +树行的逻辑标识符。此外，通过增加主B +树以在每个主B +树行中包括相应映射表行的物理行标识符来提供反向映射。在主B +树上创建的辅助结构可以利用所提出的映射机制。具体地说，辅助结构通过存储对应映射表行的物理行标识符来间接地引用主B +树行。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式