会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明申请
    • Method and apparatus for order-preserving clustering of multi-dimensional data
    • 用于订单保存多维数据聚类的方法和装置
    • US20060155394A1
    • 2006-07-13
    • US11013483
    • 2004-12-16
    • Tanveer Syeda-Mahmood
    • Tanveer Syeda-Mahmood
    • G05B11/01
    • G06K9/00496
    • A method of clustering ordered data sets, wherein the method comprises forming n-dimensional curvilinear representations from an ordered data set; formulating a n+1-dimensional curvilinear representation from a pair of ordered data sets; computing a similarity of the pair of ordered data sets using a similarity between the n-dimensional curvilinear representations and the n+1-dimensional curvilinear representation; and clustering ordered data sets based on the similarity between the n-dimensional curvilinear representations and the n+1-dimensional curvilinear representation. In the n-dimensional curvilinear representations, a first dimension of space corresponds with a common ordering dimension and the remaining dimension of space corresponds with the ordered data set. The process of computing the similarity comprises comparing a shape of the n+1-dimensional curvilinear representation to a shape of each component n-dimensional curvilinear representation. In the computing of the similarity, the shape of the n+1-dimensional curvilinear representation corresponds with inflection points on the n+1-dimensional curvilinear representation.
    • 一种聚类有序数据集的方法,其中所述方法包括从有序数据集合形成n维曲线表示; 从一对有序数据集中形成n + 1维曲线表示; 使用n维曲线表示和n + 1维曲线表示之间的相似度计算所述一对有序数据集的相似性; 并且基于n维曲线表示和n + 1维曲线表示之间的相似性来聚类有序数据集。 在n维曲线表示中,空间的第一维对应于公共排序维度,空间的剩余维数与有序数据集相对应。 计算相似度的过程包括将n + 1维曲线表示的形状与每个分量n维曲线表示的形状进行比较。 在相似度的计算中,n + 1维曲线表示的形状对应于n + 1维曲线表示上的拐点。
    • 7. 发明申请
    • Method, program product and apparatus for discovering functionally similar gene expression profiles
    • 用于发现功能相似的基因表达谱的方法,程序产品和装置
    • US20050027460A1
    • 2005-02-03
    • US10629448
    • 2003-07-29
    • Bhooshan KelkarTanveer Syeda-MahmoodGregor Meyer
    • Bhooshan KelkarTanveer Syeda-MahmoodGregor Meyer
    • G01N33/48G01N33/50G06F19/00
    • G16B40/00G16B25/00
    • Genes to be compared are listed by their gene expression profiles and processed with a similar sequences algorithm that is a time and intensity invariant correlation function to obtain a data set of gene expression pairs and a match fraction for each pair. A threshold match fraction is chosen and a null set is created to hold indices of genes accounted for. Genes are then assigned to clusters by match fraction value if they have a match fraction greater than the threshold. Genes are then removed from clusters if they are represented in more than one cluster by removing a first gene from a cluster when another cluster has another gene with a higher match fraction with the first gene. When the difference between maximum match fraction values for pairs including a first gene in a first cluster and the first gene a second cluster is small, the first gene may be removed from the first cluster even when another gene in the first cluster has a higher match fraction with the first gene than the first gene has with a third gene in a second cluster. This occurs when the number of similar subsequences for the pair including the first gene in the first cluster is higher than the number of similar subsequences for the pair including the first gene in the second cluster.
    • 要比较的基因通过其基因表达谱列出并用类似的序列算法进行处理,该算法是时间和强度不变相关函数,以获得每对基因表达对的数据集和匹配分数。 选择阈值匹配分数,创建一个空值集合来保存基因的索引。 然后,如果基因具有大于阈值的匹配分数,则通过匹配分数值将基因分配给群集。 然后如果基因在多于一个簇中表示,则当从另一个簇具有与第一个基因具有较高匹配分数的另一个基因时,从簇中去除第一个基因,然后将基因除去。 当包括第一簇的第一个基因和第一个基因第二个簇的对的最大匹配分数值之间的差异小时,即使第一个簇中的另一个基因具有较高的匹配,第一个基因也可以从第一个簇中移除 具有第一基因的第一个基因的分数与第二个簇中的第三个基因相同。 当包括第一簇中的第一个基因的对的相似亚序列的数目高于包括第二个簇中的第一个基因的对的相似亚序列的数量时,就发生这种情况。
    • 8. 发明申请
    • FINDING STRUCTURES IN MULTI-DIMENSIONAL SPACES USING IMAGE-GUIDED CLUSTERING
    • 使用图像聚类在多维空间中寻找结构
    • US20090175544A1
    • 2009-07-09
    • US12143131
    • 2008-06-20
    • Tanveer Syeda-MahmoodPeter J. HaasJohn M. LakeGuy Lohman
    • Tanveer Syeda-MahmoodPeter J. HaasJohn M. LakeGuy Lohman
    • G06K9/62
    • G06K9/6219Y10S707/99933Y10S707/99945
    • A data processing system is provided that comprises a processor, a random access memory for storing data and programs for execution by the processor, and computer readable instructions stored in the random access memory for execution by the processor to perform a method for clustering data points in a multidimensional dataset in a multidimensional image space. The method comprises generating a multidimensional image from the multidimensional dataset; generating a pyramid of multidimensional images having varying resolution levels by successively performing a pyramidal sub-sampling of the multidimensional image; identifying data clusters at each resolution level of the pyramid by applying a set of perceptual grouping constraints; and determining levels of a clustering hierarchy by identifying each salient bend in a variation curve of a magnitude of identified data clusters as a function of pyramid resolution level.
    • 提供了一种数据处理系统,其包括处理器,用于存储用于由处理器执行的数据和程序的随机存取存储器,以及存储在随机存取存储器中的计算机可读指令,用于由处理器执行以执行将数据点聚类的方法 多维图像空间中的多维数据集。 该方法包括从多维数据集生成多维图像; 通过连续执行所述多维图像的锥体子采样来生成具有不同分辨率水平的多维图像的金字塔; 通过应用一组感知分组约束来识别金字塔的每个分辨率级别的数据集群; 以及通过将所识别的数据簇的幅度的变化曲线中的每个显着弯曲值确定为金字塔分辨率级别的函数来确定聚类层级的水平。
    • 9. 发明授权
    • Data classification by kernel density shape interpolation of clusters
    • 通过核心密度形状插值进行数据分类
    • US07542954B1
    • 2009-06-02
    • US12164532
    • 2008-06-30
    • Tanveer Syeda-MahmoodPeter J. HaasJohn M. LakeGuy M. Lohman
    • Tanveer Syeda-MahmoodPeter J. HaasJohn M. LakeGuy M. Lohman
    • G06F17/00G06F15/00G06F15/18G06N5/00
    • G06K9/6273G06K9/6226G06N99/005
    • A method for representing a dataset comprises clustering the dataset using an unsupervised, non-parametric clustering method to generate a set of clusters each comprising a set of data points in an image; clustering the data points of each cluster using a supervised, partitional clustering method to partition each cluster into a specified number of sub-clusters; generating a density estimate value of each grid point of a set of grid points sampled from the image at a specified resolution for each sub-cluster using a kernel density function; identifying a maximum density estimate value and a sub-cluster associated with the maximum density estimate value for the grid point; adding each grid point for which the maximum density estimate value exceeds a specified threshold to the sub-cluster associated with the maximum density estimate value; and, for each cluster, merging the sub-clusters of the cluster into a corresponding cluster region in the image.
    • 一种用于表示数据集的方法包括使用无监督的非参数聚类方法对所述数据集进行聚类,以生成每组包括图像中的一组数据点的一组聚类; 使用受监督的分段聚类方法对每个集群的数据点进行聚类,以将每个集群分成指定数量的子集群; 使用核密度函数生成以每个子群体以指定分辨率从图像采样的一组网格点的每个网格点的密度估计值; 识别最大密度估计值和与所述网格点的最大密度估计值相关联的子簇; 将最大密度估计值超过特定阈值的每个网格点添加到与最大密度估计值相关联的子簇; 并且对于每个集群,将集群的子集合合并到图像中的相应集群区域中。