scispace - formally typeset
Search or ask a question
Institution

Yahoo!

CompanyLondon, United Kingdom
About: Yahoo! is a company organization based out in London, United Kingdom. It is known for research contribution in the topics: Population & Web search query. The organization has 26749 authors who have published 29915 publications receiving 732583 citations. The organization is also known as: Yahoo! Inc. & Maudwen-Yahoo! Inc.


Papers
More filters
Journal ArticleDOI
TL;DR: The benefits of topical fluorides have been firmly established on a sizeable body of evidence from randomized controlled trials, and the formal examination of sources of heterogeneity between studies has been important in the overall conclusions reached.
Abstract: Background Topical fluoride therapy (TFT) in the form of varnish, gel, mouthrinse or toothpaste has been used extensively as a caries-preventive intervention for over three decades. Objectives To determine the effectiveness and safety of fluoride varnishes, gels, mouthrinses, and toothpastes in the prevention of dental caries in children and to examine factors potentially modifying their effect. Search strategy We searched the Cochrane Oral Health Group's Trials Register (May 2000), CENTRAL (The Cochrane Library Issue 2, 2000), MEDLINE (1966 to January 2000), plus several other databases. We handsearched journals, reference lists of articles and contacted selected authors and manufacturers. Selection criteria Randomized or quasi-randomized controlled trials with blind outcome assessment, comparing fluoride varnish, gel, mouthrinse, or toothpaste with placebo or no treatment in children up to 16 years during at least 1 year. The main outcome was caries increment measured by the change in decayed, missing and filled tooth surfaces (D(M)FS). Data collection and analysis Inclusion decisions, quality assessment and data extraction were duplicated in a random sample of one third of studies, and consensus achieved by discussion or a third party. Authors were contacted for missing data. The primary measure of effect was the prevented fraction (PF) that is the difference in mean caries increments between the treatment and control groups expressed as a percentage of the mean increment in the control group. Random effects meta-analyses were performed where data could be pooled. Potential sources of heterogeneity were examined in random effects metaregression analyses. Main results There were 144 studies included. For the 133 that contributed data for meta-analysis (involving 65,169 children) the D(M)FS pooled prevented fraction estimate was 26% (95% CI, 24% to 29%; p Reviewer's conclusions The benefits of topical fluorides have been firmly established on a sizeable body of evidence from randomized controlled trials. While the formal examination of sources of heterogeneity between studies has been important in the overall conclusions reached, these should be interpreted with caution. We were unable to reach definite conclusions about any adverse effects that might result from the use of topical fluorides, because data reported in the trials are scarce.

396 citations

Journal ArticleDOI
Winter Mason1, Duncan J. Watts1
TL;DR: It is found that increased financial incentives increase the quantity, but not the quality, of work performed by participants, where the difference appears to be due to an "anchoring" effect.
Abstract: The relationship between financial incentives and performance, long of interest to social scientists, has gained new relevance with the advent of web-based "crowd-sourcing" models of production. Here we investigate the effect of compensation on performance in the context of two experiments, conducted on Amazon's Mechanical Turk (AMT). We find that increased financial incentives increase the quantity, but not the quality, of work performed by participants, where the difference appears to be due to an "anchoring" effect: workers who were paid more also perceived the value of their work to be greater, and thus were no more motivated than workers paid less. In contrast with compensation levels, we find the details of the compensation scheme do matter--specifically, a "quota" system results in better work for less pay than an equivalent "piece rate" system. Although counterintuitive, these findings are consistent with previous laboratory studies, and may have real-world analogs as well.

396 citations

Proceedings Article
21 Jun 2014
TL;DR: In this paper, a new algorithm for the contextual bandit learning problem is presented, where the learner repeatedly takes one of K actions in response to the observed context, and observes the reward only for that action.
Abstract: We present a new algorithm for the contextual bandit learning problem, where the learner repeatedly takes one of K actions in response to the observed context, and observes the reward only for that action. Our method assumes access to an oracle for solving fully supervised cost-sensitive classification problems and achieves the statistically optimal regret guarantee with only O(√KT) oracle calls across all T rounds. By doing so, we obtain the most practical contextual bandit learning algorithm amongst approaches that work for general policy classes. We conduct a proof-of-concept experiment which demonstrates the excellent computational and statistical performance of (an online variant of) our algorithm relative to several strong baselines.

393 citations

Proceedings ArticleDOI
28 Jun 2009
TL;DR: This work proposes simple combinatorial formulations that encapsulate efficient compressibility of graphs and shows that some of the problems are NP-hard yet admit effective heuristics, some of which can exploit properties of social networks such as link reciprocity.
Abstract: Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be compressed. Boldi and Vigna (WWW 2004), showed that Web graphs can be compressed down to three bits of storage per edge; we study the compressibility of social networks where again adjacency queries are a fundamental primitive. To this end, we propose simple combinatorial formulations that encapsulate efficient compressibility of graphs. We show that some of the problems are NP-hard yet admit effective heuristics, some of which can exploit properties of social networks such as link reciprocity. Our extensive experiments show that social networks and the Web graph exhibit vastly different compressibility characteristics.

391 citations

Journal ArticleDOI
TL;DR: This work state and analyze the first active learning algorithm that finds an @e-optimal hypothesis in any hypothesis class, when the underlying distribution has arbitrary forms of noise, and achieves an exponential improvement over the usual sample complexity of supervised learning.

391 citations


Authors

Showing all 26766 results

NameH-indexPapersCitations
Ashok Kumar1515654164086
Alexander J. Smola122434110222
Howard I. Maibach116182160765
Sanjay Jain10388146880
Amirhossein Sahebkar100130746132
Marc Davis9941250243
Wenjun Zhang9697638530
Jian Xu94136652057
Fortunato Ciardiello9469547352
Tong Zhang9341436519
Michael E. J. Lean9241130939
Ashish K. Jha8750330020
Xin Zhang87171440102
Theunis Piersma8663234201
George Varghese8425328598
Network Information
Related Institutions (5)
University of Toronto
294.9K papers, 13.5M citations

85% related

University of California, San Diego
204.5K papers, 12.3M citations

85% related

University College London
210.6K papers, 9.8M citations

84% related

Cornell University
235.5K papers, 12.2M citations

84% related

University of Washington
305.5K papers, 17.7M citations

84% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20232
202247
20211,088
20201,074
20191,568
20181,352