公开(公告)号：US08301584B2

公开(公告)日：2012-10-30

申请号：US10737123

申请日：2003-12-16

申请人： Wei Fan ,  Haixun Wang ,  Philip S. Yu

发明人： Wei Fan ,  Haixun Wang ,  Philip S. Yu

IPC分类号： G06F7/00 ,  G06F3/00

CPC分类号： G06F17/30539 ,  G06F17/30598

摘要： Disclosed in a method and structure for searching data in databases using an ensemble of models. First the invention performs training. This training orders models within the ensemble in order of prediction accuracy and joins different numbers of models together to form sub-ensembles. The models are joined together in the sub-ensemble in the order of prediction accuracy. Next in the training process, the invention calculates confidence values of each of the sub-ensembles. The confidence is a measure of how closely results form the sub-ensemble will match results from the ensemble. The size of each of the sub-ensembles is variable depending upon the level of confidence, while, to the contrary, the size of the ensemble is fixed. After the training, the invention can make a prediction. First, the invention selects a sub-ensemble that meets a given level of confidence. As the level of confidence is raised, a sub-ensemble that has more models will be selected and as the level of confidence is lowered, a sub-ensemble that has fewer models will be selected. Finally, the invention applies the selected sub-ensemble, in place of the ensemble, to an example to make a prediction.

摘要翻译： 公开了一种使用模型集合在数据库中搜索数据的方法和结构。 首先，发明执行训练。 这种训练按照预测精度的顺序对集合内的模型进行排序，并将不同数量的模型结合在一起形成子集合。 这些模型以预测精度的顺序连接在子集合中。 接下来在训练过程中，本发明计算每个子集合的置信度值。 信心是衡量子系统的结果与合奏结果相符的结果。 每个子集合的大小根据置信水平而变化，而相反，整体的大小是固定的。 训练后，本发明可以进行预测。 首先，本发明选择满足给定的置信水平的子集合。 随着信心的提高，将选择具有更多模型的子集合，并且随着置信度的降低，将选择具有较少模型的子集合。 最后，本发明将选择的子集合代替集合应用于一个例子进行预测。

公开(公告)号：US08086550B2

公开(公告)日：2011-12-27

申请号：US11846004

申请日：2007-08-28

申请人： Charu Aggarwal ,  Philip S. Yu

发明人： Charu Aggarwal ,  Philip S. Yu

IPC分类号： G06N5/00

CPC分类号： G06K9/6226 ,  G06K9/6259

摘要： Uncertain data is classified by constructing an error adjusted probability density estimate for the data, and applying a subspace exploration process to the probability density estimate to classify the data.

摘要翻译： 通过构建数据的误差调整概率密度估计和将子空间探索过程应用于概率密度估计来对数据进行分类来分类不确定的数据。

公开(公告)号：US07890294B2

公开(公告)日：2011-02-15

申请号：US12115166

申请日：2008-05-05

申请人： Vittorio Castelli ,  Michail Vlachos ,  Philip S. Yu

发明人： Vittorio Castelli ,  Michail Vlachos ,  Philip S. Yu

IPC分类号： G06F15/00

CPC分类号： G06K9/00523 ,  Y10S706/90 ,  Y10S707/99936 ,  Y10S707/99937 ,  Y10S707/99945 ,  Y10S707/99953

摘要： Arrangements are provided for performing structural clustering between different time series. Time series data relating to a plurality of time series is accepted, structural features relating to the time series data are ascertained, and at least one distance between different time series via employing the structural features is determined. The different time series may be partitioned into clusters based on the at least one distance, and/or the k closest matches to a given time series query based on the at least one distance may be returned.

摘要翻译： 提供了在不同时间序列之间进行结构聚类的安排。 接收与多个时间序列相关的时间序列数据，确定与时间序列数据相关的结构特征，并且确定通过采用结构特征的不同时间序列之间的至少一个距离。 可以基于至少一个距离将不同的时间序列划分成簇，并且可以返回基于至少一个距离的/或与给定时间序列查询的k个最接近的匹配。

公开(公告)号：US07853545B2

公开(公告)日：2010-12-14

申请号：US11678786

申请日：2007-02-26

申请人： Yuan-Chi Chang ,  Feifei Li ,  Spyridon Papadimitriou ,  George A. Mihaila ,  Ioana Stanoi ,  Jimeng Sun ,  Philip S. Yu

发明人： Yuan-Chi Chang ,  Feifei Li ,  Spyridon Papadimitriou ,  George A. Mihaila ,  Ioana Stanoi ,  Jimeng Sun ,  Philip S. Yu

IPC分类号： G06F17/00

CPC分类号： H04L63/0407 ,  G06F21/6245 ,  G06F2207/7219

摘要： Disclosed is a method, information processing system, and computer readable medium for preserving privacy of nonstationary data streams. The method includes receiving at least one nonstationary data stream with time dependent data. Calculating, for a given instant of sub-space of time, A set of first-moment statistical values is calculated, for a given instant of sub-space of time, for the data. The first moment statistical values include a principal component for the sub-space of time. The data is perturbed with noise along the principal component in proportion to the first-moment of statistical values so that at least part of a set of second-moment statistical values for the data is perturbed by the noise only within a predetermined variance.

摘要翻译： 公开了一种用于保持非平稳数据流的隐私的方法，信息处理系统和计算机可读介质。 该方法包括接收具有时间相关数据的至少一个非平稳数据流。 对于给定时间子空间的计算，对于数据的子时间空间的给定时刻，计算一组一阶统计值。 第一时刻统计值包括时间子空间的主成分。 数据按照与主要分量成比例的噪声与第一时刻的统计值相互扰动，使得数据的至少一部分二阶统计值仅在预定方差内被噪声扰动。

公开(公告)号：US20100169252A1

公开(公告)日：2010-07-01

申请号：US12690502

申请日：2010-01-20

申请人： Wei Fan ,  Haixun Wang ,  Philip S. Yu

发明人： Wei Fan ,  Haixun Wang ,  Philip S. Yu

IPC分类号： G06N3/12 ,  G06F15/18

CPC分类号： G06N99/005

摘要： A method (and structure) for processing an inductive learning model for a dataset of examples, includes dividing the dataset of examples into a plurality of subsets of data and generating, using a processor on a computer, a learning model using examples of a first subset of data of the plurality of subsets of data. The learning model being generated for the first subset comprises an initial stage of an evolving aggregate learning model (ensemble model) for an entirety of the dataset, the ensemble model thereby providing an evolving estimated learning model for the entirety of the dataset if all the subsets were to be processed. The generating of the learning model using data from a subset includes calculating a value for at least one parameter that provides an objective indication of an adequacy of a current stage of the ensemble model.

摘要翻译： 一种用于处理实例的数据集的感应学习模型的方法（和结构），包括将示例的数据集划分成多个数据子集，并使用计算机上的处理器生成使用第一子集的示例的学习模型 的多个数据子集的数据。 为第一子集生成的学习模型包括用于整个数据集的演进聚合学习模型（集合模型）的初始阶段，从而为整个数据集提供演进的估计学习模型，如果所有子集 被处理。 使用来自子集的数据生成学习模型包括计算至少一个参数的值，所述参数提供对所述集合模型的当前阶段的充分性的客观指示。

公开(公告)号：US07720841B2

公开(公告)日：2010-05-18

申请号：US11538525

申请日：2006-10-04

申请人： Xiaohui Gu ,  Philip S. Yu ,  Shu-Ping Chang

发明人： Xiaohui Gu ,  Philip S. Yu ,  Shu-Ping Chang

IPC分类号： G06F13/14

CPC分类号： G06F17/30575 ,  G06F11/3447 ,  G06F11/3495 ,  G06F17/30463 ,  G06F2201/81 ,  Y10S707/966

摘要： Disclosed are a method, information processing system, and computer readable medium for managing data collection in a distributed processing system. The method includes dynamically collecting at least one statistical query pattern associated with a selected group of information processing nodes. The statistical query pattern is dynamically collected from a plurality of information processing nodes in a distributed processing system. At least one operating attribute distribution associated with an operating attribute that has been queried for the selected group is dynamically monitored. The selected group is dynamically configured, based on the query pattern and the operating attribute distribution, to periodically push a set of attributes associated with the each information processing node in the selected group.

摘要翻译： 公开了一种用于管理分布式处理系统中的数据收集的方法，信息处理系统和计算机可读介质。 该方法包括动态地收集与所选择的一组信息处理节点相关联的至少一个统计查询模式。 统计查询模式是从分布式处理系统中的多个信息处理节点动态收集的。 动态地监视与被选择组查询的操作属性相关联的至少一个操作属性分布。 基于查询模式和操作属性分布动态地配置所选择的组，以周期性地推送与所选择的组中的每个信息处理节点相关联的一组属性。

公开(公告)号：US20090074043A1

公开(公告)日：2009-03-19

申请号：US12177300

申请日：2008-07-22

申请人： Deepak Srinivac Turaga ,  Michail Vlachos ,  Philip S. Yu

发明人： Deepak Srinivac Turaga ,  Michail Vlachos ,  Philip S. Yu

IPC分类号： H04B17/00

CPC分类号： G06F17/141

摘要： Streaming environments typically dictate incomplete or approximate algorithm execution, in order to cope with sudden surges in the data rate. Such limitations are even more accentuated in mobile environments (such as sensor networks) where computational and memory resources are typically limited. Introduced herein is a novel “resource adaptive” algorithm for spectrum and periodicity estimation on a continuous stream of data. The formulation is based on the derivation of a closed-form incremental computation of the spectrum, augmented by an intelligent load-shedding scheme that can adapt to available CPU resources. Experimentation indicates that the proposed technique can be a viable and resource efficient solution for real-time spectrum estimation.

摘要翻译： 流环境通常会指示不完整或近似算法执行，以应对数据速率的突然增加。 在计算和存储资源通常受限制的移动环境（如传感器网络）中，这种限制更加突出。 这里介绍的是一种用于连续数据流的频谱和周期估计的新型“资源自适应”算法。 该公式基于频谱的闭合增量计算的推导，通过可以适应可用CPU资源的智能加载开放方案来增强。 实验表明，提出的技术可以成为实时频谱估计的可行且资源有效的解决方案。

公开(公告)号：US20090060095A1

公开(公告)日：2009-03-05

申请号：US11846004

申请日：2007-08-28

申请人： Charu Aggarwal ,  Philip S. Yu

发明人： Charu Aggarwal ,  Philip S. Yu

IPC分类号： H03D1/00 ,  H04L27/06

CPC分类号： G06K9/6226 ,  G06K9/6259

摘要： Uncertain data is classified by constructing an error adjusted probability density estimate for the data, and applying a subspace exploration process to the probability density estimate to classify the data.

摘要翻译： 通过构建数据的误差调整概率密度估计和将子空间探索过程应用于概率密度估计来对数据进行分类来分类不确定的数据。

公开(公告)号：US07475070B2

公开(公告)日：2009-01-06

申请号：US11035889

申请日：2005-01-14

申请人： Wei Fan ,  Haixun Wang ,  Philip S. Yu

发明人： Wei Fan ,  Haixun Wang ,  Philip S. Yu

IPC分类号： G06F17/30 ,  G06F17/00

CPC分类号： G06F17/30935 ,  Y10S707/99933 ,  Y10S707/99936

摘要： Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answered holistically through subsequence matching. Herein, there is addressed the problem of query equivalence with respect to this transformation, and thereis introduced a performance-oriented principle for sequencing tree structures. With query equivalence, XML queries can be performed through subsequence matching without join operations, post-processing, or other special handling for problems such as false alarms. There is identified a class of sequencing methods for this purpose, and there is presented a novel subsequence matching algorithm that observe query equivalence. Also introduced is a performance-oriented principle to guide the sequencing of tree structures. For any given XML dataset, the principle finds an optimal sequencing strategy according to its schema and its data distribution; there is thus presented herein a novel method that realizes this principle.

摘要翻译： 基于序列的XML索引旨在避免查询处理中的昂贵的联接操作。 它将结构化XML数据转换为序列，以便可以通过子序列匹配整体回答结构化查询。 这里，针对这种转换的查询等价问题，提出了一种用于排序树结构的性能导向原理。 通过查询等价，可以通过子序列匹配执行XML查询，无需连接操作，后处理或其他特殊处理，例如虚假警报等问题。 确定了一类用于此目的的测序方法，并提出了一种观察查询等价性的新颖的子序列匹配算法。 还引入了一种以性能为导向的原则来指导树结构的排序。 对于任何给定的XML数据集，该原理根据其模式及其数据分布找到最佳排序策略; 因此在此呈现了实现这一原理的新颖方法。

公开(公告)号：US07464068B2

公开(公告)日：2008-12-09

申请号：US10880913

申请日：2004-06-30

申请人： Wei Fan ,  Haixun Wang ,  Philip S. Yu

发明人： Wei Fan ,  Haixun Wang ,  Philip S. Yu

IPC分类号： G06F17/30

CPC分类号： G06F17/30017 ,  G06F2216/03 ,  Y10S707/99931 ,  Y10S707/99935

摘要： In connection with the mining of time-evolving data streams, a general framework that mines changes and reconstructs models from a data stream with unlabeled instances or a limited number of labeled instances. In particular, there are defined herein statistical profiling methods that extend a classification tree in order to guess the percentage of drifts in the data stream without any labelled data. Exact error can be estimated by actively sampling a small number of true labels. If the estimated error is significantly higher than empirical expectations, there preferably re-sampled a small number of true labels to reconstruct the decision tree from the leaf node level.

摘要翻译： 与挖掘时间不断变化的数据流有关的一般框架，即从具有未标记实例的数据流或有限数量的标记实例中挖掘变更和重建模型。 特别地，这里定义了扩展分类树的统计分析方法，以便在没有任何标记数据的情况下猜测数据流中漂移的百分比。 可以通过主动抽取少量真实标签来估计精确误差。 如果估计的误差明显高于经验期望值，则最好重新采样少量的真实标签，以从叶节点级别重建决策树。