Results 1  10
of
37,319
Maximum entropy markov models for information extraction and segmentation
, 2000
"... Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many textrelated tasks, such as partofspeech tagging, text segmentation and information extraction. In these cases, the observations are usually modeled as multinomial ..."
Abstract

Cited by 561 (18 self)
 Add to MetaCart
Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many textrelated tasks, such as partofspeech tagging, text segmentation and information extraction. In these cases, the observations are usually modeled
Inhomogeneity of the urelements in the usual models of NFU
, 2005
"... The simplest typed theory of sets is the multisorted first order system TST with equality and membership as primitive predicates and with sorts (types) indexed by the natural numbers. Atomic formulas are wellformed if they are of one of the forms x n ∈ y n+1; x n = y n. The axioms of TST are exten ..."
Abstract
 Add to MetaCart
The simplest typed theory of sets is the multisorted first order system TST with equality and membership as primitive predicates and with sorts (types) indexed by the natural numbers. Atomic formulas are wellformed if they are of one of the forms x n ∈ y n+1; x n = y n. The axioms of TST are extensionality (objects of positive type are equal iff they have the same members) and comprehension (“{x n  φ} n+1 exists ” for any formula φ in the language of TST). (this theory has often been incorrectly attributed to Russell, by this author among others: see [17] for a discussion of the actual history of this system). Quine’s New Foundations (NF) ([14]) is obtained from TST by abandoning the types but retaining the same axioms. Note that the comprehension axioms of NF are not all the axioms “{x  φ} exists ” for φ a formula in the language of NF: this would be the inconsistent comprehension axiom of naive set theory. The comprehension axioms of NF are those assertions “{x  φ} exists ” where φ can be obtained from a formula of TST by dropping distinctions of type between variables (without creating any additional identifications between variables).
A subordinated stochastic process model with finite variance for speculative prices
 Econometrica
, 1973
"... Thanks are due to Hendrik Houthakker and Christopher Sims, for both encouragement and advice in developing this paper. As usual, all remaining errors are my own. This research was supported by a Harvard Dissertation Fellowship, NSF grant 33708, and the ..."
Abstract

Cited by 561 (1 self)
 Add to MetaCart
Thanks are due to Hendrik Houthakker and Christopher Sims, for both encouragement and advice in developing this paper. As usual, all remaining errors are my own. This research was supported by a Harvard Dissertation Fellowship, NSF grant 33708, and the
Markov Random Field Models in Computer Vision
, 1994
"... . A variety of computer vision problems can be optimally posed as Bayesian labeling in which the solution of a problem is defined as the maximum a posteriori (MAP) probability estimate of the true labeling. The posterior probability is usually derived from a prior model and a likelihood model. The l ..."
Abstract

Cited by 516 (18 self)
 Add to MetaCart
. A variety of computer vision problems can be optimally posed as Bayesian labeling in which the solution of a problem is defined as the maximum a posteriori (MAP) probability estimate of the true labeling. The posterior probability is usually derived from a prior model and a likelihood model
Initial Conditions and Moment Restrictions in Dynamic Panel Data Models
 Journal of Econometrics
, 1998
"... Estimation of the dynamic error components model is considered using two alternative linear estimators that are designed to improve the properties of the standard firstdifferenced GMM estimator. Both estimators require restrictions on the initial conditions process. Asymptotic efficiency comparisons ..."
Abstract

Cited by 2393 (16 self)
 Add to MetaCart
comparisons and Monte Carlo simulations for the simple AR(1) model demonstrate the dramatic improvement in performance of the proposed estimators compared to the usual firstdifferenced GMM estimator, and compared to nonlinear GMM. The importance of these results is illustrated in an application
National debt in a neoclassical growth model.'
 American Economic Review,
"... This paper contains a model designed to serve two purposes, to examine longrun competitive equilibrium in a growth model and then to explore the effects on this equilibrium of government debt. Samuelson [8] has examined the determination of interest rates in a singlecommodity world without durable ..."
Abstract

Cited by 698 (0 self)
 Add to MetaCart
This paper contains a model designed to serve two purposes, to examine longrun competitive equilibrium in a growth model and then to explore the effects on this equilibrium of government debt. Samuelson [8] has examined the determination of interest rates in a singlecommodity world without
On Model Selection Consistency of Lasso
, 2006
"... Sparsity or parsimony of statistical models is crucial for their proper interpretations, as in sciences and social sciences. Model selection is a commonly used method to find such models, but usually involves a computationally heavy combinatorial search. Lasso (Tibshirani, 1996) is now being used ..."
Abstract

Cited by 477 (20 self)
 Add to MetaCart
Sparsity or parsimony of statistical models is crucial for their proper interpretations, as in sciences and social sciences. Model selection is a commonly used method to find such models, but usually involves a computationally heavy combinatorial search. Lasso (Tibshirani, 1996) is now being
A comparison of event models for Naive Bayes text classification
, 1998
"... Recent work in text classification has used two different firstorder probabilistic models for classification, both of which make the naive Bayes assumption. Some use a multivariate Bernoulli model, that is, a Bayesian Network with no dependencies between words and binary word features (e.g. Larkey ..."
Abstract

Cited by 1025 (26 self)
 Add to MetaCart
Recent work in text classification has used two different firstorder probabilistic models for classification, both of which make the naive Bayes assumption. Some use a multivariate Bernoulli model, that is, a Bayesian Network with no dependencies between words and binary word features (e
The usual model construction for NFU preserves information
, 2009
"... The “usual ” model construction for NFU (Quine’s New Foundations with urelements, shown to be consistent by Jensen) starts with a model of the usual set theory with an automorphism that moves a rank (this rank is the domain of the model). “Most ” elements of the resulting model of NFU are urelements ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The “usual ” model construction for NFU (Quine’s New Foundations with urelements, shown to be consistent by Jensen) starts with a model of the usual set theory with an automorphism that moves a rank (this rank is the domain of the model). “Most ” elements of the resulting model of NFU
ChernSimons Gauge Theory as a String Theory
, 2003
"... Certain two dimensional topological field theories can be interpreted as string theory backgrounds in which the usual decoupling of ghosts and matter does not hold. Like ordinary string models, these can sometimes be given spacetime interpretations. For instance, threedimensional ChernSimons gaug ..."
Abstract

Cited by 545 (13 self)
 Add to MetaCart
Certain two dimensional topological field theories can be interpreted as string theory backgrounds in which the usual decoupling of ghosts and matter does not hold. Like ordinary string models, these can sometimes be given spacetime interpretations. For instance, threedimensional Chern
Results 1  10
of
37,319