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

11. 发明授权

US06230151B1 Parallel classification for data mining in a shared-memory multiprocessor system 失效
标题翻译：在共享内存多处理器系统中进行数据挖掘的并行分类
公开(公告)号：US06230151B1
公开(公告)日：2001-05-08
申请号：US09061808
申请日：1998-04-16
申请人： Rakesh Agrawal , Ching-Tien Ho , Mohammed J. Zaki
发明人： Rakesh Agrawal , Ching-Tien Ho , Mohammed J. Zaki
IPC分类号： G06F1518
CPC分类号： G06F17/30598 , G06F8/453 , G06F2216/03 , Y10S707/99942
摘要： A method and system for generating a decision-tree classifier in parallel in a shared-memory multiprocessor system is disclosed. The processors first generate in the shared memory an attribute list for each record attribute. Each attribute list is assigned to a processor. The processors independently determine the best splits for their respective assigned lists, and cooperatively determine a global best split for all attribute lists. The attribute lists are reassigned to the processors and split according to the global best split into the lists for child nodes. The split attribute lists are again assigned to the processors and the process is repeated for each new child node until each attribute list for the new child nodes includes only tuples of the same record class or a fixed number of tuples.
摘要翻译：公开了一种在共享存储器多处理器系统中并行生成决策树分类器的方法和系统。处理器首先在共享存储器中生成每个记录属性的属性列表。每个属性列表都分配给一个处理器。处理器独立地确定其各自分配的列表的最佳分割，并且协作地确定所有属性列表的全局最佳分割。将属性列表重新分配给处理器，并将根据全局最佳拆分拆分为子节点列表。分割属性列表再次分配给处理器，并且对于每个新的子节点重复该过程，直到新的子节点的每个属性列表仅包括相同记录类或固定数量的元组的元组。

12. 发明授权

US5926820A Method and system for performing range max/min queries on a data cube 失效
标题翻译：在数据立方体上执行范围最大/最小查询的方法和系统
公开(公告)号：US5926820A
公开(公告)日：1999-07-20
申请号：US808046
申请日：1997-02-27
申请人： Rakesh Agrawal , Ching-Tien Ho , Nimrod Megiddo
发明人： Rakesh Agrawal , Ching-Tien Ho , Nimrod Megiddo
IPC分类号： G06F17/30
CPC分类号： G06F17/30327 , G06F17/30333 , G06F17/30489 , Y10S707/99935
摘要： A method for performing a range max/min query in a database, in which the data is represented as a multi-dimensional data cube, is disclosed. The method comprises the steps of: partitioning the data cube into multi-level multi-dimensional blocks which are represented by a tree structure; determining the index to the maximum or minimum value for each block; generating a range max/min result from the values of the cells selected from the cells in the query region Q, and the cells referenced by the indexes at the nodes corresponding to the cells in the query region Q, using the tree structure and determined cell indexes. A branch-and-bound method is used to repeatedly reduce the size of the query region from a cell within the region, based on sub-trees whose roots are cells in the region. To further improve the method performance, one or more reference arrays may also be used to quickly traverse the tree in determining the max/min cell indexes.
摘要翻译：公开了一种在数据库中执行范围最大/最小查询的方法，其中数据被表示为多维数据立方体。该方法包括以下步骤：将数据立方体分割成由树结构表示的多层多维块; 确定每个块的最大值或最小值的索引; 使用树结构和确定的单元从从查询区域Q中的单元格选择的单元格的值和由与查询区域Q中的单元相对应的节点处的索引引用的单元生成范围最大/最小的结果索引。使用分支绑定方法，以区域内的单元格为基础的子树，重复地减少区域内的单元格的查询区域的大小。为了进一步改进方法性能，也可以使用一个或多个参考阵列来确定最大/最小信元索引。

13. 发明授权

US09792351B2 Tolerant and extensible discovery of relationships in data using structural information and data analysis 有权
公开(公告)号：US09792351B2
公开(公告)日：2017-10-17
申请号：US11149851
申请日：2005-06-10
申请人： Mauricio Antonio Hernandez-Sherrington , Ching-Tien Ho , Mary Ann Roth , Lingling Yan
发明人： Mauricio Antonio Hernandez-Sherrington , Ching-Tien Ho , Mary Ann Roth , Lingling Yan
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30604
摘要： Various embodiments of a method, system and article of manufacture to discover relationships among a first set of elements and a second set of elements are provided. At least one metric algorithm is identified based on a metric selection parameter. A raw result is determined based on the at least one metric algorithm, a first specified structural description of the first set of elements and a second specified structural description of the second set of elements. The raw result comprises a plurality of relationship measurements and the raw result is ordered. In some embodiments, a balanced result is produced based on the raw result and a matching strategy algorithm. In other embodiments, the matching strategy algorithm is identified based on a matching strategy selection parameter.

14. 发明申请

US20090043736A1 EFFICIENT TUPLE EXTRACTION FROM STREAMING XML DATA 审中-公开
标题翻译：从XML数据流中提取高效的TUPLE
公开(公告)号：US20090043736A1
公开(公告)日：2009-02-12
申请号：US11835901
申请日：2007-08-08
申请人： Wook-Shin Han , Ching-Tien Ho , Haifeng Jiang , Quanzhong Li
发明人： Wook-Shin Han , Ching-Tien Ho , Haifeng Jiang , Quanzhong Li
IPC分类号： G06F17/30
CPC分类号： G06F16/8365
摘要： A method and apparatus are disclosed for querying streaming extensible markup language (XML) data comprising: routing elements to query nodes, the elements derived from the streaming extensible markup language data; filtering out elements not conforming to one or more predetermined path query patterns; adding remaining elements to one or more dynamic element lists; accessing a decision table to select and return a query node related to a cursor element from the dynamic element lists; and processing the cursor element related to the returned query node to produce an extracted tuple output.
摘要翻译：公开了一种用于查询流式可扩展标记语言（XML）数据的方法和装置，包括：将查询节点的路由元素，从流可扩展标记语言数据导出的元素; 过滤掉不符合一个或多个预定路径查询模式的元素; 将剩余的元素添加到一个或多个动态元素列表中; 访问决策表以从动态元素列表中选择并返回与游标元素相关的查询节点; 并处理与返回的查询节点相关的游标元素以产生提取的元组输出。

15. 发明申请

US20060282429A1 Tolerant and extensible discovery of relationships in data using structural information and data analysis 有权
标题翻译：使用结构信息和数据分析，容忍和可扩展地发现数据关系
公开(公告)号：US20060282429A1
公开(公告)日：2006-12-14
申请号：US11149851
申请日：2005-06-10
申请人： Mauricio Hernandez-Sherrington , Ching-Tien Ho , Mary Roth , Lingling Yan
发明人： Mauricio Hernandez-Sherrington , Ching-Tien Ho , Mary Roth , Lingling Yan
IPC分类号： G06F17/30
CPC分类号： G06F17/30604
摘要： Various embodiments of a method, system and article of manufacture to discover relationships among a first set of elements and a second set of elements are provided. At least one metric algorithm is identified based on a metric selection parameter. A raw result is determined based on the at least one metric algorithm, a first specified structural description of the first set of elements and a second specified structural description of the second set of elements. The raw result comprises a plurality of relationship measurements and the raw result is ordered. In some embodiments, a balanced result is produced based on the raw result and a matching strategy algorithm. In other embodiments, the matching strategy algorithm is identified based on a matching strategy selection parameter.
摘要翻译：提供了用于发现第一组元件和第二组元件之间的关系的方法，系统和制品的各种实施例。基于度量选择参数来识别至少一个度量算法。基于至少一个度量算法，第一组元素的第一指定结构描述和第二组元素的第二指定结构描述来确定原始结果。原始结果包括多个关系测量，并且原始结果被排序。在一些实施例中，基于原始结果和匹配策略算法产生平衡结果。在其他实施例中，基于匹配策略选择参数来识别匹配策略算法。

16. 发明授权

US5513313A Method for generating hierarchical fault-tolerant mesh architectures 失效
标题翻译：生成层次容错网格架构的方法
公开(公告)号：US5513313A
公开(公告)日：1996-04-30
申请号：US521645
申请日：1995-08-31
申请人： Jehoshua Bruck , Robert E. Cypher , Ching-Tien Ho
发明人： Jehoshua Bruck , Robert E. Cypher , Ching-Tien Ho
IPC分类号： G06F11/20 , G06F11/00
CPC分类号： G06F11/2051
摘要： A method is disclosed, for use with a multiprocessing hardware mesh architecture including nodes and a network of interconnections between the nodes, for defining and implementing a target logical mesh architecture utilizing a given subset of the nodes and the interconnections of the hardware architecture. Typically, the hardware mesh architecture includes redundant nodes and interconnections, sot hat the target logical mesh architecture may be defined from the hardware architecture several different ways. As a consequence, the target logical mesh architecture may be defined even in the presence of faulty nodes or interconnections in the hardware architecture. Frequently, the logical mesh is defined in terms of some regular pattern of interconnections. The method of the invention facilitates the definition of the desired logical mesh architecture from the hardware architecture, given the possibility that one or more faults are present, by initially defining logical blocks of nodes from among the functional nodes of the hardware architecture. Then, functional edges between the nodes defined within the logical blocks are defined as logical interconnections between the nodes of the logical blocks, such that the logical blocks, with the interconnections, are structurally consistent with portions of the logical mesh. Finally, additional edges are defined as logical interconnections between nodes in different logical blocks, these additional edges also being consistent with the structure of the logical mesh. The result is that the logical mesh has been fully defined from functional nodes and interconnections in the hardware architecture.
摘要翻译：公开了一种用于包括节点和节点之间的互连网络的多处理硬件网格架构的方法，用于使用节点的给定子集和硬件架构的互连来定义和实现目标逻辑网格架构。通常，硬件网格架构包括冗余节点和互连，所以目标逻辑网格架构可以从硬件架构中定义几种不同的方式。因此，即使在存在硬件架构中的故障节点或互连的情况下，也可以定义目标逻辑网格架构。通常，逻辑网格是根据一些规则的互连模式来定义的。考虑到存在一个或多个故障的可能性，本发明的方法通过从硬件体系结构的功能节点中首先定义逻辑块的节点，有助于从硬件架构定义期望的逻辑网格架构。然后，在逻辑块之间定义的节点之间的功能边界被定义为逻辑块的节点之间的逻辑互连，使得具有互连的逻辑块在结构上与逻辑网格的部分一致。最后，额外的边被定义为不同逻辑块中的节点之间的逻辑互连，这些附加边也与逻辑网格的结构一致。结果是逻辑网格已经从硬件架构中的功能节点和互连完全定义。

17. 发明授权

US08630989B2 Systems and methods for information extraction using contextual pattern discovery 有权
标题翻译：使用上下文模式发现的信息提取的系统和方法
公开(公告)号：US08630989B2
公开(公告)日：2014-01-14
申请号：US13117570
申请日：2011-05-27
申请人： Sebastian Johannes Blohm , Vivian Yaw-Wen Chu , Ching-Tien Ho , Yunyao Li , Huaiyu Zhu
发明人： Sebastian Johannes Blohm , Vivian Yaw-Wen Chu , Ching-Tien Ho , Yunyao Li , Huaiyu Zhu
IPC分类号： G06F17/30
CPC分类号： G06F17/278
摘要： Described herein are methods, systems, apparatuses and products for automatically discovering patterns in a text corpus. An aspect provides extracting at least one context string related to at least one annotator from the at least one text corpus; analyzing the at least one context string for at least one sequence, the at least one sequence comprised of at least one subsequence; determining at least one sequence signature for each at least one sequence by applying applicable rules to the at least one sequence; and grouping the at least one sequence signature into at least one group.
摘要翻译：这里描述了用于自动发现文本语料库中的模式的方法，系统，装置和产品。一方面提供从所述至少一个文本语料库提取与至少一个注释器相关的至少一个上下文串; 分析至少一个序列的至少一个上下文串，所述至少一个序列由至少一个子序列组成; 通过将适用规则应用于所述至少一个序列来确定每个至少一个序列的至少一个序列签名; 以及将所述至少一个序列签名分组成至少一个组。

18. 发明申请

US20120303661A1 SYSTEMS AND METHODS FOR INFORMATION EXTRACTION USING CONTEXTUAL PATTERN DISCOVERY 有权
标题翻译：使用上下文图案发现的信息提取的系统和方法
公开(公告)号：US20120303661A1
公开(公告)日：2012-11-29
申请号：US13117570
申请日：2011-05-27
申请人： Sebastian Johannes Blohm , Vivian Yaw-Wen Chu , Ching-Tien Ho , Yunyao Li , Huaiyu Zhu
发明人： Sebastian Johannes Blohm , Vivian Yaw-Wen Chu , Ching-Tien Ho , Yunyao Li , Huaiyu Zhu
IPC分类号： G06F17/30
CPC分类号： G06F17/278
摘要： Described herein are methods, systems, apparatuses and products for automatically discovering patterns in a text corpus. An aspect provides extracting at least one context string related to at least one annotator from the at least one text corpus; analyzing the at least one context string for at least one sequence, the at least one sequence comprised of at least one subsequence; determining at least one sequence signature for each at least one sequence by applying applicable rules to the at least one sequence; and grouping the at least one sequence signature into at least one group.
摘要翻译：这里描述了用于自动发现文本语料库中的模式的方法，系统，装置和产品。一方面提供从所述至少一个文本语料库提取与至少一个注释器相关的至少一个上下文串; 分析至少一个序列的至少一个上下文串，所述至少一个序列由至少一个子序列组成; 通过将适用规则应用于所述至少一个序列来确定每个至少一个序列的至少一个序列签名; 以及将所述至少一个序列签名分组成至少一个组。

19. 发明申请

US20080275907A1 SCALABLE ALGORITHMS FOR MAPPING-BASED XML TRANSFORMATION 有权
公开(公告)号：US20080275907A1
公开(公告)日：2008-11-06
申请号：US12134029
申请日：2008-06-05
申请人： WOOK-SHIN HAN , CHING-TIEN HO , HAIFENG JIANG , LUCIAN POPA
发明人： WOOK-SHIN HAN , CHING-TIEN HO , HAIFENG JIANG , LUCIAN POPA
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/2247 , G06F17/2264 , Y10S707/957
摘要： A computer-implemented method for use with an extensible markup language (XML) document includes inputting a high-level mapping specification for a schema mapping; and generating a target XML document based on the mapping. The method may perform schema mapping-based XML transformation as a three-phase process comprising tuple extraction, XML-fragment generation, and data merging. The tuple extraction phase may be adapted to handle streamed XML data (as well as stored/indexed XML data). The data merging phase may use a hybrid method that can dynamically switch between main memory-based and disk-based algorithms based on the size of the XML data to be merged.

20. 发明授权

US5799300A Method and system for performing range-sum queries on a data cube 失效
标题翻译：在数据立方体上执行范围和查询的方法和系统
公开(公告)号：US5799300A
公开(公告)日：1998-08-25
申请号：US764564
申请日：1996-12-12
申请人： Rakesh Agrawal , Ching-Tien Ho , Ramakrishnan Srikant
发明人： Rakesh Agrawal , Ching-Tien Ho , Ramakrishnan Srikant
IPC分类号： G06F17/30
CPC分类号： G06F17/30592 , G06F17/30489 , Y10S707/99935
摘要： A method for performing a range-sum query in a database, in which the data is represented as a multi-dimensional data cube, is disclosed. The method comprises the steps of: selecting a subset of the dimensions of the data cube; computing a set of prefix-sums along the selected dimensions, based on the aggregate values in the cube corresponding the queried ranges; and generating a range-sum result based on the computed prefix-sums. Two d-dimensional arrays A and P are used for representing the data cube and the prefix-sums of the data cube, respectively. By maintaining the prefix-sum array P of the same size as the data cube, all range queries for a given cube can be answered in constant time, irrespective of the size of the sub-cube circumscribed by a query, using the inverse binary operator of the SUM operator. Alternatively, only auxiliary information for any user-specified fraction of the size of the d-dimensional data cube is maintained, to minimize the required system storage. The answer to a range query may now require access to some cells of the data cube in addition to the auxiliary information, but the average time complexity is still reduced significantly.
摘要翻译：公开了一种在数据库中执行范围和查询的方法，其中数据被表示为多维数据立方体。该方法包括以下步骤：选择数据立方体的维度的子集; 基于对应于查询范围的立方体中的聚合值来计算沿着所选维度的一组前缀和; 以及基于所计算的前缀和来生成范围和结果。两个d维数组A和P分别用于表示数据立方体和数据立方体的前缀和。通过保持与数据立方体相同大小的前缀和数组P，给定多维数据集的所有范围查询可以在常量时间内被应答，而不管查询所包围的子立方体的大小，使用反二进制运算符的SUM操作员。或者，仅维护d维数据立方体的大小的任何用户指定分数的辅助信息，以最小化所需的系统存储。范围查询的答案现在除了辅助信息之外，还可能需要访问数据立方体的某些单元格，但平均时间复杂度仍然显着降低。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式