会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 61. 发明授权
    • Systems and methods for condensation-based privacy in strings
    • 字符串中基于冷凝的隐私的系统和方法
    • US08010541B2
    • 2011-08-30
    • US11540406
    • 2006-09-30
    • Charu C. AggarwalPhilip S. Yu
    • Charu C. AggarwalPhilip S. Yu
    • G06F17/30
    • G06F21/6245
    • Novel methods and systems for the privacy preserving mining of string data with the use of simple template based models. Such template based models are effective in practice, and preserve important statistical characteristics of the strings such as intra-record distances. Discussed herein is the condensation model for anonymization of string data. Summary statistics are created for groups of strings, and use these statistics are used to generate pseudo-strings. It will be seen that the aggregate behavior of a new set of strings maintains key characteristics such as composition, the order of the intra-string distances, and the accuracy of data mining algorithms such as classification. The preservation of intra-string distances is a key goal in many string and biological applications which are deeply dependent upon the computation of such distances, while it can be shown that the accuracy of applications such as classification are not affected by the anonymization process.
    • 使用简单的基于模板的模型,用于隐私保护字符串数据挖掘的新方法和系统。 这种基于模板的模型在实践中是有效的,并且保持字符串的重要统计特征,例如记录内距离。 这里讨论的是字符串数据的匿名化的缩合模型。 针对字符串组创建摘要统计信息,并使用这些统计信息来生成伪字符串。 可以看出,一组新的字符串的聚合行为保持关键特征,例如组合,字符串间距离的顺序以及诸如分类的数据挖掘算法的准确性。 字符串间距离的保留是许多字符串和生物应用中的关键目标,这些应用程序深深地依赖于这种距离的计算,而可以显示诸如分类的应用的准确性不受匿名过程的影响。
    • 64. 发明申请
    • SYSTEM AND METHOD FOR SCALABLE COST-SENSITIVE LEARNING
    • 可衡量敏感性学习的系统和方法
    • US20100169252A1
    • 2010-07-01
    • US12690502
    • 2010-01-20
    • Wei FanHaixun WangPhilip S. Yu
    • Wei FanHaixun WangPhilip S. Yu
    • G06N3/12G06F15/18
    • 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.
    • 一种用于处理实例的数据集的感应学习模型的方法(和结构),包括将示例的数据集划分成多个数据子集,并使用计算机上的处理器生成使用第一子集的示例的学习模型 的多个数据子集的数据。 为第一子集生成的学习模型包括用于整个数据集的演进聚合学习模型(集合模型)的初始阶段,从而为整个数据集提供演进的估计学习模型,如果所有子集 被处理。 使用来自子集的数据生成学习模型包括计算至少一个参数的值,所述参数提供对所述集合模型的当前阶段的充分性的客观指示。
    • 65. 发明申请
    • RESOURCE ADAPTIVE SPECTRUM ESTIMATION OF STREAMING DATA
    • 资源自适应频谱估计数据流
    • US20090074043A1
    • 2009-03-19
    • US12177300
    • 2008-07-22
    • Deepak Srinivac TuragaMichail VlachosPhilip S. Yu
    • Deepak Srinivac TuragaMichail VlachosPhilip S. Yu
    • H04B17/00
    • 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资源的智能加载开放方案来增强。 实验表明,提出的技术可以成为实时频谱估计的可行且资源有效的解决方案。
    • 67. 发明授权
    • System and method for tree structure indexing that provides at least one constraint sequence to preserve query-equivalence between xml document structure match and subsequence match
    • 用于树结构索引的系统和方法,其提供至少一个约束序列以保持xml文档结构匹配和子序列匹配之间的查询等价
    • US07475070B2
    • 2009-01-06
    • US11035889
    • 2005-01-14
    • Wei FanHaixun WangPhilip S. Yu
    • Wei FanHaixun WangPhilip S. Yu
    • G06F17/30G06F17/00
    • G06F17/30935Y10S707/99933Y10S707/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数据集,该原理根据其模式及其数据分布找到最佳排序策略; 因此在此呈现了实现这一原理的新颖方法。
    • 68. 发明授权
    • System and method for continuous diagnosis of data streams
    • 用于连续诊断数据流的系统和方法
    • US07464068B2
    • 2008-12-09
    • US10880913
    • 2004-06-30
    • Wei FanHaixun WangPhilip S. Yu
    • Wei FanHaixun WangPhilip S. Yu
    • G06F17/30
    • G06F17/30017G06F2216/03Y10S707/99931Y10S707/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.
    • 与挖掘时间不断变化的数据流有关的一般框架,即从具有未标记实例的数据流或有限数量的标记实例中挖掘变更和重建模型。 特别地,这里定义了扩展分类树的统计分析方法,以便在没有任何标记数据的情况下猜测数据流中漂移的百分比。 可以通过主动抽取少量真实标签来估计精确误差。 如果估计的误差明显高于经验期望值,则最好重新采样少量的真实标签,以从叶节点级别重建决策树。