|
通过媒体调度问题优化网络流量
Optimizing Web Traffic via the Media Scheduling Problem |
|
| |
| 课程网址: |
http://videolectures.net/kdd09_backstrom_owtvmsp/
|
| 主讲教师: |
Lars Backstrom
|
| 开课单位: |
脸书公司
|
| 开课时间: |
信息不详。欢迎您在右侧留言补充。
|
| 课程语种: |
英语
|
| 中文简介: |
网站流量以一致和可预测的方式随时间变化, 在中午的流量最高。在向访问者提供媒体内容时, 向重复访问者提供新内容非常重要, 这样他们就会不断地回来。本文提出了一种算法, 以平衡网站与新内容的新鲜需求与在交通高峰期向大多数访客展示最佳内容的愿望。我们将此表述为媒体调度问题, 考虑到整体流量模式和可用媒体内容的时变点击率, 我们试图最大限度地提高总点击次数。我们提出了一种在一定条件下执行此调度的有效算法, 并将该算法应用于从服务器日志中获得的真实数据, 从而显示出我们的算法调度在流量方面有显著改善的证据。最后, 我们分析了点击数据, 提出了为什么以及如何随着新内容的点击率而下降的模型。
|
| 课程简介: |
Website traffic varies through time in consistent and predictable ways, with highest traffic in the middle of the day. When providing media content to visitors, it is important to present repeat visitors with new content so that they keep coming back. In this paper we present an algorithm to balance the need to keep a website fresh with new content with the desire to present the best content to the most visitors at times of peak traffic. We formulate this as the media scheduling problem, where we attempt to maximize total clicks, given the overall traffic pattern and the time varying clickthrough rates of available media content. We present an efficient algorithm to perform this scheduling under certain conditions and apply this algorithm to real data obtained from server logs, showing evidence of significant improvements in traffic from our algorithmic schedules. Finally, we analyze the click data, presenting models for why and how the clickthrough rate for new content declines as it ages.
|
| 关 键 词: |
网站流量; 媒体调度; 算法; 网络挖掘
|
| 课程来源: |
视频讲座网
|
| 最后编审: |
2020-06-20：zyk
|
| 阅读次数: |
58
|
|
图 书 馆