Understanding Crowds' Migration on the Web

Yong Wang, Komal Pal, A. Kuzmanovic
{"title":"Understanding Crowds' Migration on the Web","authors":"Yong Wang, Komal Pal, A. Kuzmanovic","doi":"10.1109/WI-IAT.2011.40","DOIUrl":null,"url":null,"abstract":"Consider a network where nodes are websites and the weight of a link that connects two nodes corresponds to the average number of users that visits both of the two websites over longer timescales. Such user-driven Web network is not only invaluable for understanding how crowds' interests collectively spread on the Web, but also useful for applications such as advertising or search. In this paper, we manage to construct such a network by 'putting together' pieces of information publicly available from the popular analytics websites. Our contributions are threefold. First, we design a crawler and a normalization methodology that enable us to construct a user-driven Web network based on limited publicly-available information, and validate the high accuracy of our approach. Second, we evaluate the unique properties of our network, and demonstrate that it exhibits small-world, seed-free, and scale-free phenomena. Finally, we build an application, website selector, on top of the user-driven network. The core concept utilized in the website selector is that by exploiting the knowledge that a number of websites share a number of common users, an advertiser might prefer displaying his ads only on a subset of these websites to optimize the budget allocation, and in turn increase the visibility of his ads on other websites. Our websites elector system is tailored for ad commissioners and it could be easily embedded in their ad selection algorithms.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WI-IAT.2011.40","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Consider a network where nodes are websites and the weight of a link that connects two nodes corresponds to the average number of users that visits both of the two websites over longer timescales. Such user-driven Web network is not only invaluable for understanding how crowds' interests collectively spread on the Web, but also useful for applications such as advertising or search. In this paper, we manage to construct such a network by 'putting together' pieces of information publicly available from the popular analytics websites. Our contributions are threefold. First, we design a crawler and a normalization methodology that enable us to construct a user-driven Web network based on limited publicly-available information, and validate the high accuracy of our approach. Second, we evaluate the unique properties of our network, and demonstrate that it exhibits small-world, seed-free, and scale-free phenomena. Finally, we build an application, website selector, on top of the user-driven network. The core concept utilized in the website selector is that by exploiting the knowledge that a number of websites share a number of common users, an advertiser might prefer displaying his ads only on a subset of these websites to optimize the budget allocation, and in turn increase the visibility of his ads on other websites. Our websites elector system is tailored for ad commissioners and it could be easily embedded in their ad selection algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
了解人群在网络上的迁移
考虑一个网络,其中节点是网站,连接两个节点的链接的权重对应于在较长时间尺度上访问这两个网站的平均用户数量。这种用户驱动的网络不仅对于理解人群的兴趣如何在网络上集体传播是无价的,而且对于广告或搜索等应用程序也很有用。在本文中,我们通过将流行的分析网站上公开的信息片段“放在一起”来构建这样一个网络。我们的贡献是三重的。首先,我们设计了一个爬虫和一种规范化方法,使我们能够基于有限的公开信息构建用户驱动的Web网络,并验证了我们方法的高准确性。其次,我们评估了我们的网络的独特性质,并证明了它表现出小世界、无种子和无标度现象。最后,我们在用户驱动网络的基础上构建了一个应用程序——网站选择器。网站选择器中使用的核心概念是,通过利用许多网站共享许多共同用户的知识,广告商可能更喜欢只在这些网站的子集上显示他的广告,以优化预算分配,并反过来增加他的广告在其他网站上的可见性。我们的网站选举人系统是量身定制的广告专员,它可以很容易地嵌入到他们的广告选择算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Slovak Blog Clustering Enhanced by Mining the Web Comments Automatic Face Annotation in News Images by Mining the Web Exploiting Additional Dimensions as Virtual Items on Top-N Recommender Systems Supporting Agent Systems in the Programming Language A Software Agent Framework for Exploiting Demand-Side Consumer Social Networks in Power Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1