Matches in ScholarlyData for { ?s ?p ?o. }
- item-3 hasContent jon-kleinberg.
- item-3 previous item-2.
- 695 creator chengkai-li.
- 695 creator gautam-das.
- 695 creator lekhendro-lisham.
- 695 creator ning-yan.
- 695 creator senjuti-roy.
- 695 type InProceedings.
- 695 label "Facetedpedia: Dynamic Generation of Query-Dependent Faceted Interfaces for Wikipedia".
- 695 sameAs 695.
- 695 abstract "This paper proposes Facetedpedia, a faceted retrieval system for information discovery and exploration over Wikipedia. Given the set of Wikipedia articles resulting from a keyword query, Facetedpedia generates a faceted interface for navigating the result articles. Compared with other traditional faceted retrieval systems, Facetedpedia is fully automatic and dynamic in both facets generation and hierarchy construction, and the facets are based on rich semantic information from Wikipedia. The essence of our approach is to build upon the collaborative vocabulary in Wikipedia, more specifically the intensive structures (hyperlinks) and folksonomy (category system). Given the sheer size and complexity of Wikipedia, the space of possible choices of faceted interfaces is prohibitively large. We propose metrics for ranking individual facet hierarchies by user's navigational cost, and metrics for ranking interfaces (each with k facets) by both their average pairwise similarities and average navigational costs. We thus develop faceted interface discovery algorithms that optimize the ranking metrics and generate the faceted interface. Our experimental evaluation and user study verify the effectiveness of the system.".
- 695 hasAuthorList authorList.
- 695 isPartOf proceedings.
- 695 keyword "Faceted".
- 695 keyword "desktop search".
- 695 keyword "enterprise".
- 695 title "Facetedpedia: Dynamic Generation of Query-Dependent Faceted Interfaces for Wikipedia".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- 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 chengkai-li.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent ning-yan.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent senjuti-roy.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent lekhendro-lisham.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent gautam-das.
- item-5 previous item-4.
- 699 creator amin-sayedi.
- 699 creator arpita-ghosh.
- 699 type InProceedings.
- 699 label "Expressive Auctions for Externalities in Online Advertising".
- 699 sameAs 699.
- 699 abstract "When online ads are shown together, they compete for user attention and conversions, imposing negative externalities on each other. While the competition for user attention in sponsored search can be captured via models of clickthrough rates, the post-click {\em competition for conversions} cannot: since the value-per-click of an advertiser is proportional to the conversion probability conditional on a click, which depends on the other ads displayed, the private value of an advertiser is no longer one-dimensional, and the GSP mechanism is not adequately expressive. We study the design of expressive GSP-like mechanisms for the simplest form that an advertiser's private value can have in the presence of such externalities--- an advertiser's value depends on {\em exclusivity}, \ie, whether her ad is shown exclusively, or along with other ads. Our auctions take as input two-dimensional (per-click) bids for exclusive and nonexclusive display, and have two types of outcomes: either a single ad is displayed exclusively, or multiple ads are simultaneously shown. We design two expressive auctions that are both extensions of GSP--- the first auction, \GGSP, is designed with the property that the allocation and pricing are identical to GSP when multiple ads are shown; the second auction, \NP, is designed to be a next price auction. We show that both auctions have high efficiency and revenue in all reasonable equilibria; further, the \NP\ auction is guaranteed to always have an equilibrium with revenue at least as much as the current GSP mechanism. However, we find that unlike with one-dimensional valuations, the GSP-like auctions for these richer valuations do not always preserve efficiency and revenue with respect to the VCG mechanism.".
- 699 hasAuthorList authorList.
- 699 isPartOf proceedings.
- 699 keyword "Internet auctions".
- 699 keyword "exchanges".
- 699 keyword "markets".
- 699 title "Expressive Auctions for Externalities in Online Advertising".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent arpita-ghosh.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent amin-sayedi.
- item-2 previous item-1.
- 700 creator sarthak-shah.
- 700 creator xiaoxin-yin.
- 700 type InProceedings.
- 700 label "Building Taxonomy of Web Search Intents for Name Entity Queries".
- 700 sameAs 700.
- 700 abstract "A significant portion of web search queries are name entity queries. The major search engines have been exploring various ways to provide better user experiences for name entity queries, such as showing “search tasks” (Bing search) and showing direct answers (Yahoo!, Kosmix). In order to provide the search tasks or direct answers that can satisfy most popular user intents, we need to capture these intents, together with relationships between them. In this paper we propose an approach for building a hierarchical taxonomy of the generic search intents for a class of name entities (e.g., musicians or cities). The proposed approach can find phrases representing generic intents from user queries, and organize these phrases into a tree, so that phrases indicating equivalent or similar meanings are on the same node, and the parent-child relationships of tree nodes represent the relationships between search intents and their sub-intents. Three different methods are proposed for tree building, which are based on directed maximum spanning tree, hierarchical agglomerative clustering, and pachinko allocation model. Our approaches are purely based on search logs, and do not utilize any existing taxonomies such as Wikipedia. With the evaluation by human judges (via Mechanical Turk), it is shown that our approaches can build trees of phrases that capture the relationships between important search intents.".
- 700 hasAuthorList authorList.
- 700 isPartOf proceedings.
- 700 keyword "Query log".
- 700 keyword "click trail".
- 700 keyword "traffic data mining".
- 700 title "Building Taxonomy of Web Search Intents for Name Entity Queries".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent xiaoxin-yin.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent sarthak-shah.
- item-2 previous item-1.
- 71 creator adrienne-felt.
- 71 creator leo-meyerovich.
- 71 type InProceedings.
- 71 label "Object Views: Fine-Grained Sharing in Browsers".
- 71 sameAs 71.
- 71 abstract "Browsers do not currently support the secure sharing of JavaScript objects between principals. We present this problem as the need for object views, which are consistent and controllable versions of objects. Multiple views can be made for the same object and customized for the recipients. We implement object views with a JavaScript library that wraps shared objects and interposes on all access attempts. Developers can control the fine-grained behavior of objects with an aspect system that accepts programmatic policies. The security challenge is to fully mediate access to objects shared through a view and prevent privilege escalation. To facilitate simple document sharing, we build a policy system for declaratively defining policies for document object views. Notably, our document policy system makes it possible to hide elements without breaking document structure invariants. We discuss how object views can be deployed in two settings: same-origin sharing with rewriting-based JavaScript isolation systems like Google Caja, and inter-origin sharing between browser frames over a message-passing channel.".
- 71 hasAuthorList authorList.
- 71 isPartOf proceedings.
- 71 keyword "Fine-grained sharing".
- 71 keyword "access control".
- 71 keyword "privacy".