会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method and apparatus for constructing a compact similarity structure and for using the same in analyzing document relevance
    • 用于构建紧凑型相似度结构并用于分析文档相关性的方法和装置
    • US07949644B2
    • 2011-05-24
    • US12152522
    • 2008-05-15
    • James G. ShanahanNorbert RomaDavid A. Evans
    • James G. ShanahanNorbert RomaDavid A. Evans
    • G06F7/00
    • G06F17/30705Y10S707/99935Y10S707/99942
    • A computer-readable medium comprises data structure for providing information about levels of similarity between pairs of N documents. The data structure comprises a plurality of entries of similarity values representing levels of similarity for a plurality of pairs of the documents. Each of the similarity values represents a level of similarity of one document of a given pair relative to the other document of the given pair. The similarity value of each entry is greater than a threshold similarity value that is greater than zero. The plurality of similarity-value entries are fewer than N2−N in number if the similarity values are asymmetric with regard to document pairing, and the plurality of similarity-value entries are fewer than N 2 - N 2 in number if the similarity values are symmetric with regard to document pairing. A method and apparatus for generating the data structure are described.
    • 计算机可读介质包括用于提供关于N个文档对之间的相似性级别的信息的数据结构。 数据结构包括表示多对文档对象的相似度级的多个相似度条目。 每个相似度值表示给定对的一个文档相对于给定对的另一个文档的相似度级别。 每个条目的相似度值大于大于零的阈值相似度值。 如果相似性值对于文档配对是不对称的,则多个相似值条目数量少于数目中的N2-N,并且如果相似度值是相似度值,则多个相似值条目数量少于N 2 -N 2 对于文件配对。 描述了用于生成数据结构的方法和装置。
    • 2. 发明授权
    • Method and apparatus for constructing a compact similarity structure and for using the same in analyzing document relevance
    • 用于构建紧凑型相似度结构并用于分析文档相关性的方法和装置
    • US07472131B2
    • 2008-12-30
    • US11298500
    • 2005-12-12
    • James G. ShanahanNorbert RomaDavid A. Evans
    • James G. ShanahanNorbert RomaDavid A. Evans
    • G06F7/00G06F17/00G06F17/30
    • G06F17/30705Y10S707/99935Y10S707/99942
    • A computer-readable medium comprises data structure for providing information about levels of similarity between pairs of N documents. The data structure comprises a plurality of entries of similarity values representing levels of similarity for a plurality of pairs of the documents. Each of the similarity values represents a level of similarity of one document of a given pair relative to the other document of the given pair. The similarity value of each entry is greater than a threshold similarity value that is greater than zero. The plurality of similarity-value entries are fewer than N2−N in number if the similarity values are asymmetric with regard to document pairing, and the plurality of similarity-value entries are fewer than N 2 - N 2 in number if the similarity values are symmetric with regard to document pairing. A method and apparatus for generating the data structure are described.
    • 计算机可读介质包括用于提供关于N个文档对之间的相似性级别的信息的数据结构。 数据结构包括表示多对文档对象的相似度级的多个相似度条目。 每个相似度值表示给定对的一个文档相对于给定对的另一个文档的相似度级别。 每个条目的相似度值大于大于零的阈值相似度值。 如果相似度值对于文档配对是不对称的,则多个相似值条目数量少于数目中的N2-N,并且多个相似度值条目少于 N 2 - 如果相似度值对于文档配对,则数字中的 2 。 描述了用于生成数据结构的方法和装置。
        • 3. 发明申请
        • Method and apparatus for constructing a compact similarity structure and for using the same in analyzing document relevance
        • 用于构建紧凑型相似度结构并用于分析文档相关性的方法和装置
        • US20080275870A1
        • 2008-11-06
        • US12152522
        • 2008-05-15
        • James G. ShanahanNorbert RomaDavid A. Evans
        • James G. ShanahanNorbert RomaDavid A. Evans
        • G06F17/30
        • G06F17/30705Y10S707/99935Y10S707/99942
        • A computer-readable medium comprises data structure for providing information about levels of similarity between pairs of N documents. The data structure comprises a plurality of entries of similarity values representing levels of similarity for a plurality of pairs of the documents. Each of the similarity values represents a level of similarity of one document of a given pair relative to the other document of the given pair. The similarity value of each entry is greater than a threshold similarity value that is greater than zero. The plurality of similarity-value entries are fewer than N2−N in number if the similarity values are asymmetric with regard to document pairing, and the plurality of similarity-value entries are fewer than N 2 - N 2 in number if the similarity values are symmetric with regard to document pairing. A method and apparatus for generating the data structure are described.
        • 计算机可读介质包括用于提供关于N个文档对之间的相似性级别的信息的数据结构。 数据结构包括表示多对文档对象的相似度级的多个相似度条目。 每个相似度值表示给定对的一个文档相对于给定对的另一个文档的相似度级别。 每个条目的相似度值大于大于零的阈值相似度值。 如果相似度值对于文档配对是不对称的,则多个相似值条目数量少于N≥2,并且多个相似值条目少于 N 2 如果相似性值是对称的,则数字中的 - N 2 文件配对。 描述了用于生成数据结构的方法和装置。
            • 6. 发明申请
            • Methods and apparatus for identifying workflow graphs using an iterative analysis of empirical data
            • 使用经验数据的迭代分析来识别工作流图的方法和装置
            • US20080065448A1
            • 2008-03-13
            • US11517244
            • 2006-09-08
            • David A. HullNorbert Roma
            • David A. HullNorbert Roma
            • G06F9/46
            • G06Q10/04G06Q10/06G06Q10/06316G06Q10/0633
            • A method and system for generating a workflow graph from empirical data of a process are described. A processing system obtains data corresponding to multiple instances of a process, the process including a set of tasks, the data including information about order of occurrences of the tasks. The processing system analyzes the occurrences of the tasks to identify order constraints. The processing system partitions nodes representing tasks into subsets based upon the order constraints, wherein the subsets are sequence ordered with respect to each other such that all nodes associated with a given subset either precede or follow all nodes associated with another subset. The processing system partitions nodes representing tasks into subgroups, wherein each subgroup includes one or more nodes that occur without order constraints relative to nodes associated with other subgroups. A workflow graph representative of the process is constructed wherein nodes are connected by edges.
            • 描述了从过程的经验数据生成工作流图的方法和系统。 处理系统获得与进程的多个实例相对应的数据,所述处理包括一组任务,所述数据包括关于任务发生顺序的信息。 处理系统分析任务的出现以识别订单约束。 处理系统基于订单约束将表示任务的节点分割成子集,其中子集相对于彼此被序列排序,使得与给定子集相关联的所有节点在与另一子集相关联的所有节点之前或之后。 处理系统将表示任务的节点划分为子组,其中每个子组包括相对于与其他子组相关联的节点没有订单约束而发生的一个或多个节点。 构建表示该过程的工作流图,其中节点通过边缘连接。
            • 7. 发明授权
            • Method and apparatus for comparing scores in a vector space retrieval process
            • 用于比较矢量空间检索过程中的分数的方法和装置
            • US07356604B1
            • 2008-04-08
            • US09551014
            • 2000-04-18
            • Norbert Roma
            • Norbert Roma
            • G06F15/16G06F17/30G06F7/00
            • G06F17/3069Y10S707/99933Y10S707/99936
            • The delivery ratio of r (which is a fraction between 0 and 1) partitions a stream of documents into a section of top scoring r-fraction of documents and the remainder. This way a set of successively bigger delivery ratios, r1, r2, r3, . . . sections the stream into tiers. Any given document is assigned to a tier according to how many delivery ratio thresholds it matched or surpassed and how many it failed to reach. This creates a scoring structure which reflects the specificity of the document with respect to a profile in terms of density of relevant documents in the stream. In other words, a document in the kth tier is such that it failed to be classified in the top rk ratio of the stream (thus rk fraction of the stream is more relevant to the given profile than the document under consideration). At the same time this document was classified as being in the top rk−1 part of the stream. Thus this mechanism defines a score (let's call it σ) for a document depending on how it compares to other documents in the stream when scored against a given profile.
            • r(其为0和1之间的分数)的传送比将文档流分割成文档的最高得分r分数部分,其余部分。 这样一组相继较大的传送比例r 1,r 2,r 3,..., 。 。 将流分成几层。 任何给定的文档根据其匹配或超过的传送率阈值多少以及无法达到的数量分配给一个层级。 这创建了一个评分结构,其反映了关于流中相关文档的密度的文档的特征。 换句话说,第k 层中的文档使得它不能被分类为流的最高比例(因此r 流的分数与正在考虑的文档相比,与给定的轮廓更相关)。 同时,该文档被分类为流的顶部r 1 部分。 因此,这种机制根据与对给定配置文件打分的流中的其他文档进行比较,定义文档的分数(让我们称之为西格玛)。
            • 8. 发明申请
            • Method and apparatus for constructing a compact similarity structure and for using the same in analyzing document relevance
            • 用于构建紧凑型相似度结构并用于分析文档相关性的方法和装置
            • US20070136336A1
            • 2007-06-14
            • US11298500
            • 2005-12-12
            • James ShanahanNorbert RomaDavid Evans
            • James ShanahanNorbert RomaDavid Evans
            • G06F7/00
            • G06F17/30705Y10S707/99935Y10S707/99942
            • A computer-readable medium comprises data structure for providing information about levels of similarity between pairs of N documents. The data structure comprises a plurality of entries of similarity values representing levels of similarity for a plurality of pairs of the documents. Each of the similarity values represents a level of similarity of one document of a given pair relative to the other document of the given pair. The similarity value of each entry is greater than a threshold similarity value that is greater than zero. The plurality of similarity-value entries are fewer than N2−N in number if the similarity values are asymmetric with regard to document pairing, and the plurality of similarity-value entries are fewer than N 2 - N 2 in number if the similarity values are symmetric with regard to document pairing. A method and apparatus for generating the data structure are described.
            • 计算机可读介质包括用于提供关于N个文档对之间的相似性级别的信息的数据结构。 数据结构包括表示多对文档对象的相似度级的多个相似度条目。 每个相似度值表示给定对的一个文档相对于给定对的另一个文档的相似度级别。 每个条目的相似度值大于大于零的阈值相似度值。 如果相似度值对于文档配对是不对称的,则多个相似值条目数量少于N≥2,并且多个相似值条目少于 N 2 如果相似性值是对称的,则数字中的 - N 2 文件配对。 描述了用于生成数据结构的方法和装置。