公开(公告)号：US06801945B2

公开(公告)日：2004-10-05

申请号：US09773471

申请日：2001-01-31

申请人： Long-Ji Lin ,  Dz-Mou Jung

发明人： Long-Ji Lin ,  Dz-Mou Jung

IPC分类号： G06F1516

CPC分类号： G06Q30/02 ,  G06Q10/04 ,  G06Q10/06315 ,  G06Q30/0202 ,  G06Q30/0207 ,  G06Q30/0256 ,  G06Q30/0277 ,  G06Q30/04

摘要： Systems and methods are provided for predicting visitor traffic to a network of web site pages. The systems and methods are used, as an example, to predict the inventory of total available online advertisements available within the network for a forthcoming period. The visitor traffic includes page viewing, listening or transacting on web pages within a web site, wherein the web pages are categorized by subject, interest areas or specific user queries such as word or phrase searches. For each page whose traffic is being predicted, the system takes into account annual seasonality, day-of-week, holidays, special events, short histories, user demographics, user web behavior (viewing, listening and transacting) and parent and child web page characteristics.

摘要翻译： 提供系统和方法来预测网站网页的访问者流量。 作为示例，使用系统和方法来预测在即将到来的时期内在网络中可用的总可用在线广告的库存。 访客流量包括在网站中的网页上的页面查看，收听或交易，其中网页由主题，兴趣区域或诸如单词或短语搜索的特定用户查询分类。 对于正在预测其流量的每个页面，系统考虑到年度季节性，星期几，假期，特殊事件，短历史，用户人口统计，用户网络行为（查看，收听和交易）以及父子网页 特点

公开(公告)号：US08108254B2

公开(公告)日：2012-01-31

申请号：US10879457

申请日：2004-06-29

申请人： Long-Ji Lin ,  Dz-Mou Jung ,  Olga L. Natkovich ,  Georgiy Goldenberg

发明人： Long-Ji Lin ,  Dz-Mou Jung ,  Olga L. Natkovich ,  Georgiy Goldenberg

IPC分类号： G06Q30/00

CPC分类号： G06Q30/00 ,  G06Q30/0242 ,  G06Q30/0245 ,  G06Q30/0246 ,  G06Q30/0254 ,  G06Q30/0272

摘要： A method attributes credit for conversions to a plurality of event types. A plurality of probabilities that a single impression of each of a plurality of respective event types causes a conversion by one of a plurality of users are defined. A processor is used to select values for the plurality of probabilities so as to minimize a total squared error based on differences between an observed outcome for each user and a respective expected outcome for each user calculated from the plurality of probabilities.

摘要翻译： 一种方法将转换归因于多种事件类型。 定义多个相应事件类型中的每一个的单次印象导致多个用户中的一个的转换的多个概率。 处理器用于选择多个概率的值，以便基于每个用户的观察结果与从多个概率计算的每个用户的相应预期结果之间的差异来最小化总平方误差。

公开(公告)号：US20100106605A1

公开(公告)日：2010-04-29

申请号：US12257309

申请日：2008-10-23

申请人： Long-Ji Lin ,  John Tomlin ,  Danny Zhang

发明人： Long-Ji Lin ,  John Tomlin ,  Danny Zhang

IPC分类号： G06Q30/00

CPC分类号： G06Q10/02 ,  G06Q10/08 ,  G06Q30/0277

摘要： A method of balancing advertisement inventory allocation includes constructing a flow network of nodes having impressions connected to contracts through corresponding arcs such as to satisfy demand requests of the contracts; normalizing an impression value of each node to a predetermined cost range; setting a cost of each arc to each corresponding normalized value; iteratively performing a plurality of times: (a) sampling the nodes or the arcs to create sample nodes and arcs, each time starting from a different random seed; (b) optimally allocating impressions from the sample nodes to the contracts with a minimum-cost network flow algorithm; (c) separately allocating impressions from sample arcs of lowest cost before allocating those from sample arcs of higher cost; averaging allocations from iterations (b) to create a first allocation; averaging allocations from iterations (c) to produce a second allocation; and computing a weighted solution of the first and second allocations.

摘要翻译： 平衡广告库存分配的方法包括构建具有通过相应弧形连接到合同的印象的节点的流网络，以满足合同的需求请求; 将每个节点的印象值归一化到预定的成本范围; 将每个弧的成本设置为每个相应的归一化值; 迭代执行多次：（a）每次从不同的随机种子开始，对节点或弧进行采样以创建采样节点和弧; （b）用最小成本网络流算法将样本节点的展示最佳分配到合同; （c）在从较高成本的样本弧分配之前，分别从最低成本的样本弧分配展示次数; 从迭代（b）中平均分配以创建第一分配; 从迭代（c）中平均分配以产生第二分配; 以及计算所述第一和第二分配的加权解。

公开(公告)号：US20100100414A1

公开(公告)日：2010-04-22

申请号：US12253326

申请日：2008-10-17

申请人： Long-Ji Lin ,  John Tomlin ,  Danny Zhang ,  Peiji Chen

发明人： Long-Ji Lin ,  John Tomlin ,  Danny Zhang ,  Peiji Chen

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

CPC分类号： H04L41/0826 ,  G06Q30/02 ,  G06Q30/0244 ,  G06Q30/0251

摘要： A system for advertisement inventory allocation is disclosed, including a database to store advertisement impressions. An indexer builds a plurality of index tables each associated with an attribute that is mapped to a plurality of the impressions. An impression matcher constructs a flow network including a plurality of nodes each containing impressions of at least one corresponding attribute projected to be available during a time period, a plurality of contracts each including specific requests for impressions that satisfy a demand profile during the time period, and a plurality of arcs to connect the plurality of nodes to the plurality of contracts that match the demand profile of each contract. An optimizer optimally allocates impressions from the nodes to the contracts during the time period by solving the flow network with a minimum-cost network flow algorithm that maximizes delivery of the impressions to the contracts in a way that satisfies the corresponding demand profiles and that specifies a number of impressions to flow over each of the plurality of arcs.

摘要翻译： 公开了一种用于广告库存分配的系统，包括用于存储广告印象的数据库。 索引器构建多个索引表，每个索引表与映射到多个印象的属性相关联。 印象匹配器构建包括多个节点的流网络，每个节点包含预计在一段时间段内可用的至少一个对应属性的展示，每个包括在该时间段期间满足需求简档的印象的特定请求的多个合同， 以及多个弧，以将多个节点连接到与每个合同的需求曲线相匹配的多个合同。 优化器通过以最小成本网络流算法求解流网络来最佳地将节点间的展示分配到合同中，该算法最大限度地以满足相应需求简档的方式向合同交付展示，并指定 在多个弧中的每一个上流动的展示次数。

公开(公告)号：US20070260596A1

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

申请号：US11394343

申请日：2006-03-29

申请人： Joshua Koran ,  Christina Chung ,  Abhinav Gupta ,  George John ,  Hongfeng Yin ,  Long-Ji Lin ,  Richard Frankel

发明人： Joshua Koran ,  Christina Chung ,  Abhinav Gupta ,  George John ,  Hongfeng Yin ,  Long-Ji Lin ,  Richard Frankel

IPC分类号： G06F17/30

CPC分类号： G06Q30/0255 ,  G06F17/3053 ,  G06F17/30702 ,  G06F17/30761 ,  G06F17/30914 ,  G06N5/02 ,  G06Q10/067 ,  G06Q30/02

摘要： A behavioral targeting system determines user profiles from online activity. The system includes a plurality of models that define parameters for determining a user profile score. Event information, which comprises on-line activity of the user, is received at an entity. To generate a user profile score, a model is selected. The model comprises recency, intensity and frequency dimension parameters. The behavioral targeting system generates a user profile score for a target objective, such as brand advertising or direct response advertising. The parameters from the model are applied to generate the user profile score in a category. The behavioral targeting system has application for use in ad serving to on-line users.

摘要翻译： 行为定位系统从在线活动确定用户个人资料。 该系统包括多个模型，其定义用于确定用户简档分数的参数。 事件信息，包括用户的在线活动，在一个实体被接收。 要生成用户配置文件分数，选择一个模型。 该模型包括新近度，强度和频率尺寸参数。 行为定位系统为目标目标生成用户简档分数，例如品牌广告或直接响应广告。 应用来自模型的参数以在类别中生成用户简档分数。 行为定位系统具有在在线用户的广告投放中使用的应用。

公开(公告)号：US20070239534A1

公开(公告)日：2007-10-11

申请号：US11394248

申请日：2006-03-29

申请人： Hongche Liu ,  Long-Ji Lin

发明人： Hongche Liu ,  Long-Ji Lin

IPC分类号： G06Q30/00

CPC分类号： G06Q30/02 ,  G06Q30/0247 ,  G06Q30/0269

摘要： A method and apparatus for selecting additional content to display to a user when the user requests base content is provided. A user profile of the user having user interest scores of categories or keywords is received, each user interest score reflecting the degree of interest the user has in the category or keyword. Performance scores reflecting the probability that a user having particular user interest scores will select additional content associated with particular categories or keywords is also received. In addition, revenue amounts associated with each category or keyword of the user profile is received. The user interest scores, performance scores, and revenue amounts are used to produce an expected revenue amount for each category or keyword in the user profile. Additional content to be sent to the user is then selected using the determined expected revenue amounts.

摘要翻译： 提供了一种用于当用户请求基础内容时选择附加内容以显示给用户的方法和装置。 接收具有类别或关键字的用户兴趣分数的用户的用户简档，每个用户兴趣分数反映用户在类别或关键字中具有的兴趣程度。 还收到反映具有特定用户兴趣分数的用户将选择与特定类别或关键词相关联的附加内容的概率的性能分数。 此外，接收与用户简档的每个类别或关键字相关联的收入金额。 用户兴趣分数，绩效分数和收入金额用于在用户配置文件中为每个类别或关键字产生预期收入金额。 然后使用确定的预期收入金额选择要发送给用户的其他内容。

公开(公告)号：US20050071218A1

公开(公告)日：2005-03-31

申请号：US10879457

申请日：2004-06-29

申请人： Long-Ji Lin ,  Dz-Mou Jung ,  Olga Natkovich ,  Georgiy Goldenberg

发明人： Long-Ji Lin ,  Dz-Mou Jung ,  Olga Natkovich ,  Georgiy Goldenberg

IPC分类号： G06F20060101 ,  G06F17/60

CPC分类号： G06Q30/00 ,  G06Q30/0242 ,  G06Q30/0245 ,  G06Q30/0246 ,  G06Q30/0254 ,  G06Q30/0272

摘要： A method attributes credit for conversions to a plurality of event types. A plurality of probabilities that a single impression of each of a plurality of respective event types causes a conversion by one of a plurality of users are defined. A processor is used to select values for the plurality of probabilities so as to minimize a total squared error based on differences between an observed outcome for each user and a respective expected outcome for each user calculated from the plurality of probabilities.

摘要翻译： 一种方法将转换归因于多种事件类型。 定义多个相应事件类型中的每一个的单次印象导致多个用户中的一个的转换的多个概率。 处理器用于选择多个概率的值，以便基于每个用户的观察结果与从多个概率计算的每个用户的相应预期结果之间的差异来最小化总平方误差。

公开(公告)号：US20100114647A1

公开(公告)日：2010-05-06

申请号：US12262080

申请日：2008-10-30

申请人： Victor K. Chu ,  Long-Ji Lin

发明人： Victor K. Chu ,  Long-Ji Lin

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

CPC分类号： G06Q30/02 ,  G06Q10/04 ,  G06Q30/0202

摘要： An improved system and method for granular inventory forecasting of online advertisement impressions is provided. An impression forecast data integrator may be provided that generates forecasted impression pools of advertisements by integrating impression pools of advertisements that share the same attributes and trend forecast data for web pages and advertisement placements on the web pages. Using the trend forecast data, an inventory forecast for a category may be calculated and an inventory forecast for an impression pool may be calculated. A daily forecasted inventory may then be produced for each impression pool by minimizing an objective function of squared errors of the difference between the daily forecasted inventory for each category and the sum of the daily forecasted inventory for each impression pool. The daily inventory forecast for each pool may be output.

摘要翻译： 提供了一种用于在线广告印象的粒度库存预测的改进的系统和方法。 可以提供展示预测数据集成器，其通过将网页上的网页和广告展示位置共享相同属性的广告的趋势预测数据和趋势预测数据进行集成来生成预测的广告的展示池。 使用趋势预测数据，可以计算类别的库存预测，并可以计算展示池的库存预测。 然后可以通过最小化每个类别的每日预测库存与每个展示池的每日预测库存总和之间的差异的平方误差的目标函数，为每个展示池生成每日预测库存。 可以输出每个池的每日库存预测。

公开(公告)号：US20100106556A1

公开(公告)日：2010-04-29

申请号：US12257241

申请日：2008-10-23

申请人： Erik N. Vee ,  Long-Ji Lin ,  Danny Zhang

发明人： Erik N. Vee ,  Long-Ji Lin ,  Danny Zhang

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

CPC分类号： G06Q30/02 ,  G06Q10/04 ,  G06Q10/06312

摘要： A method for scaling advertisement inventory allocation includes constructing a flow network of nodes having impressions connected to contracts through corresponding arcs such as to satisfy demand requests of the contracts; (a) for each of the contracts: determining a probability distribution over the nodes eligible to supply forecasted impressions to the contract; drawing a plurality of sample nodes from the probability distribution to form a multiset, O, of nodes; (b) for each of the nodes within O: determining a subset of the contracts, H, that can be satisfied by receiving forecasted impressions from the node; weighting a number of forecasted impressions of the node, as a function of the subset of contracts in H, with the probability distribution of the node; and optimally allocating forecasted impressions from each multiset, O, of sample nodes to each corresponding contract during the time period by solving the flow network with a minimum-cost network flow algorithm.

摘要翻译： 用于缩放广告库存分配的方法包括：通过相应的弧来构建具有与合同相关联的印象的节点的流网络，以满足合同的需求请求; （a）对于每个合同：确定有资格向合同提供预测印象的节点上的概率分布; 从概率分布绘制多个样本节点以形成节点的多集合O; （b）对于O中的每个节点：确定通过从节点接收预测的印象可以满足的合同的子集H; 将节点的预测展示次数作为H中的合同子集的函数与节点的概率分布进行加权; 并且通过使用最小成本网络流算法解决流网络，在时间段内将样本节点的每个多集群O的预测印象最佳地分配给每个对应的合同。

公开(公告)号：US20100100407A1

公开(公告)日：2010-04-22

申请号：US12253377

申请日：2008-10-17

申请人： Long-Ji Lin ,  Danny Zhang

发明人： Long-Ji Lin ,  Danny Zhang

IPC分类号： G06Q10/00

CPC分类号： G06Q10/04 ,  G06Q30/02 ,  G06Q30/0244

摘要： A method for scaling inventory allocation includes mapping attributes to impressions through index tables; constructing a flow network of nodes each containing impressions of corresponding attributes projected to be available during a time period, contracts each including specific requests for impressions that satisfy a demand profile, and arcs to connect the nodes to the contracts that match the demand profiles of the contracts; sampling the arcs that flow into each contract at a sampling rate chosen to reduce the number of arcs to a fraction of the original arcs when the plurality of impressions that satisfy the contract is above a threshold number, the nodes corresponding to the sampled arcs being sampled nodes; and optimally allocating impressions from the sampled nodes to the contracts during the time period by solving the flow network with a minimum-cost network flow algorithm that maximizes delivery of the impressions from the sampled nodes to the contracts in a way that satisfies the corresponding demand profiles.

摘要翻译： 缩放库存分配的方法包括通过索引表将属性映射到展示; 构建每个节点的流网络，每个节点包含在一段时间段内预期可用的相应属性的展示，每个包含满足需求简档的印象的特定请求的合同以及将节点连接到符合需求简档的合同的弧 合约; 以满足该合同的多个印象高于阈值数目的选择以将弧数减少到原始弧的一部分的采样速率对流入每个合同的弧进行采样，对应于采样的弧的节点被采样 节点; 并且通过以满足相应需求简档的方式最大化从采样节点到合同的展开最大化的最小成本网络流算法来解决流网络，从而在时间段内将采样节点的展示次数最佳地分配给契约 。