• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 4,275
Next 10 →

On the optimality of the simple Bayesian classifier under zero-one loss

by Pedro Domingos, Michael Pazzani - MACHINE LEARNING , 1997
"... The simple Bayesian classifier is known to be optimal when attributes are independent given the class, but the question of whether other sufficient conditions for its optimality exist has so far not been explored. Empirical results showing that it performs surprisingly well in many domains containin ..."
Abstract - Cited by 818 (27 self) - Add to MetaCart
The simple Bayesian classifier is known to be optimal when attributes are independent given the class, but the question of whether other sufficient conditions for its optimality exist has so far not been explored. Empirical results showing that it performs surprisingly well in many domains

Maximum Likelihood Linear Transformations for HMM-Based Speech Recognition

by M.J.F. Gales - COMPUTER SPEECH AND LANGUAGE , 1998
"... This paper examines the application of linear transformations for speaker and environmental adaptation in an HMM-based speech recognition system. In particular, transformations that are trained in a maximum likelihood sense on adaptation data are investigated. Other than in the form of a simple bias ..."
Abstract - Cited by 570 (68 self) - Add to MetaCart
This paper examines the application of linear transformations for speaker and environmental adaptation in an HMM-based speech recognition system. In particular, transformations that are trained in a maximum likelihood sense on adaptation data are investigated. Other than in the form of a simple

Segmentation of brain MR images through a hidden Markov random field model and the expectation-maximization algorithm

by Yongyue Zhang, Michael Brady, Stephen Smith - IEEE TRANSACTIONS ON MEDICAL. IMAGING , 2001
"... The finite mixture (FM) model is the most commonly used model for statistical segmentation of brain magnetic resonance (MR) images because of its simple mathematical form and the piecewise constant nature of ideal brain MR images. However, being a histogram-based model, the FM has an intrinsic limi ..."
Abstract - Cited by 639 (15 self) - Add to MetaCart
The finite mixture (FM) model is the most commonly used model for statistical segmentation of brain magnetic resonance (MR) images because of its simple mathematical form and the piecewise constant nature of ideal brain MR images. However, being a histogram-based model, the FM has an intrinsic

Semantics of Context-Free Languages

by Donald E. Knuth - In Mathematical Systems Theory , 1968
"... "Meaning " may be assigned to a string in a context-free language by defining "at-tributes " of the symbols in a derivation tree for that string. The attributes can be de-fined by functions associated with each production in the grammar. This paper examines the implications of th ..."
Abstract - Cited by 569 (0 self) - Add to MetaCart
. An algorithm is given which detects when such semantic rules could possibly lead to circular definition of some attributes. An example is given of a simple programming language defined with both inherited and synthesized attributes, and the method of definition is compared to other techniques for formal

A Simple Biased Distribution for Dinur’s Construction

by Charanjit S. Jutla , 2006
"... The Dinur construction [Din05] achieves gap amplification, by repeatedly applying first a power-ing construction – which increases the gap, but also increases the alphabet size – and then applying a construction to reduce the alphabet size (which diminishes the gap but not by too much). The latter c ..."
Abstract - Add to MetaCart
The Dinur construction [Din05] achieves gap amplification, by repeatedly applying first a power-ing construction – which increases the gap, but also increases the alphabet size – and then applying a construction to reduce the alphabet size (which diminishes the gap but not by too much). The latter construction is based on long codes and is not the focus of the current paper.

Efficient Estimation of Average Treatment Effects Using the Estimated Propensity Score

by Keisuke Hirano , Guido W. Imbens , Geert Ridder , 2000
"... We are interested in estimating the average effect of a binary treatment on a scalar outcome. If assignment to the treatment is independent of the potential outcomes given pretreatment variables, biases associated with simple treatment-control average comparisons can be removed by adjusting for diff ..."
Abstract - Cited by 416 (35 self) - Add to MetaCart
We are interested in estimating the average effect of a binary treatment on a scalar outcome. If assignment to the treatment is independent of the potential outcomes given pretreatment variables, biases associated with simple treatment-control average comparisons can be removed by adjusting

Forecasting bankruptcy more accurately: a simple hazard model

by Tyler Shumway - 0 otherwise P (Yit = 1) = FLOGIT (z 0 (i;t) ) with Yit = 1 , Y it < 0 where Y it = c + Z 0 (i;t) + " (i;t) and the , 2001
"... I argue that hazard models are more appropriate for forecasting bankruptcy than the single-period models used previously. Single-period bankruptcy models give biased and inconsistent probability estimates while hazard models produce consistent estimates. I describe a simple technique for estimating ..."
Abstract - Cited by 358 (1 self) - Add to MetaCart
I argue that hazard models are more appropriate for forecasting bankruptcy than the single-period models used previously. Single-period bankruptcy models give biased and inconsistent probability estimates while hazard models produce consistent estimates. I describe a simple technique for estimating

A simple bias correction algorithm for use in data assimilation

by Richard B. Rood, Lawrence L. Takacs - Goddard Space Flight Center, Greenbelt, MD , 1996
"... This paper has not been published and should be regarded as an Internal Report from DAO. Permission to quote from it should be obtained from the DAO. ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
This paper has not been published and should be regarded as an Internal Report from DAO. Permission to quote from it should be obtained from the DAO.

and fill: a simple funnel-plot-based method of testing and adjusting for publication bias in meta-analysis. Biometrics 2000;56:455–63

by Sue Duval, Richard Tweedie
"... SUMMARY. We study recently developed nonparametric methods for estimating the number of missing studies that might exist in a meta-analysis and the effect that these studies might have had on its outcome. These are simple rank-based data augmentation techniques, which formalize the use of funnel plo ..."
Abstract - Cited by 312 (1 self) - Add to MetaCart
SUMMARY. We study recently developed nonparametric methods for estimating the number of missing studies that might exist in a meta-analysis and the effect that these studies might have had on its outcome. These are simple rank-based data augmentation techniques, which formalize the use of funnel

The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator.

by Jim Pitman, Marc Yor , 1995
"... The two-parameter Poisson-Dirichlet distribution, denoted pd(ff; `), is a distribution on the set of decreasing positive sequences with sum 1. The usual Poisson-Dirichlet distribution with a single parameter `, introduced by Kingman, is pd(0; `). Known properties of pd(0; `), including the Markov ..."
Abstract - Cited by 356 (33 self) - Add to MetaCart
chain description due to Vershik-Shmidt-Ignatov, are generalized to the two-parameter case. The size-biased random permutation of pd(ff; `) is a simple residual allocation model proposed by Engen in the context of species diversity, and rediscovered by Perman and the authors in the study of excursions
Next 10 →
Results 1 - 10 of 4,275
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University