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

1. 发明授权

US07243100B2 Methods and apparatus for mining attribute associations 失效
标题翻译：挖掘属性关联的方法和装置
公开(公告)号：US07243100B2
公开(公告)日：2007-07-10
申请号：US10630992
申请日：2003-07-30
申请人： Sheng Ma , Chang-shing Perng , Haixun Wang , Philip Shi-Lung Yu
发明人： Sheng Ma , Chang-shing Perng , Haixun Wang , Philip Shi-Lung Yu
IPC分类号： G06F17/30 , G06F17/00
CPC分类号： G06F17/18 , G06F17/30539 , Y10S707/99936 , Y10S707/99937 , Y10S707/99943
摘要： Attribute association discovery techniques that support relational-based data mining are disclosed. In one aspect of the invention, a technique for mining attribute associations in a relational data set comprises the following steps/operations. Multiple items are obtained from the relational data set. Then, attribute associations are discovered using: (i) multi-attribute mining templates formed from at least a portion of the multiple items; and (ii) one or more mining preferences specified by a user. The invention provides a novel architecture for the mining search space so as to exploit the inter-relationships among patterns of different templates. The framework is relational-sensitive and supports interactive and online mining.
摘要翻译：公开了支持基于关系的数据挖掘的属性关联发现技术。在本发明的一个方面，用于挖掘关系数据集中的属性关联的技术包括以下步骤/操作。从关系数据集获得多个项目。然后，使用以下方式发现属性关联：（i）由多个项目的至少一部分形成的多属性挖掘模板; 和（ii）用户指定的一个或多个挖掘偏好。本发明提供了一种用于挖掘搜索空间的新型架构，以便利用不同模板的模式之间的相互关系。该框架是关系敏感的，支持交互式和在线挖掘。

2. 发明授权

US09009176B2 System and method for indexing weighted-sequences in large databases 有权
标题翻译：用于索引大数据库中加权序列的系统和方法
公开(公告)号：US09009176B2
公开(公告)日：2015-04-14
申请号：US12198717
申请日：2008-08-26
申请人： Wei Fan , Chang-Shing Perng , Haixun Wang , Philip Shi-Lung Yu
发明人： Wei Fan , Chang-Shing Perng , Haixun Wang , Philip Shi-Lung Yu
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30327 , G06F17/30548 , Y10S707/99943
摘要： The present invention provides an index structure for managing weighted-sequences in large databases. A weighted-sequence is defined as a two-dimensional structure in which each element in the sequence is associated with a weight. A series of network events, for instance, is a weighted-sequence because each event is associated with a timestamp. Querying a large sequence database by events' occurrence patterns is a first step towards understanding the temporal causal relationships among the events. The index structure proposed herein enables the efficient retrieval from the database of all subsequences (contiguous and non-contiguous) that match a given query sequence both by events and by weights. The index structure also takes into consideration the nonuniform frequency distribution of events in the sequence data.
摘要翻译：本发明提供了一种用于在大数据库中管理加权序列的索引结构。加权序列被定义为二维结构，其中序列中的每个元素与权重相关联。例如，一系列网络事件是加权序列，因为每个事件都与时间戳相关联。通过事件发生模式查询大序列数据库是了解事件之间的时间因果关系的第一步。这里提出的索引结构使得能够通过事件和权重从数据库有效地检索与给定查询序列匹配的所有子序列（连续的和不连续的）。索引结构还考虑了序列数据中事件的不均匀频率分布。

3. 发明授权

US07418455B2 System and method for indexing weighted-sequences in large databases 有权
标题翻译：用于索引大数据库中加权序列的系统和方法
公开(公告)号：US07418455B2
公开(公告)日：2008-08-26
申请号：US10723229
申请日：2003-11-26
申请人： Wei Fan , Chang-Shing Perng , Haixun Wang , Philip Shi-Lung Yu
发明人： Wei Fan , Chang-Shing Perng , Haixun Wang , Philip Shi-Lung Yu
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F17/30327 , G06F17/30548 , Y10S707/99943
摘要： The present invention provides an index structure for managing weighted-sequences in large databases. A weighted-sequence is defined as a two-dimensional structure in which each element in the sequence is associated with a weight. A series of network events, for instance, is a weighted-sequence because each event is associated with a timestamp. Querying a large sequence database by events' occurrence patterns is a first step towards understanding the temporal causal relationships among the events. The index structure proposed herein enables the efficient retrieval from the database of all subsequences (contiguous and non-contiguous) that match a given query sequence both by events and by weights. The index structure also takes into consideration the nonuniform frequency distribution of events in the sequence data.
摘要翻译：本发明提供了一种用于在大数据库中管理加权序列的索引结构。加权序列被定义为二维结构，其中序列中的每个元素与权重相关联。例如，一系列网络事件是加权序列，因为每个事件都与时间戳相关联。通过事件发生模式查询大序列数据库是了解事件之间的时间因果关系的第一步。这里提出的索引结构使得能够通过事件和权重从数据库有效地检索与给定查询序列匹配的所有子序列（连续的和不连续的）。索引结构还考虑了序列数据中事件的不均匀频率分布。

4. 发明授权

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”）不太支持的任何专门的数据结构。

5. 发明授权

US07287023B2 Index structure for supporting structural XML queries 失效
标题翻译：用于支持结构XML查询的索引结构
公开(公告)号：US07287023B2
公开(公告)日：2007-10-23
申请号：US10723206
申请日：2003-11-26
申请人： Wei Fan , Haixun Wang , Philip Shi-Lung Yu
发明人： Wei Fan , Haixun Wang , Philip Shi-Lung 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”）不能很好地支持的任何专门的数据结构。

6. 发明授权

US07970772B2 Methods and apparatus for data stream clustering for abnormality monitoring 有权
标题翻译：用于异常监测的数据流聚类的方法和装置
公开(公告)号：US07970772B2
公开(公告)日：2011-06-28
申请号：US11753232
申请日：2007-05-24
申请人： Charu C. Aggarwal , Philip Shi-Lung Yu
发明人： Charu C. Aggarwal , Philip Shi-Lung Yu
IPC分类号： G06F7/00 , G06F17/30 , G06F15/16
CPC分类号： G06K9/6284 , Y10S707/952
摘要： Techniques for monitoring abnormalities in a data stream are provided. A plurality of objects are received from the data stream and one or more clusters are created from these objects. At least a portion of the one or more clusters have statistical data of the respective cluster. It is determined from the statistical data whether one or more abnormalities exist in the data stream.
摘要翻译：提供了用于监视数据流异常的技术。从数据流接收多个对象，并从这些对象创建一个或多个聚类。一个或多个集群的至少一部分具有相应集群的统计数据。从统计数据确定数据流中是否存在一个或多个异常。

7. 发明授权

US07917517B2 Method and apparatus for query processing of uncertain data 有权
标题翻译：不确定性数据查询处理方法与装置
公开(公告)号：US07917517B2
公开(公告)日：2011-03-29
申请号：US12039091
申请日：2008-02-28
申请人： Charu C. Aggarwal , Philip Shi-Lung Yu
发明人： Charu C. Aggarwal , Philip Shi-Lung Yu
IPC分类号： G06F17/30
CPC分类号： G06F17/30657
摘要： Techniques are disclosed for indexing uncertain data in query processing systems. For example, a method for processing queries in an application that involves an uncertain data set includes the following steps. A representation of records of the uncertain data set is created based on mean values and uncertainty values. The representation is utilized for processing a query received on the uncertain data set.
摘要翻译：公开了用于在查询处理系统中索引不确定数据的技术。例如，在涉及不确定数据集的应用程序中处理查询的方法包括以下步骤。基于平均值和不确定性值创建不确定数据集的记录表示。该表示用于处理在不确定数据集上接收到的查询。

8. 发明申请

US20090319526A1 Method and Apparatus for Variable Privacy Preservation in Data Mining 失效
标题翻译：数据挖掘中可变隐藏保护的方法和装置
公开(公告)号：US20090319526A1
公开(公告)日：2009-12-24
申请号：US12119766
申请日：2008-05-13
申请人： Charu C. Aggarwal , Philip Shi-Lung Yu
发明人： Charu C. Aggarwal , Philip Shi-Lung Yu
IPC分类号： G06F17/30
CPC分类号： G06F21/604 , G06F21/6245 , G06F21/6254
摘要： Improved privacy preservation techniques are disclosed for use in accordance with data mining. By way of example, a technique for preserving privacy of data records for use in a data mining application comprises the following steps/operations. Different privacy levels are assigned to the data records. Condensed groups are constructed from the data records based on the privacy levels, wherein summary statistics are maintained for each condensed group. Pseudo-data is generated from the summary statistics, wherein the pseudo-data is available for use in the data mining application. Principles of the invention are capable of handling both static and dynamic data sets
摘要翻译：公开了根据数据挖掘使用的改进的隐私保护技术。作为示例，用于保留用于数据挖掘应用的数据记录的隐私的技术包括以下步骤/操作。不同的隐私级别被分配给数据记录。基于隐私级别的数据记录构建简化组，其中为每个缩合组维护概要统计。从总结统计生成伪数据，其中伪数据可用于数据挖掘应用程序。本发明的原理能够处理静态和动态数据集

9. 发明申请

US20090222472A1 Method and Apparatus for Aggregation in Uncertain Data 有权
标题翻译：不确定数据聚合的方法和装置
公开(公告)号：US20090222472A1
公开(公告)日：2009-09-03
申请号：US12039076
申请日：2008-02-28
申请人： Charu C. Aggarwal , Philip Shi-Lung Yu
发明人： Charu C. Aggarwal , Philip Shi-Lung Yu
IPC分类号： G06F17/30
CPC分类号： G06F17/30489
摘要： Techniques are disclosed for aggregation in uncertain data in data processing systems. For example, a method of aggregation in an application that involves an uncertain data set includes the following steps. The uncertain data set along with uncertainty information is obtained. One or more clusters of data points are constructed from the data set. Aggregate statistics of the one or more clusters and uncertainty information are stored. The data set may be data from a data stream. It is realized that the use of even modest uncertainty information during an application such as a data mining process is sufficient to greatly improve the quality of the underlying results.
摘要翻译：公开了用于在数据处理系统中的不确定数据中聚合的技术。例如，涉及不确定数据集的应用程序中的聚合方法包括以下步骤。获得不确定性数据集以及不确定性信息。从数据集构建一个或多个数据点簇。存储一个或多个聚类和不确定性信息的聚合统计信息。数据集可以是来自数据流的数据。实现在诸如数据挖掘过程的应用中使用甚至适度的不确定性信息足以大大提高底层结果的质量。

10. 发明申请

US20090222410A1 Method and Apparatus for Query Processing of Uncertain Data 有权
标题翻译：不确定数据查询处理方法与装置
公开(公告)号：US20090222410A1
公开(公告)日：2009-09-03
申请号：US12039091
申请日：2008-02-28
申请人： Charu C. Aggarwal , Philip Shi-Lung Yu
发明人： Charu C. Aggarwal , Philip Shi-Lung Yu
IPC分类号： G06F7/06 , G06F17/30
CPC分类号： G06F17/30657
摘要： Techniques are disclosed for indexing uncertain data in query processing systems. For example, a method for processing queries in an application that involves an uncertain data set includes the following steps. A representation of records of the uncertain data set is created based on mean values and uncertainty values. The representation is utilized for processing a query received on the uncertain data set.
摘要翻译：公开了用于在查询处理系统中索引不确定数据的技术。例如，在涉及不确定数据集的应用程序中处理查询的方法包括以下步骤。基于平均值和不确定性值创建不确定数据集的记录表示。该表示用于处理在不确定数据集上接收到的查询。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式