专利快速检索-快速检索全球专利，免费商用专利数据库-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. 发明申请

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.
摘要翻译：用于生成数据挖掘模型的预测值的分组在计算主导的决策树构建阶段提供了有用的减少内存占用和计算，但减少了模型的信息丢失并减少了虚假信息工件的引入。一种在数据库中对数据进行数据挖掘建模的方法，数据库系统中存储的数据库中存储的数据，数据挖掘建模已经为数据选择了至少一个预测因子和一个目标，数据包括所述预测器的多个值和所述目标的多个值，所述方法包括为所述预测器构建二叉树，所述预测器将所述预测器的值分割成多个部分，修剪所述二叉树，并且将所述二叉树定义为所述预测器修剪后保留的树的叶子，树的每个叶表示预测值的一部分值。

4. 发明授权

US07720790B2 Dynamic selection of frequent itemset counting technique 有权
标题翻译：频繁项集计数技术的动态选择
公开(公告)号：US07720790B2
公开(公告)日：2010-05-18
申请号：US10643563
申请日：2003-08-18
申请人： Wei Li , Jiansheng Huang , Ari Mozes , Shiby Thomas , Mark Douglas Callaghan
发明人： Wei Li , Jiansheng Huang , Ari Mozes , Shiby Thomas , Mark Douglas Callaghan
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30595 , G06F17/30489 , G06F2216/03
摘要： 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. Dynamically selecting an occurrence counting technique allows a single frequent itemset operation to change the occurrence counting technique that it is using midstream, based on cost considerations and/or environmental conditions.
摘要翻译：提供技术用于（1）扩展SQL以支持频繁项目集操作的直接调用，（2）通过聚类项目组合来提高频繁项目集操作的性能，以更有效地使用先前生成的结果，以及（3）选择在多相频繁项目集操作的每个阶段期间使用的发生计数技术。当在SQL语句中直接调用时，频繁的项目集操作可以从SQL语句中指定的操作结果接收输入，并将其结果直接提供给SQL语句中指定的其他操作。通过对项目集合进行聚类，可以通过保留中间信息来更有效地使用资源，只要它是有用的，然后丢弃它来释放易失性存储器。动态选择发生计数技术允许单个频繁项目集操作基于成本考虑和/或环境条件来改变它正在中游使用的发生计数技术。

5. 发明申请

US20050044087A1 Dynamic selection of frequent itemset counting technique 有权
标题翻译：频繁项集计数技术的动态选择
公开(公告)号：US20050044087A1
公开(公告)日：2005-02-24
申请号：US10643563
申请日：2003-08-18
申请人： Wei Li , Jiansheng Huang , Ari Mozes , Shiby Thomas , Mark Callaghan
发明人： Wei Li , Jiansheng Huang , Ari Mozes , Shiby Thomas , Mark Callaghan
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30595 , G06F17/30489 , G06F2216/03
摘要： 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. Dynamically selecting an occurrence counting technique allows a single frequent itemset operation to change the occurrence counting technique that it is using midstream, based on cost considerations and/or environmental conditions.
摘要翻译：提供技术用于（1）扩展SQL以支持频繁项目集操作的直接调用，（2）通过聚类项目组合来提高频繁项目集操作的性能，以更有效地使用先前生成的结果，以及（3）选择在多相频繁项目集操作的每个阶段期间使用的发生计数技术。当在SQL语句中直接调用时，频繁的项目集操作可以从SQL语句中指定的操作结果接收输入，并将其结果直接提供给SQL语句中指定的其他操作。通过对项目集合进行聚类，可以通过保留中间信息来更有效地使用资源，只要它是有用的，然后丢弃它来释放易失性存储器。动态选择发生计数技术允许单个频繁项目集操作基于成本考虑和/或环境条件来改变它正在中游使用的发生计数技术。

6. 发明申请

US20060004807A1 Performing recursive database operations 有权
公开(公告)号：US20060004807A1
公开(公告)日：2006-01-05
申请号：US10867923
申请日：2004-06-14
申请人： Thierry Cruanes , Wei Li , Ari Mozes , Benoit Dageville
发明人： Thierry Cruanes , Wei Li , Ari Mozes , Benoit Dageville
IPC分类号： G06F17/00
CPC分类号： G06F17/3056 , G06F17/30513 , Y10S707/99942
摘要： A method and apparatus for performing recursive database operations is provided. According to one aspect, a plurality of first-stage slaves and a plurality of second-stage slaves are established in a database server. During one or more iterations of a recursive database operation, the first-stage slaves concurrently process data items stored in a data repository and send results to the second-stage slaves. The second-stage slaves receive the results and concurrently process those results. The second-stage slaves store the results of the second-stage slaves' processing in the data repository. Subsequent iterations of the recursive database operation proceed in this manner until the recursive database operation has been completed. In each iteration, the first-stage slaves consume the product of the second-stage slaves' previous iteration's processing, and the second-stage slaves consume the product of the first-stage slaves' current iteration's processing.

7. 发明申请

US20070067327A1 Performing recursive database operators 有权
标题翻译：执行递归数据库运算符
公开(公告)号：US20070067327A1
公开(公告)日：2007-03-22
申请号：US11600272
申请日：2006-11-14
申请人： Thierry Cruanes , Wei Li , Ari Mozes , Benoit Dageville
发明人： Thierry Cruanes , Wei Li , Ari Mozes , Benoit Dageville
IPC分类号： G06F7/00
CPC分类号： G06F17/3056 , G06F17/30513 , Y10S707/99942
摘要： A method and apparatus for performing recursive database operations is provided. According to one aspect, a plurality of first-stage slaves and a plurality of second-stage slaves are established in a database server. During one or more iterations of a recursive database operation, the first-stage slaves concurrently process data items stored in a data repository and send results to the second-stage slaves. The second-stage slaves receive the results and concurrently process those results. The second-stage slaves store the results of the second-stage slaves' processing in the data repository. Subsequent iterations of the recursive database operation proceed in this manner until the recursive database operation has been completed. In each iteration, the first-stage slaves consume the product of the second-stage slaves' previous iteration's processing, and the second-stage slaves consume the product of the first-stage slaves' current iteration's processing.
摘要翻译：提供了一种用于执行递归数据库操作的方法和装置。根据一个方面，在数据库服务器中建立多个第一级从站和多个第二级从站。在递归数据库操作的一个或多个迭代期间，第一级从站同时处理存储在数据存储库中的数据项，并将结果发送到第二级从站。第二阶段的奴隶收到结果并同时处理这些结果。第二级从站将数据存储库中的第二级从站处理的结果存储起来。递归数据库操作的后续迭代以这种方式进行，直到递归数据库操作完成。在每次迭代中，第一级从站消耗第二级从站先前迭代处理的乘积，第二级从站消耗第一级从站当前迭代处理的乘积。

8. 发明授权

US07962526B2 Frequent itemset counting using clustered prefixes and index support 有权
标题翻译：使用聚簇前缀和索引支持的频繁项集计数
公开(公告)号：US07962526B2
公开(公告)日：2011-06-14
申请号：US10643629
申请日：2003-08-18
申请人： Wei Li , Jiansheng Huang , Ari Mozes
发明人： Wei Li , Jiansheng Huang , Ari Mozes
IPC分类号： G06F17/30
CPC分类号： G06F17/30595 , G06F17/30324
摘要： 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. Dynamically selecting an occurrence counting technique allows a single frequent itemset operation to change the occurrence counting technique that it is using midstream, based on cost considerations and/or environmental conditions.
摘要翻译：提供技术用于（1）扩展SQL以支持频繁项目集操作的直接调用，（2）通过聚类项目组合来提高频繁项目集操作的性能，以更有效地使用先前生成的结果，以及（3）选择在多相频繁项目集操作的每个阶段期间使用的发生计数技术。当在SQL语句中直接调用时，频繁的项目集操作可以从SQL语句中指定的操作结果接收输入，并将其结果直接提供给SQL语句中指定的其他操作。通过对项目集合进行聚类，可以通过保留中间信息来更有效地使用资源，只要它是有用的，然后丢弃它来释放易失性存储器。动态选择发生计数技术允许单个频繁项目集操作基于成本考虑和/或环境条件来改变它正在中游使用的发生计数技术。

9. 发明授权

US07698312B2 Performing recursive database operations 有权
标题翻译：执行递归数据库操作
公开(公告)号：US07698312B2
公开(公告)日：2010-04-13
申请号：US11600272
申请日：2006-11-14
申请人： Thierry Cruanes , Wei Li , Ari Mozes , Benoit Dageville
发明人： Thierry Cruanes , Wei Li , Ari Mozes , Benoit Dageville
IPC分类号： G06F7/00
CPC分类号： G06F17/3056 , G06F17/30513 , Y10S707/99942
摘要： A method and apparatus for performing recursive database operations is provided. According to one aspect, a plurality of first-stage slaves and a plurality of second-stage slaves are established in a database server. During one or more iterations of a recursive database operation, the first-stage slaves concurrently process data items stored in a data repository and send results to the second-stage slaves. The second-stage slaves receive the results and concurrently process those results. The second-stage slaves store the results of the second-stage slaves' processing in the data repository. Subsequent iterations of the recursive database operation proceed in this manner until the recursive database operation has been completed. In each iteration, the first-stage slaves consume the product of the second-stage slaves' previous iteration's processing, and the second-stage slaves consume the product of the first-stage slaves' current iteration's processing.
摘要翻译：提供了一种用于执行递归数据库操作的方法和装置。根据一个方面，在数据库服务器中建立多个第一级从站和多个第二级从站。在递归数据库操作的一个或多个迭代期间，第一级从站同时处理存储在数据存储库中的数据项，并将结果发送到第二级从站。第二阶段的奴隶收到结果并同时处理这些结果。第二级从站将数据存储库中的第二级从站处理的结果存储起来。递归数据库操作的后续迭代以这种方式进行，直到递归数据库操作完成。在每次迭代中，第一级从站消耗第二级从站先前迭代处理的乘积，第二级从站消耗第一级从站当前迭代处理的乘积。

10. 发明申请

US20050044094A1 Expressing frequent itemset counting operations 有权
标题翻译：表示频繁的项目计数操作
公开(公告)号：US20050044094A1
公开(公告)日：2005-02-24
申请号：US10643628
申请日：2003-08-18
申请人： Wei Li , Jiansheng Huang , Ari Mozes
发明人： Wei Li , Jiansheng Huang , Ari Mozes
IPC分类号： G06F17/00 , G06F17/30
CPC分类号： G06F17/30421 , G06F17/30501 , G06F17/30536
摘要： 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. Dynamically selecting an occurrence counting technique allows a single frequent itemset operation to change the occurrence counting technique that it is using midstream, based on cost considerations and/or environmental conditions.
摘要翻译：提供技术用于（1）扩展SQL以支持频繁项目集操作的直接调用，（2）通过聚类项目组合来提高频繁项目集操作的性能，以更有效地使用先前生成的结果，以及（3）选择在多相频繁项目集操作的每个阶段期间使用的发生计数技术。当在SQL语句中直接调用时，频繁的项目集操作可以从SQL语句中指定的操作结果接收输入，并将其结果直接提供给SQL语句中指定的其他操作。通过对项目集合进行聚类，可以通过保留中间信息来更有效地使用资源，只要它是有用的，然后丢弃它来释放易失性存储器。动态选择发生计数技术允许单个频繁项目集操作基于成本考虑和/或环境条件来改变它正在中游使用的发生计数技术。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式