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

1. 发明申请

US20060026203A1 Method and system for discovering knowledge from text documents 有权
标题翻译：从文本文档中发现知识的方法和系统
公开(公告)号：US20060026203A1
公开(公告)日：2006-02-02
申请号：US10532163
申请日：2002-10-24
申请人： Ah Hwee Tan , Rajaraman Kanagasabai
发明人： Ah Hwee Tan , Rajaraman Kanagasabai
IPC分类号： G06F17/00
CPC分类号： G06F17/277 , G06F17/278 , G06F17/30705 , G06N5/022
摘要： A method and a system for discovering knowledge from text documents are disclosed, which involve extracting from text documents semi-structured meta-data, wherein the semi-structured meta-data includes a plurality of entities and a plurality of relations between the entities; identifying from the semi-structured meta-data a plurality of key entities and a corresponding plurality of key relations; deriving from a domain knowledge base a plurality of attributes relating to each of the plurality of entities relating to one of the plurality of key entities for forming a plurality of pairs of key entity and a plurality of attributes related thereto; formulating a plurality of patterns, each of the plurality of patterns relating to one of the plurality of pairs of key entity and a plurality of attributes related thereto; analyzing the plurality of patterns using an associative discoverer; and interpreting the output of the associative discoverer for discovering knowledge.
摘要翻译：公开了一种用于从文本文档中发现知识的方法和系统，其涉及从文本文档中提取半结构化元数据，其中所述半结构化元数据包括所述多个实体和所述实体之间的多个关系; 从所述半结构化元数据识别多个关键实体和对应的多个关键关系; 从域知识库导出与所述多个关键实体中的一个相关联的多个实体中的每一个相关联的多个属性，用于形成多个关键实体对和与其相关的多个属性; 制定多个模式，所述多个模式中的每一个与所述多个密钥实体对中的一个相关联，以及与其相关的多个属性; 使用关联发现者分析多个模式; 并解释相关发现者的输出以发现知识。

2. 发明授权

US07734556B2 Method and system for discovering knowledge from text documents using associating between concepts and sub-concepts 有权
标题翻译：通过概念和子概念之间的关联，从文本文档中发现知识的方法和系统
公开(公告)号：US07734556B2
公开(公告)日：2010-06-08
申请号：US10532163
申请日：2002-10-24
申请人： Ah Hwee Tan , Rajaraman Kanagasabai
发明人： Ah Hwee Tan , Rajaraman Kanagasabai
IPC分类号： G06F17/00 , G06N5/00
CPC分类号： G06F17/277 , G06F17/278 , G06F17/30705 , G06N5/022
摘要： A method and a system for discovering knowledge from text documents are disclosed, which involve extracting from text documents semi-structured meta-data, wherein the semi-structured meta-data includes a plurality of entities and a plurality of relations between the entities; identifying from the semi-structured meta-data a plurality of key entities and a corresponding plurality of key relations; deriving from a domain knowledge base a plurality of attributes relating to each of the plurality of entities relating to one of the plurality of key entities for forming a plurality of pairs of key entity and a plurality of attributes related thereto; formulating a plurality of patterns, each of the plurality of patterns relating to one of the plurality of pairs of key entity and a plurality of attributes related thereto; analyzing the plurality of patterns using an associative discoverer; and interpreting the output of the associative discoverer for discovering knowledge.
摘要翻译：公开了一种用于从文本文档中发现知识的方法和系统，其涉及从文本文档中提取半结构化元数据，其中所述半结构化元数据包括所述多个实体和所述实体之间的多个关系; 从所述半结构化元数据识别多个关键实体和对应的多个关键关系; 从域知识库导出与所述多个关键实体中的一个相关联的多个实体中的每一个相关联的多个属性，用于形成多个关键实体对和与其相关的多个属性; 制定多个模式，所述多个模式中的每一个与所述多个密钥实体对中的一个相关联，以及与其相关的多个属性; 使用关联发现者分析多个模式; 并解释相关发现者的输出以发现知识。

3. 发明申请

US20120136854A1 METHOD OF OBTAINING A CORRESPONDENCE BETWEEN A PROTEIN AND A SET OF INSTANCES OF MUTATIONS OF THE PROTEIN 审中-公开
标题翻译：获得蛋白质与蛋白质突变体的相关性的方法
公开(公告)号：US20120136854A1
公开(公告)日：2012-05-31
申请号：US13260722
申请日：2010-03-26
申请人： Rajaraman Kanagasabai , Christopher James Oliver Baker
发明人： Rajaraman Kanagasabai , Christopher James Oliver Baker
IPC分类号： G06F17/30
CPC分类号： G16B50/00 , G16B30/00
摘要： A method of obtaining a correspondence between a protein and a set of instances i=1 . . . , k of mutations of the protein is disclosed. The method includes: a) matching a plurality of protein sequences in a sequence bank to at least one expression formed using the set of instances of mutations wherein each protein sequence comprises a plurality of amino acid residues of the protein's constituent peptides and wherein the at least one expression includes wild type residues of a subset of the instances of mutations in the order of their positions within the protein, and differences in said positions of the successive wild type residues in the expression; b) ranking the protein sequences according to the similarity of the protein sequences to the set of instances of mutations, the similarity of the protein sequences to the set of instances of mutations being determined by the matching in step (a); and c) retaining the protein sequence with the highest similarity ranking, said correspondence being a relationship between the retained protein sequence and a subset of the instances of mutations corresponding to the retained protein sequence.
摘要翻译：一种获得蛋白质和一组实例i = 1之间的对应关系的方法。。。公开了该蛋白质的突变k。该方法包括：a）将序列库中的多个蛋白质序列与使用一组突变实例形成的至少一个表达进行匹配，其中每个蛋白质序列包含蛋白质组成肽的多个氨基酸残基，并且其中至少一个表达包括其位于蛋白质内的位置的顺序的突变实例的子集的野生型残基，以及表达中连续野生型残基的所述位置的差异; b）根据蛋白质序列与一组突变实例的相似性对蛋白质序列进行排序，通过步骤（a）中的匹配确定蛋白质序列与一组突变实例的相似性; 和c）保留具有最高相似性排名的蛋白质序列，所述对应关系是保留的蛋白质序列与对应于保留的蛋白质序列的突变实例的亚类之间的关系。

4. 发明申请

US20130173388A1 METHODS AND SYSTEMS FOR SERVICE DISCOVERY AND SELECTION 审中-公开
标题翻译：服务发现与选择的方法与系统
公开(公告)号：US20130173388A1
公开(公告)日：2013-07-04
申请号：US13730114
申请日：2012-12-28
申请人： Duy Ngan LE , Rajaraman Kanagasabai
发明人： Duy Ngan LE , Rajaraman Kanagasabai
IPC分类号： G06Q30/02
CPC分类号： G06Q30/0256
摘要： A systems and method are proposed that address the task of locating advertised services satisfying specific requirements described by a service request, and ranking discovered services so as to enable selection of best services among them. Real life scenarios often involve services described with complex pre- and post-conditions, and have Quality of Service (QoS) associated with them. The proposed method and apparatus support a unified matching of functional as well as non-functional service properties: input-output, complex constraints, and QoS. A novel service discovery and selection algorithm can adaptively locate advertised services by performing a flexible matching of the three service properties. The algorithm is capable of returning partially matched services should there be no exact match.
摘要翻译：提出了一种满足服务请求描述的特定要求的广告业务定位任务的系统和方法，并对发现的服务进行排序，以便能够选择最佳业务。现实生活中的场景常常涉及到复杂的前后条件描述的服务，并且具有与他们相关的服务质量（QoS）。所提出的方法和装置支持功能和非功能服务属性的统一匹配：输入输出，复杂约束和QoS。一种新颖的服务发现和选择算法可以通过执行三种服务属性的灵活匹配来自适应地定位广告服务。如果没有完全匹配，该算法能够返回部分匹配的服务。

5. 发明授权

US07346491B2 Method of text similarity measurement 失效
标题翻译：文本相似度测量方法
公开(公告)号：US07346491B2
公开(公告)日：2008-03-18
申请号：US10250746
申请日：2001-01-04
申请人： Rajaraman Kanagasabai , Hong Pan
发明人： Rajaraman Kanagasabai , Hong Pan
IPC分类号： G06F15/62
CPC分类号： G06F17/271
摘要： In one aspect, the present invention provides a for estimating the similarity between at least two portions of text including the steps of forming a set of syntactic tuples, each tuple including at least two terms and a relation betweeen the two terms; classifying the relation between the terms in the tuples according to a predefined set of relations; establishing the relative agreement between syntactic tuples from the portions of text under comparison according to predefined classes of agreement; calculating a value representative of the similarity between the portions of text of each of the classes of agreement; and establishing a value for the similarity between the portions of text by calculating a weighted sum of the values representative of the similarity between the portions of text for each of the classes of agreement. Preferaly, the step of calculating a value representative of the similarity between the portions of text for each of the classes of agreement includes a weighting based upon the number of matched terms occurring in particular parts of speech in which the text occurs. It is also preferred that the step of calculating a value representative of the similarity between the portions of text for each of the classes of agreement include the application of a weighting factor to the estimate of similarity for each of the classes of agreement and the parts of speech in which matched terms occur.
摘要翻译：一方面，本发明提供一种用于估计文本的至少两部分之间的相似性，包括形成一组句法元组的步骤，每个元组包括至少两个术语和两个术语之间的关系; 根据预定义的一组关系对元组中的术语之间的关系进行分类; 根据预定义的协议类型，根据比较文本部分确定句法元组之间的相对协议; 计算代表每个协议类别的文本部分之间的相似性的值; 以及通过计算表示每个协议类别的文本部分之间的相似度的值的加权和来建立文本部分之间的相似性的值。优选地，计算表示每个协议类别的文本部分之间的相似性的值的步骤包括基于在文本发生的特定话音部分中出现的匹配项的数量的加权。还优选的是，计算表示每个协议类别的文本部分之间的相似性的值的步骤包括将权重因子应用于每个协议类别的相似度估计和部分发生匹配术语的演讲。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式