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

11. 发明申请

US20060026110A1 Systems and methods for sequential modeling in less than one sequential scan 失效
标题翻译：在不到一次顺序扫描中进行顺序建模的系统和方法
公开(公告)号：US20060026110A1
公开(公告)日：2006-02-02
申请号：US10903336
申请日：2004-07-30
申请人： Wei Fan , Haixun Wang , Philip Yu
发明人： Wei Fan , Haixun Wang , Philip Yu
IPC分类号： G06F15/18
CPC分类号： G06N99/005 , Y10S707/99931
摘要： Most recent research of scalable inductive learning on very large streaming dataset focuses on eliminating memory constraints and reducing the number of sequential data scans. However, state-of-the-art algorithms still require multiple scans over the data set and use sophisticated control mechanisms and data structures. There is discussed herein a general inductive learning framework that scans the dataset exactly once. Then, there is proposed an extension based on Hoeffding's inequality that scans the dataset less than once. The proposed frameworks are applicable to a wide range of inductive learners.
摘要翻译：对最大流式数据集的可伸缩归纳学习的最新研究着重于消除记忆限制并减少顺序数据扫描的次数。然而，最先进的算法仍然需要对数据集进行多次扫描，并使用复杂的控制机制和数据结构。这里讨论了一般的归纳学习框架，该框架一次扫描数据集。然后，提出了一种基于Hoeffding不等式的扩展，可以扫描数据集不止一次。提出的框架适用于广泛的归纳学习者。

12. 发明授权

US07890471B2 Index structure for supporting structural XML queries 失效
标题翻译：用于支持结构XML查询的索引结构
公开(公告)号：US07890471B2
公开(公告)日：2011-02-15
申请号：US11780095
申请日：2007-07-19
申请人： Wei Fan , Haixun Wang , Philip Shi-Lung Yu
发明人： Wei Fan , Haixun Wang , Philip Shi-Lung Yu
IPC分类号： G06F7/00
CPC分类号： G06F17/30911 , Y10S707/99933 , Y10S707/99943
摘要： The present invention provides a ViST (or “virtual suffix tree”), which is a novel index structure for searching XML documents. By representing both XML documents and XML queries in structure-encoded sequences, it is shown that querying XML data is equivalent to finding (non-contiguous) subsequence matches. A variety of XML queries, including those with branches, or wild-cards (‘*’ and ‘//’), can be expressed by structure-encoded sequences. Unlike index methods that disassemble a query into multiple sub-queries, and then join the results of these sub-queries to provide the final answers, ViST uses tree structures as the basic unit of query to avoid expensive join operations. Furthermore, ViST provides a unified index on both content and structure of the XML documents, hence it has a performance advantage over methods indexing either just content or structure. ViST supports dynamic index update, and it relies solely on B+Trees without using any specialized data structures that are not well supported by common database management systems (hereinafter referred to as “DBMSs”).
摘要翻译：本发明提供了一种ViST（或“虚拟后缀树”），其是用于搜索XML文档的新型索引结构。通过在结构编码序列中同时表示XML文档和XML查询，显示查询XML数据等同于查找（非连续）子序列匹配。各种XML查询（包括具有分支的查询）或通配符（'*'和'//'）可以由结构编码的序列表示。不同于将查询反汇编成多个子查询的索引方法，然后加入这些子查询的结果以提供最终答案，ViST使用树结构作为查询的基本单位，以避免昂贵的连接操作。此外，ViST为XML文档的内容和结构提供了一个统一的索引，因此与仅通过内容或结构索引方法相比，它具有性能优势。 ViST支持动态索引更新，它仅依赖于B + Tree，而不使用通用数据库管理系统（以下简称“DBMS”）不太支持的任何专门的数据结构。

13. 发明授权

US07752192B2 Method and system for indexing and serializing data 失效
标题翻译：索引和序列化数据的方法和系统
公开(公告)号：US07752192B2
公开(公告)日：2010-07-06
申请号：US11681486
申请日：2007-03-02
申请人： Xiaohui Gu , Lipyeow Lim , Haixun Wang , Min Wang
发明人： Xiaohui Gu , Lipyeow Lim , Haixun Wang , Min Wang
IPC分类号： G06F17/30
CPC分类号： G06F17/30911
摘要： The present invention provides a computer implemented method, an apparatus, and a computer usable program product for indexing data. A controller identifies a set of data to be indexed, wherein a set of data structure trees represents the set of data. The controller merges the set of data structure trees to form a unified tree, wherein the unified tree contains a node for each unit of data in the set of data. The controller assigns an identifier to the node for each unit of data in the set of data that describes the node within the unified tree. The controller then serializes the unified tree to form a set of sequential series that represents the set of data structure trees, wherein the set of sequential series forms an index for the set of data.
摘要翻译：本发明提供了一种用于索引数据的计算机实现的方法，装置和计算机可用程序产品。控制器识别要索引的一组数据，其中一组数据结构树表示该组数据。控制器将数据结构树组合成一个统一的树，其中统一树包含一组数据中每个数据单元的节点。控制器为描述统一树中节点的数据集中的每个数据单元向节点分配一个标识符。然后，控制器对统一树进行序列化以形成一组代表数据结构树的顺序序列，其中，该顺序序列集合形成该组数据的索引。

14. 发明申请

US20100145986A1 Querying Data and an Associated Ontology in a Database Management System 审中-公开
标题翻译：在数据库管理系统中查询数据和关联本体
公开(公告)号：US20100145986A1
公开(公告)日：2010-06-10
申请号：US12711682
申请日：2010-02-24
申请人： Lipyeow Lim , Haixun Wang , Min Wang
发明人： Lipyeow Lim , Haixun Wang , Min Wang
IPC分类号： G06F17/30
CPC分类号： G06F16/24564 , Y10S707/99931
摘要： A method, apparatus, and computer program for querying data and an associated ontology in a database. An ontology is associated with data in database. Responsive to receiving a query from a requestor, relational data in the database is identified using the query to form identified relational data. Ontological knowledge in the ontology is identified using the identified relational data and the ontology. A result is returned to the requestor.
摘要翻译：一种用于在数据库中查询数据和相关本体的方法，装置和计算机程序。本体与数据库中的数据相关联。响应于从请求者接收查询，使用查询来识别数据库中的关系数据以形成所识别的关系数据。本体的本体知识使用所识别的关系数据和本体来识别。结果返回给请求者。

15. 发明授权

US07730098B2 Method for supporting ontology-related semantic queries in DBMSs with XML support 失效
标题翻译：用XML支持在DBMS中支持本体相关的语义查询的方法
公开(公告)号：US07730098B2
公开(公告)日：2010-06-01
申请号：US11681319
申请日：2007-03-02
申请人： Lipyeow Lim , Haixun Wang , Min Wang
发明人： Lipyeow Lim , Haixun Wang , Min Wang
IPC分类号： G06F17/30
CPC分类号： G06F17/30734 , G06F17/30404
摘要： A method for supporting semantic matching queries in a database management system (DBMS) by extracting and storing the transitive/subsumption relationships from a given ontology data in a DBMS with native XML support. These transitive relationships are transformed into a set of XML documents that are natural mappings of the hierarchical structure of the transitive relationships. A table function construct expresses semantic matching queries in a declarative manner. The semantic matching queried are automatically rewritten or translated into standard SQL/XML search operators such as XQuery, XPath and XMLExists, and executed by the SQL/XML DBMS on the given instance data and the extracted transitive relationships data.
摘要翻译：一种通过从具有本地XML支持的DBMS中的给定本体数据中提取和存储传递/包含关系来在数据库管理系统（DBMS）中支持语义匹配查询的方法。这些传递关系被转换成一组XML文档，它们是传递关系的层次结构的自然映射。表函数构造以声明方式表达语义匹配查询。查询的语义匹配自动重写或转换为标准SQL / XML搜索运算符，如XQuery，XPath和XMLExists，并由SQL / XML DBMS在给定的实例数据和提取的传递关系数据上执行。

16. 发明授权

US07720785B2 System and method of mining time-changing data streams using a dynamic rule classifier having low granularity 失效
标题翻译：使用具有低粒度的动态规则分类器挖掘时变数据流的系统和方法
公开(公告)号：US07720785B2
公开(公告)日：2010-05-18
申请号：US12121942
申请日：2008-05-16
申请人： Chang-shing Perng , Haixun Wang
发明人： Chang-shing Perng , Haixun Wang
IPC分类号： G06N5/02
CPC分类号： G06N5/025
摘要： A dynamic rule classifier for mining a data stream includes at least one window for viewing data contained in the data stream and a set of rules for mining the data. Rules are added and the set of rules are updated by algorithms when an drift in a concept within the data occurs, causing unacceptable drops in classification accuracy. The dynamic rule classifier is also implemented as a method and a computer program product.
摘要翻译：用于挖掘数据流的动态规则分类器包括用于查看数据流中包含的数据的至少一个窗口和用于挖掘数据的一组规则。添加规则，并且当数据中的概念中的漂移发生时，通过算法更新规则集合，导致分类准确性的不可接受的下降。动态规则分类器也被实现为一种方法和一种计算机程序产品。

17. 发明授权

US07693812B2 Querying data and an associated ontology in a database management system 失效
标题翻译：在数据库管理系统中查询数据和关联的本体
公开(公告)号：US07693812B2
公开(公告)日：2010-04-06
申请号：US11623941
申请日：2007-01-17
申请人： Lipyeow Lim , Haixun Wang , Min Wang
发明人： Lipyeow Lim , Haixun Wang , Min Wang
IPC分类号： G06F17/00
CPC分类号： G06F17/30507 , Y10S707/99931
摘要： A method, apparatus, and computer program for querying data and an associated ontology in a database. An ontology is associated with data in database. Responsive to receiving a query from a requestor, relational data in the database is identified using the query to form identified relational data. Ontological knowledge in the ontology is identified using the identified relational data and the ontology. A result is returned to the requestor.
摘要翻译：一种用于在数据库中查询数据和相关本体的方法，装置和计算机程序。本体与数据库中的数据相关联。响应于从请求者接收查询，使用查询来识别数据库中的关系数据以形成所识别的关系数据。本体的本体知识使用所识别的关系数据和本体来识别。结果返回给请求者。

18. 发明授权

US07493346B2 System and method for load shedding in data mining and knowledge discovery from stream data 有权
标题翻译：数据挖掘中的负载脱落和流数据的知识发现的系统和方法
公开(公告)号：US07493346B2
公开(公告)日：2009-02-17
申请号：US11058944
申请日：2005-02-16
申请人： Yun Chi , Haixun Wang , Philip S. Yu
发明人： Yun Chi , Haixun Wang , Philip S. Yu
IPC分类号： G06F12/00 , G06F17/30 , G06F9/46
CPC分类号： G06K9/6297 , H04L43/028
摘要： Load shedding schemes for mining data streams. A scoring function is used to rank the importance of stream elements, and those elements with high importance are investigated. In the context of not knowing the exact feature values of a data stream, the use of a Markov model is proposed herein for predicting the feature distribution of a data stream. Based on the predicted feature distribution, one can make classification decisions to maximize the expected benefits. In addition, there is proposed herein the employment of a quality of decision (QoD) metric to measure the level of uncertainty in decisions and to guide load shedding. A load shedding scheme such as presented herein assigns available resources to multiple data streams to maximize the quality of classification decisions. Furthermore, such a load shedding scheme is able to learn and adapt to changing data characteristics in the data streams.
摘要翻译：挖掘数据流的加载脱落方案。使用评分函数对流元素的重要性进行排序，并调查那些具有重要意义的元素。在不知道数据流的精确特征值的上下文中，本文提出了使用马尔可夫模型来预测数据流的特征分布。基于预测的特征分布，可以进行分类决定，以最大限度地提高预期效益。此外，在此提出采用质量决策（QoD）度量来衡量决策中的不确定性水平并指导负荷脱落。诸如此处呈现的负载脱落方案将可用资源分配给多个数据流以最大化分类决定的质量。此外，这种负载脱落方案能够学习和适应数据流中不断变化的数据特性。

19. 发明申请

US20080172353A1 QUERYING DATA AND AN ASSOCIATED ONTOLOGY IN A DATABASE MANAGEMENT SYSTEM 失效
标题翻译：在数据库管理系统中查询数据和相关的本体
公开(公告)号：US20080172353A1
公开(公告)日：2008-07-17
申请号：US11623941
申请日：2007-01-17
申请人： Lipyeow Lim , Haixun Wang , Min Wang
发明人： Lipyeow Lim , Haixun Wang , Min Wang
IPC分类号： G06N5/02 , G06F17/30
CPC分类号： G06F17/30507 , Y10S707/99931
摘要： A method, apparatus, and computer program for querying data and an associated ontology in a database. An ontology is associated with data in database. Responsive to receiving a query from a requester, relational data in the database is identified using the query to form identified relational data. Ontological knowledge in the ontology is identified using the identified relational data and the ontology. A result is returned to the requester.
摘要翻译：一种用于在数据库中查询数据和相关本体的方法，装置和计算机程序。本体与数据库中的数据相关联。响应于从请求者接收查询，使用查询来识别数据库中的关系数据以形成所识别的关系数据。本体的本体知识使用所识别的关系数据和本体来识别。结果返回给请求者。

20. 发明申请

US20070271243A1 Index Structure for Supporting Structural XML Queries 失效
标题翻译：支持结构XML查询的索引结构
公开(公告)号：US20070271243A1
公开(公告)日：2007-11-22
申请号：US11780095
申请日：2007-07-19
申请人： Wei Fan , Haixun Wang , Philip Yu
发明人： Wei Fan , Haixun Wang , Philip Yu
IPC分类号： G06F17/30
CPC分类号： G06F17/30911 , Y10S707/99933 , Y10S707/99943
摘要： The present invention provides a ViST (or “virtual suffix tree”), which is a novel index structure for searching XML documents. By representing both XML documents and XML queries in structure-encoded sequences, it is shown that querying XML data is equivalent to finding (non-contiguous) subsequence matches. A variety of XML queries, including those with branches, or wild-cards (‘*’ and ‘//’), can be expressed by structure-encoded sequences. Unlike index methods that disassemble a query into multiple sub-queries, and then join the results of these sub-queries to provide the final answers, ViST uses tree structures as the basic unit of query to avoid expensive join operations. Furthermore, ViST provides a unified index on both content and structure of the XML documents, hence it has a performance advantage over methods indexing either just content or structure. ViST supports dynamic index update, and it relies solely on B+Trees without using any specialized data structures that are not well supported by common database management systems (hereinafter referred to as “DBMSs”).
摘要翻译：本发明提供了一种ViST（或“虚拟后缀树”），其是用于搜索XML文档的新型索引结构。通过在结构编码序列中同时表示XML文档和XML查询，显示查询XML数据等同于查找（非连续）子序列匹配。各种XML查询（包括具有分支的查询）或通配符（'*'和'//'）可以由结构编码的序列表示。不同于将查询反汇编成多个子查询的索引方法，然后加入这些子查询的结果以提供最终答案，ViST使用树结构作为查询的基本单位，以避免昂贵的连接操作。此外，ViST为XML文档的内容和结构提供了一个统一的索引，因此与仅通过内容或结构索引方法相比，它具有性能优势。 ViST支持动态索引更新，它仅仅依赖于B＆lt; +＆gt;树，而不使用通用数据库管理系统（以下简称“DBMS”）不能很好支持的任何专门的数据结构。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式