利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

26 条记录 (耗时 0.022 秒)

    Method and apparatus for generating weighted association rules
    1.
    发明授权
    Method and apparatus for generating weighted association rules 失效
    用于生成加权关联规则的方法和装置

    公开(公告)号：US06173280B2

    公开(公告)日：2001-01-09

    申请号：US09065837

    申请日：1998-04-24

    申请人： G D Ramkumar ,  Sanjay Ranka ,  Shalom Tsur

    发明人： G D Ramkumar ,  Sanjay Ranka ,  Shalom Tsur

    IPC分类号： G06F1730

    CPC分类号： G06F17/30539 ,  G06F2216/03 ,  Y10S707/99936 ,  Y10S707/99943

    摘要： The present invention discloses a data mining method and apparatus that assigns weight values to items and/or transactions based on the value to the user, thereby resulting in association rules of greater importance. A conservative method, aggressive method, or a combination of the two can be used when generating supersets.

    摘要翻译： 本发明公开了一种数据挖掘方法和装置，该方法和装置根据该用户的价值向物品和/或交易分配权重值，从而产生更重要的关联规则。 当产生超集时，可以使用保守的方法，积极的方法或两者的组合。

    Method and apparatus for classification of high dimensional data
    2.
    发明授权
    Method and apparatus for classification of high dimensional data 失效
    高维数据分类方法和装置

    公开(公告)号：US06563952B1

    公开(公告)日：2003-05-13

    申请号：US09420252

    申请日：1999-10-18

    申请人： Anurag Srivastava ,  G. D. Ramkumar ,  Vineet Singh ,  Sanjay Ranka

    发明人： Anurag Srivastava ,  G. D. Ramkumar ,  Vineet Singh ,  Sanjay Ranka

    IPC分类号： G06K962

    CPC分类号： G06K9/6276

    摘要： The present invention is an apparatus and method for classifying high-dimensional sparse datasets. A raw data training set is flattened by converting it from categorical representation to a boolean representation. The flattened data is then used to build a class model on which new data not in the training set may be classified. In one embodiment, the class model takes the form of a decision tree, and large itemsets and cluster information are used as attributes for classification. In another embodiment, the class model is based on the nearest neighbors of the data to be classified. An advantage of the invention is that, by flattening the data, classification accuracy is increased by eliminating artificial ordering induced on the attributes. Another advantage is that the use of large itemsets and clustering increases classification accuracy.

    摘要翻译： 本发明是用于对高维稀疏数据集进行分类的装置和方法。 原始数据训练集通过将其从分类表示转换为布尔表示而被平坦化。 然后，使用平坦化的数据来构建一个类别模型，在该类模型中，不在训练集中的新数据可以被分类。 在一个实施例中，类模型采用决策树的形式，并且使用大的项目集和集群信息作为分类的属性。 在另一个实施例中，类模型基于要分类的数据的最近邻。 本发明的优点在于，通过平坦化数据，通过消除对属性引起的人为排序来增加分类精度。 另一个优点是使用大项集和聚类提高了分类精度。

    Method, algorithm, and computer program for optimizing the performance of messages including advertisements in an interactive measurable medium
    4.
    发明授权
    Method, algorithm, and computer program for optimizing the performance of messages including advertisements in an interactive measurable medium 有权
    方法，算法和计算机程序，用于优化包括交互式可测量介质中的广告的消息的性能

    公开(公告)号：US08086485B1

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

    申请号：US12541528

    申请日：2009-08-14

    申请人： Sanjay Ranka ,  Jason S. Lenderman ,  James R. Weisinger

    发明人： Sanjay Ranka ,  Jason S. Lenderman ,  James R. Weisinger

    IPC分类号： G06F17/30

    CPC分类号： G06Q30/02 ,  G06Q10/06315 ,  G06Q10/0639 ,  G06Q30/0201 ,  G06Q30/0204 ,  G06Q30/0205 ,  G06Q30/0241 ,  G06Q30/0242 ,  G06Q30/0244 ,  G06Q30/0256 ,  G06Q30/0277 ,  G06Q30/0631 ,  G06Q30/0633

    摘要： Method, procedure, algorithm, system, and computer program for improving and attempting to optimize the performance of messaging campaigns, particularly to marketing campaigns in which advertisements or other messages are distributed over an interactive measurable medium such as the Internet. A goal is to allocate the message alternatives to the customer population to optimize business objectives. The includes reading prior stage message state data pertaining to a prior stage including a cumulative number of trials and a cumulative number of successes for a particular message. Message performance results representing message trials and message successes from the previous stage based on the prior-stage state are then read, and a current message state is computed. A current message allocation is generated based on the current message state. Desirably the cumulative number of trials and the cumulative number of successes are discounted based on the age of the information. This inventive procedure may be applied to various message types including, for example, web site banner advertisements, electronic advertisements generally, email messages and promotions, and the like. In one embodiment, the messages are internet web site banner ads, trials are impressions of the ads presented to the user, and successes are measured by clickthroughs from the banner ad to the web site associated with the banner ad. Computer system, computer program, and computer program product associated with the inventive method and procedures are also provided.

    摘要翻译： 方法，程序，算法，系统和计算机程序，用于改进和尝试优化消息传播活动的性能，特别是在诸如因特网的交互式可测量介质上分发广告或其他消息的营销活动。 目标是为客户群体分配消息替代品，以优化业务目标。 这包括读取与前一阶段相关的前级消息状态数据，其包括累积的试验次数和针对特定消息的累积成功次数。 然后读取表示基于前一级状态的前一级的消息试验和消息成功的消息性能结果，并且计算当前消息状态。 基于当前消息状态生成当前消息分配。 理想的是，根据信息的年龄，累积的试验次数和累积的成功次数将被打折扣。 本发明的过程可以应用于各种消息类型，包括例如网站横幅广告，通常的电子广告，电子邮件消息和促销等。 在一个实施例中，消息是互联网网站横幅广告，试验是向用户呈现的广告的印象，成功通过从横幅广告到与横幅广告相关联的网站的点击来衡量。 还提供了与本发明的方法和程序相关联的计算机系统，计算机程序和计算机程序产品。

    Variable feathering field splitting for intensity modulated fields of large size
    5.
    发明授权
    Variable feathering field splitting for intensity modulated fields of large size 有权
    用于大尺寸强度调制场的可变羽化场分割

    公开(公告)号：US07573978B2

    公开(公告)日：2009-08-11

    申请号：US11995303

    申请日：2006-07-11

    申请人： Srijit Kamath ,  Sartaj Kumar Sahni ,  Jonathan Li ,  Jatinder Palta ,  Sanjay Ranka

    发明人： Srijit Kamath ,  Sartaj Kumar Sahni ,  Jonathan Li ,  Jatinder Palta ,  Sanjay Ranka

    IPC分类号： A61N5/10

    CPC分类号： A61N5/1042 ,  A61N5/1036 ,  G21K1/04

    摘要： A method and associated system 300 for delivering intensity-modulated radiation therapy (IMRT) uses variable feathering field splitting for intensity modulated fields of large size. A processor controls a beam-shaping device that splits the radiation beam into a plurality of radiation fields delivered to a patient. The processor in cooperation with the beam-shaping device implements a variable feathering method which includes providing an intensity matrix for the treatment of a patient, the intensity matrix having a plurality of rows and columns for spanning a prescribed radiation field including a prescribed field width. The prescribed width is compared to a maximum field width provided by the radiation treatment system. The intensity matrix is split into a plurality of spatially overlapping intensity submatrices by variably feathering the intensity matrix when the prescribed width exceeds the maximum field width, Radiotherapy is then provided to the patient using a leaf sequencing method to generate the submatrices.

    摘要翻译： 用于递送强度调制辐射治疗（IMRT）的方法和相关系统300使用大尺寸强度调制场的可变羽化场分割。 处理器控制将辐射束分成传递给患者的多个辐射场的光束整形装置。 与光束成形装置协作的处理器实现了一种可变羽化方法，其包括提供用于治疗患者的强度矩阵，所述强度矩阵具有多个行和列，用于跨越包括规定场宽的规定辐射场。 将规定的宽度与辐射处理系统提供的最大场宽进行比较。 当规定的宽度超过最大场宽度时，强度矩阵通过可变地羽化强度矩阵而被分割成多个空间上重叠的强度子矩阵，然后使用叶子排序方法向患者提供放射疗法以产生子矩阵。

    Method, algorithm, and computer program for optimizing the performance of messages including advertisements in an interactive measurable medium
    7.
    发明申请
    Method, algorithm, and computer program for optimizing the performance of messages including advertisements in an interactive measurable medium 有权
    方法，算法和计算机程序，用于优化包括交互式可测量介质中的广告的消息的性能

    公开(公告)号：US20070050204A1

    公开(公告)日：2007-03-01

    申请号：US11589408

    申请日：2006-10-30

    申请人： Sanjay Ranka ,  Jason Lenderman ,  James Weisinger

    发明人： Sanjay Ranka ,  Jason Lenderman ,  James Weisinger

    IPC分类号： G06Q99/00

    CPC分类号： G06Q30/02 ,  G06Q10/06315 ,  G06Q10/0639 ,  G06Q30/0201 ,  G06Q30/0204 ,  G06Q30/0205 ,  G06Q30/0241 ,  G06Q30/0242 ,  G06Q30/0244 ,  G06Q30/0256 ,  G06Q30/0277 ,  G06Q30/0631 ,  G06Q30/0633

    摘要： Method, procedure, algorithm, system, and computer program for improving and attempting to optimize the performance of messaging campaigns, particularly to marketing campaigns in which advertisements or other messages are distributed over an interactive measurable medium such as the Internet. A goal is to allocate the message alternatives to the customer population to optimize business objectives. The includes reading prior stage message state data pertaining to a prior stage including a cumulative number of trials and a cumulative number of successes for a particular message. Message performance results representing message trials and message successes from the previous stage based on the prior-stage state are then read, and a current message state is computed. A current message allocation is generated based on the current message state. Desirably the cumulative number of trials and the cumulative number of successes are discounted based on the age of the information. This inventive procedure may be applied to various message types including, for example, web site banner advertisements, electronic advertisements generally, email messages and promotions, and the like. In one embodiment, the messages are internet web site banner ads, trials are impressions of the ads presented to the user, and successes are measured by clickthroughs from the banner ad to the web site associated with the banner ad. Computer system, computer program, and computer program product associated with the inventive method and procedures are also provided by the invention.

    摘要翻译： 方法，程序，算法，系统和计算机程序，用于改进和尝试优化消息传播活动的性能，特别是在诸如因特网的交互式可测量介质上分发广告或其他消息的营销活动。 目标是为客户群体分配消息替代品，以优化业务目标。 这包括读取与前一阶段相关的前级消息状态数据，其包括累积的试验次数和针对特定消息的累积成功次数。 然后读取表示基于前一级状态的前一级的消息试验和消息成功的消息性能结果，并且计算当前消息状态。 基于当前消息状态生成当前消息分配。 理想的是，根据信息的年龄，累积的试验次数和累积的成功次数将被打折扣。 本发明的过程可以应用于各种消息类型，包括例如网站横幅广告，通常的电子广告，电子邮件消息和促销等。 在一个实施例中，消息是互联网网站横幅广告，试验是向用户呈现的广告的印象，成功通过从横幅广告到与横幅广告相关联的网站的点击来衡量。 本发明还提供了与本发明方法和程序相关联的计算机系统，计算机程序和计算机程序产品。

    System and Method for Improving the Performance of Electronic Media Advertising Campaigns Through Multi-Attribute Analysis and Optimization
    8.
    发明申请
    System and Method for Improving the Performance of Electronic Media Advertising Campaigns Through Multi-Attribute Analysis and Optimization 审中-公开
    通过多属性分析和优化提高电子媒体广告业务绩效的系统和方法

    公开(公告)号：US20110238487A1

    公开(公告)日：2011-09-29

    申请号：US13099608

    申请日：2011-05-03

    申请人： E. Diane Chang ,  Richard E. Chatwin ,  Sachin Kumar ,  Sanjay Ranka ,  James R. Weisinger ,  Jason Lenderman

    发明人： E. Diane Chang ,  Richard E. Chatwin ,  Sachin Kumar ,  Sanjay Ranka ,  James R. Weisinger ,  Jason Lenderman

    IPC分类号： G06Q30/00

    CPC分类号： G06Q10/06375 ,  G06Q10/06393 ,  G06Q30/02 ,  G06Q30/0203 ,  G06Q30/0204 ,  G06Q30/0207 ,  G06Q30/0241 ,  G06Q30/0242 ,  G06Q30/0243 ,  G06Q30/0244 ,  G06Q30/0277

    摘要： Automated system, methods, algorithms, procedures, and computer software programs and computer program products for improving and optimizing the performance of messaging campaigns, particularly for marketing campaigns in which advertisements or other messages are distributed over an interactive measurable medium such as the Internet. Analysis and Optimization method and procedure, an automated system, and system and method that exploit the underlying multi-attribute structure, as well as other features and advantages. Optimization procedures allocate the ad alternatives or other message to the customer population to optimize business objectives such as maximizing the number of positive responses received. Procedure for generating message allocations that improve and attempt to optimize the campaign performance. Methods ensure that campaign constraints are not violated. Methods can be implemented on a computer that is programmed to retrieve message performance information and to generate recommended message allocations for each stage in a multi-stage messaging campaign to achieve messaging goals.

    摘要翻译： 自动化系统，方法，算法，程序，计算机软件程序和计算机程序产品，用于改善和优化消息传播活动的性能，特别是对于通过互动可测量介质（如互联网）分发广告或其他消息的营销活动。 分析和优化方法和过程，自动化系统，以及利用底层多属性结构以及其他特征和优点的系统和方法。 优化程序将广告替代品或其他消息分配给客户群体，以优化业务目标，例如最大限度地获得收到的积极响应数量。 生成消息分配的过程，用于改进和尝试优化广告系列的效果。 方法确保不违反活动约束。 方法可以在被编程为检索消息性能信息的计算机上实现，并且为了实现消息传送目标而在多阶段消息传送活动中为每个阶段生成推荐的消息分配。

    Method, algorithm, and computer program for optimizing the performance of messages including advertisements in an interactive measurable medium
    9.
    发明申请
    Method, algorithm, and computer program for optimizing the performance of messages including advertisements in an interactive measurable medium 有权
    方法，算法和计算机程序，用于优化包括交互式可测量介质中的广告的消息的性能

    公开(公告)号：US20080306810A1

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

    申请号：US12193163

    申请日：2008-08-18

    申请人： Sanjay Ranka ,  Jason S. Lenderman ,  James Weisinger

    发明人： Sanjay Ranka ,  Jason S. Lenderman ,  James Weisinger

    IPC分类号： G06Q30/00 ,  G06Q10/00

    CPC分类号： G06Q30/02 ,  G06Q10/06315 ,  G06Q10/0639 ,  G06Q30/0201 ,  G06Q30/0204 ,  G06Q30/0205 ,  G06Q30/0241 ,  G06Q30/0242 ,  G06Q30/0244 ,  G06Q30/0256 ,  G06Q30/0277 ,  G06Q30/0631 ,  G06Q30/0633

    摘要： Method, procedure, algorithm, system, and computer program for improving and attempting to optimize the performance of messaging campaigns, particularly to marketing campaigns in which advertisements or other messages are distributed over an interactive measurable medium such as the Internet. A goal is to allocate the message alternatives to the customer population to optimize business objectives. The includes reading prior stage message state data pertaining to a prior stage including a cumulative number of trials and a cumulative number of successes for a particular message. Message performance results representing message trials and message successes from the previous stage based on the prior-stage state are then read, and a current message state is computed. A current message allocation is generated based on the current message state. Desirably the cumulative number of trials and the cumulative number of successes are discounted based on the age of the information. This inventive procedure may be applied to various message types including, for example, web site banner advertisements, electronic advertisements generally, email messages and promotions, and the like. In one embodiment, the messages are internet web site banner ads, trials are impressions of the ads presented to the user, and successes are measured by clickthroughs from the banner ad to the web site associated with the banner ad. Computer system, computer program, and computer program product associated with the inventive method and procedures are also provided.

    摘要翻译： 方法，程序，算法，系统和计算机程序，用于改进和尝试优化消息传播活动的性能，特别是在诸如因特网的交互式可测量介质上分发广告或其他消息的营销活动。 目标是为客户群体分配消息替代品，以优化业务目标。 这包括读取与前一阶段相关的前级消息状态数据，其包括累积的试验次数和针对特定消息的累积成功次数。 然后读取表示基于前一级状态的前一级的消息试验和消息成功的消息性能结果，并且计算当前消息状态。 基于当前消息状态生成当前消息分配。 理想的是，根据信息的年龄，累积的试验次数和累积的成功次数将被打折扣。 本发明的过程可以应用于各种消息类型，包括例如网站横幅广告，通常的电子广告，电子邮件消息和促销等。 在一个实施例中，消息是互联网网站横幅广告，试验是向用户呈现的广告的印象，成功通过从横幅广告到与横幅广告相关联的网站的点击来衡量。 还提供了与本发明的方法和程序相关联的计算机系统，计算机程序和计算机程序产品。

    Leaf sequencing method and system
    10.
    发明申请
    Leaf sequencing method and system 失效
    叶片测序方法和系统

    公开(公告)号：US20050148841A1

    公开(公告)日：2005-07-07

    申请号：US10736023

    申请日：2003-12-15

    申请人： Srijit Kamath ,  Sartaj Sahni ,  Jatinder Palta ,  Sanjay Ranka ,  Jonathan Li

    发明人： Srijit Kamath ,  Sartaj Sahni ,  Jatinder Palta ,  Sanjay Ranka ,  Jonathan Li

    IPC分类号： A61B5/05 ,  A61N5/10

    CPC分类号： A61N5/103 ,  A61N5/1036 ,  A61N5/1042

    摘要： A method of delivering radiation treatment using multi-leaf collimation includes the step of providing a radiation fluence map which includes an intensity profile. The fluence map is converted into a preliminary leaf sequence, wherein the preliminary leaf sequence minimizes machine on-time and is generated without leaf movement constraints. The leaf movement constraint is imposed on the preliminary leaf sequence. At least one constraint elimination algorithm is then applied, the algorithm adjusting the preliminary leaf sequence to minimize violations of the constraint while providing the desired fluence map and minimized radiation on-time. The method can be applied to SMLC and DLMC systems, and can include adjustment for the tongue-and-groove effect.

    摘要翻译： 使用多叶准直进行放射治疗的方法包括提供包括强度分布的辐射注量图的步骤。 注量图被转换成初步的叶子序列，其中初步叶子序列使机器准时最小化，并且不产生叶片运动限制。 叶片运动约束对初步叶序列施加。 然后应用至少一个约束消除算法，该算法调整初步叶序列以最小化对约束的违反，同时提供期望的通量图和最小化的辐射on-time。 该方法可以应用于SMLC和DLMC系统，并且可以包括对榫槽效应的调整。