会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明申请
    • TIME-WEIGHTED AND SCALING OPTIMIZATION OF ALLOCATION OF ONLINE ADVERTISEMENT INVENTORY
    • 时间加权和缩放优化在线广告库存分配
    • US20100106556A1
    • 2010-04-29
    • US12257241
    • 2008-10-23
    • Erik N. VeeLong-Ji LinDanny Zhang
    • Erik N. VeeLong-Ji LinDanny Zhang
    • G06Q30/00G06Q10/00
    • G06Q30/02G06Q10/04G06Q10/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的预测印象最佳地分配给每个对应的合同。