Matches in ScholarlyData for { ?s ?p ?o. }
- 45 type InProceedings.
- 45 label "Active Objects: Actions for Entity-Centric Search".
- 45 sameAs 45.
- 45 abstract "We introduce an entity-centric search experience, called active objects, in which entity-bearing queries are paired with actions that can be performed on the entities. For example, given a query for a specific flashlight, we aim to present actions such as reading reviews, watching demo videos, and finding the best price online. In an annotation study conducted over a random sample of user query sessions, we found that a large proportion of queries in query logs involve actions on entities, calling for an automatic approach to identifying relevant actions for entity-bearing queries. In this paper, we pose the problem of finding actions that can be performed on entities as the problem of doing probabilistic inference in a graphical model that captures how an entity bearing query is generated. We design models of increasing complexity that capture latent factors such as entity type and intended actions that determine how a user writes a query in a search box, and the URL that they click on. Given a large collection of real-world queries and clicks from a commercial search engine, the models are learned efficiently through maximum likelihood estimation using an EM algorithm. Given a new query, probabilistic inference enables recommendation of a set of pertinent actions and hosts. We propose an evaluation methodology for measuring the relevance of our recommended actions, and show empirical evidence of the quality and the diversity of the discovered actions.".
- 45 hasAuthorList authorList.
- 45 isPartOf proceedings.
- 45 keyword "Actions".
- 45 keyword "Active Objects".
- 45 keyword "Entity-Centric Search".
- 45 keyword "Query Log Mining".
- 45 keyword "Web Search".
- 45 title "Active Objects: Actions for Entity-Centric Search".
- 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 thomas-lin.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent patrick-pantel.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent michael-gamon.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent anitha-kannan.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent ariel-fuxman.
- item-5 previous item-4.
- 453 creator jordan-boyd-graber.
- 453 creator ke-zhai.
- 453 creator nima-asadi.
- 453 type InProceedings.
- 453 label "Using Variational Inference and MapReduce to Scale Topic Modeling".
- 453 sameAs 453.
- 453 abstract "Latent Dirichlet Allocation (LDA) is a popular topic modeling technique for exploring document collections. Because of the increasing prevalence of large datasets, there is a need to improve the scalability of inference of LDA. In this paper, we propose a technique called ~\emph{MapReduce LDA} (Mr. LDA) to accommodate very large corpus collections in the MapReduce framework. In contrast to other techniques to scale inference for LDA, which use Gibbs sampling, we use variational inference. Our solution efficiently distributes computation and is relatively simple to implement. More importantly, this variational implementation, unlike highly tuned and specialized implementations, is easily extensible. We demonstrate two extensions of the model possible with this scalable framework: informed priors to guide topic discovery and modeling topics from a multilingual corpus.".
- 453 hasAuthorList authorList.
- 453 isPartOf proceedings.
- 453 keyword "lda".
- 453 keyword "mapreduce".
- 453 keyword "multilingual".
- 453 keyword "online inference".
- 453 keyword "scale".
- 453 keyword "topic modeling".
- 453 keyword "variational inference".
- 453 title "Using Variational Inference and MapReduce to Scale Topic Modeling".
- 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 ke-zhai.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent jordan-boyd-graber.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent nima-asadi.
- item-3 previous item-2.
- 461 creator arpita-ghosh.
- 461 creator patrick-hummel.
- 461 type InProceedings.
- 461 label "Implementing Optimal Outcomes in Social Computing: A Game-Theoretic Approach".
- 461 sameAs 461.
- 461 abstract "In many social computing applications such as online Q&A forums, the best contribution for each task receives some high reward, while all remaining contributions receive an identical, lower reward irrespective of their actual qualities. Suppose a mechanism designer (site owner) wishes to optimize an objective that is some function of the number and qualities of received contributions. When potential contributors are strategic agents, who decide whether to contribute or not to selfishly maximize their own utilities, is such a "best contribution" mechanism, M_B, adequate to implement an outcome that is optimal for the mechanism designer? We present a model to address this question, and prove the following implementation result: for any reasonable objective, the rewards for the best and remaining contributions in M_B can always be chosen so that the strategies used by agents in the unique symmetric equilibrium of M_B maximize the mechanism designer's expected utility. This optimal implementation property is not unique to M_B; we show how it can be extended to a broader family of mechanisms. We next address the setting where the mechanism designer does not know the parameters of the agents' utilities, as might be the case in practice, and show how she can learn the values of these optimal rewards for M_B. Finally, we ask whether this unique symmetric equilibrium implementing the optimal outcome is also the unique equilibrium of the game. Here we show that for a broad family of mechanisms that includes M_B, there also exist asymmetric equilibria that may not maximize the mechanism designer's utility.".
- 461 hasAuthorList authorList.
- 461 isPartOf proceedings.
- 461 keyword "crowdsourcing".
- 461 keyword "game theory".
- 461 keyword "social computing".
- 461 keyword "user-generated content".
- 461 title "Implementing Optimal Outcomes in Social Computing: A Game-Theoretic Approach".
- 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 patrick-hummel.
- item-2 previous item-1.
- 464 creator jun-wang.
- 464 creator neal-lathia.
- 464 creator tamas-jambor.
- 464 type InProceedings.
- 464 label "Using Control Theory for Stable and Efficient Recommender Systems".