Matches in ScholarlyData for { ?s ?p ?o. }
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasLastItem item-5.
- item-1 type ListItem.
- item-1 hasContent anne-aula.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent rehan-khan.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent peter-hong.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent zhiwei-guan.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent paul-fontes.
- item-5 previous item-4.
- 901 creator brandon-sterne.
- 901 creator gervase-markham.
- 901 creator sid-stamm.
- 901 type InProceedings.
- 901 label "Reigning in the Web with Content Security Policy".
- 901 sameAs 901.
- 901 abstract "The last three years have seen a dramatic increase in both awareness and exploitation of Web Application Vulnerabilities. 2008 and 2009 saw dozens of high-profile attacks against websites using Cross Site Scripting (XSS) and Cross Site Request Forgery (CSRF) for the purposes of information stealing, website defacement, malware planting, clickjacking, etc. While an ideal solution may be to develop web applications free from any exploitable vulnerabilities, real world security is usually provided in layers. We present content restrictions, and a content restrictions enforcement scheme called Content Security Policy (CSP), which intends to be one such layer. Content restrictions allow site designers or server administrators specify how content interacts on their web sites--a security mechanism desparately needed by the untamed Web. These content restrictions rules are activated and enforced by supporting web browsers when a policy is provided for a site via HTTP, and we show how a system such as CSP can be effective to lock down sites and provide an early alert system for vulnerabilities on a web site. Our scheme is also easily deployed, which is made evident by our prototype implementation in Firefox and on the Mozilla Add-Ons web site.".
- 901 hasAuthorList authorList.
- 901 isPartOf proceedings.
- 901 keyword "Fine-grained sharing".
- 901 keyword "access control".
- 901 keyword "privacy".
- 901 keyword "security".
- 901 title "Reigning in the Web with Content Security Policy".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent sid-stamm.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent brandon-sterne.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent gervase-markham.
- item-3 previous item-2.
- 903 creator john-langford.
- 903 creator lihong-li.
- 903 creator robert-schapire.
- 903 creator wei-chu.
- 903 type InProceedings.
- 903 label "A Contextual Bandit Approach to Personalized News Article Recommendation".
- 903 sameAs 903.
- 903 abstract "Personalized web services strive to adapt their services (advertisement, news articles, etc.) to individual users by making use of both content and user information. Despite a few recent advances, this problem remains challenging for at least two reasons. First, web service is featured with dynamically changing pools of contents, rendering traditional collaborative filtering methods inapplicable. Second, the scale of most web services of practical interest calls for solutions that are both fast in learning and computationally cheap. In this work, we model the personalized recommendation of news articles as a contextual bandit problem, a principled approach in which a learning algorithm sequentially selects articles to serve users based on contextual information about the user and articles, while simultaneously adapting its article-selection strategy based on user-click feedback. The contributions of this work are three-fold. First, we propose a novel, general contextual bandit algorithm that is computationally efficient and well motivated from information theory. Second, we argue that any bandit algorithm can be reliably evaluated \emph{offline} using previously recorded random traffic. Finally, using this offline evaluation method, we successfully applied our new algorithm to a commercial product dataset containing over 33 million events, resulting in a 12.5% click lift compared to a standard context-free bandit algorithm, and the advantage becomes even greater when data gets more scarce.".
- 903 hasAuthorList authorList.
- 903 isPartOf proceedings.
- 903 keyword "Personalization".
- 903 keyword "recommendation systems".
- 903 title "A Contextual Bandit Approach to Personalized News Article Recommendation".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent lihong-li.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent wei-chu.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent john-langford.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent robert-schapire.
- item-4 previous item-3.
- 906 creator andrei-broder.
- 906 creator bo-pang.
- 906 creator cristian-danescu-niculescu-mizil.
- 906 creator evgeniy-gabrilovich.
- 906 creator vanja-josifovski.
- 906 type InProceedings.
- 906 label "Competing for Users' Attention: On the Interplay between Organic and Sponsored Search Results".
- 906 sameAs 906.
- 906 abstract "Queries on major Web search engines produce complex result pages, primarily composed of two types of information: organic results, that is, short descriptions and links to relevant Web pages, and sponsored search results, the small textual advertisements often displayed above or to the right of the organic results. Strategies for optimizing each type of result in isolation and the consequent user reaction have been extensively studied; however, the interplay between these two complementary sources of information has been ignored, a situation we aim to change. Our findings indicate that their perceived relative usefulness (as evidenced by user clicks) depends on the nature of the query. Specifically, we found that for navigational queries there is a clear competition between ads and organic results, while for non-navigational queries this competition turns into synergy. We also investigate the relationship between the perceived usefulness of the ads and their textual similarity to the organic results, and propose a model that formalizes this relationship. To this end, we introduce the notion of responsive ads, which directly address the user's information need, and incidental ads, which are only tangentially related to that need. Our findings support the hypothesis that in the case of navigational queries, which are usually fully satisfied by the top organic result, incidental ads are perceived as more valuable than responsive ads, which are likely to be duplicative. On the other hand, in the case of non-navigational queries, incidental ads are perceived as less beneficial, possibly because they diverge too far from the actual user need. We hope that our findings and further research in this area will allow search engines to tune ad selection for an increased synergy between organic and sponsored results, leading to both higher user satisfaction and better monetization.".
- 906 hasAuthorList authorList.
- 906 isPartOf proceedings.
- 906 keyword "Selection".
- 906 keyword "contextual advertisements".