• 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 237
Next 10 →

Parsimonious Language Models for Information Retrieval

by Djoerd Hiemstra, Stephen Robertson, Hugo Zaragoza - In Proceedings of the 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval , 2004
"... We systematically investigate a new approach to estimating the parameters of language models for information retrieval, called parsimonious language models. Parsimonious language models explicitly address the relation between levels of language models that are typically used for smoothing. As such, ..."
Abstract - Cited by 322 (41 self) - Add to MetaCart
We systematically investigate a new approach to estimating the parameters of language models for information retrieval, called parsimonious language models. Parsimonious language models explicitly address the relation between levels of language models that are typically used for smoothing. As such

Air quality prediction in Milan: feed-forward neural networks, pruned neural networks and lazy learning

by Giorgio Corani - Ecological Modelling
"... Ozone and PM10 constitute the major concern for air quality of Milan. This paper addresses the problem of the prediction of such two pollutants, using to this end several statistical approaches. In particular, feed-forward neural networks (FFNNs), currently recognized as state-of-the-art approach fo ..."
Abstract - Cited by 19 (3 self) - Add to MetaCart
for statistical prediction of air quality, are compared with two alternative approaches derived from machine learning: pruned neural networks (PNNs) and lazy learning (LL). PNNs constitute a parameter-parsimonious approach, based on the removal of redundant parameters from fully connected neural networks; LL

Transforming men into mice (polynomial algorithm for genomic distance problem

by Sridhar Hannenhalli, Pavel A. Pevzner - In 36th Annual IEEE Symposium on Foundations of Computer Science , 1995
"... Then Puss said, \I understand that you have magical powers, that you can change yourself into any kind of animal... But, it must be easy to turn yourself into something huge. However, it must be impossible to turn into something very, very small- like a mouse". Brothers Grimm, Puss N Boots ..."
Abstract - Cited by 128 (9 self) - Add to MetaCart
. We prove a duality theorem which expresses the genomic distance in terms of easily computable parameters re ecting di erent combinatorial properties of sets of strings. This theorem leads to a polynomial-time algorithm for computing most parsimonious rearrangement scenarios. Based on this result

A multiple discrete-continuous extreme value model: formulation and application to discretionary time-use decisions

by Chandra R. Bhat - Transportation Research Part B , 2005
"... Many consumer choice situations are characterized by the simultaneous demand for multiple alternatives that are imperfect substitutes for one another. A simple and parsimonious Multiple Discrete-Continuous Extreme Value (MDCEV) econometric approach to handle such multiple discreteness was formulated ..."
Abstract - Cited by 82 (27 self) - Add to MetaCart
Many consumer choice situations are characterized by the simultaneous demand for multiple alternatives that are imperfect substitutes for one another. A simple and parsimonious Multiple Discrete-Continuous Extreme Value (MDCEV) econometric approach to handle such multiple discreteness

The relative performance of Bayesian and parsimony approaches when Sampling Characters . . .

by Mark P. Simmons, Li-Bing Zhang, Colleen T. Webb, Aaron Reeves, Jeremy A. Miller , 2006
"... We tested whether it is beneficial for the accuracy of phylogenetic inference to sample characters that are evolving under different sets of parameters, using both Bayesian MCMC (Markov chain Monte Carlo) and parsimony approaches. We examined differential rates of evolution among characters, differe ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
We tested whether it is beneficial for the accuracy of phylogenetic inference to sample characters that are evolving under different sets of parameters, using both Bayesian MCMC (Markov chain Monte Carlo) and parsimony approaches. We examined differential rates of evolution among characters

The Demand for M3 in the Euro Area

by Günter Coenen, Juan-Luis Vega, Günter Coenen , 1999
"... In this paper, an empirically stable money demand model for M3 in the euro area is constructed. Starting with a multivariate system, three cointegrating relationships with economic content are found: (i) the spread between the long- and the short-term nominal interest rates, (ii) the long-term real ..."
Abstract - Cited by 68 (2 self) - Add to MetaCart
interest rate, and (iii) a long-run demand for broad money M3. There is evidence that the determinants of M3 money demand are weakly exogenous with respect to the long-run parameters. Hence, following a general-to-specific modelling approach, a parsimonious conditional error-correction model for M3 money

U.S. Geological Survey

by Michael Fienen, R. Hunt, D. Krabbenhoft, Tom Clemo , 2009
"... Obtaining parsimonious hydraulic conductivity fields using head and transport observations: A Bayesian geostatistical parameter estimation approach ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Obtaining parsimonious hydraulic conductivity fields using head and transport observations: A Bayesian geostatistical parameter estimation approach

Learning Multiple Related Tasks Using Latent Independent Component Analysis

by Jian Zhang, Jian Zhangý, Yiming Yang, Zoubin Ghahramani, Yiming Yangý , 2005
"... We propose a probabilistic model based on Independent Component Analysis for learning multiple related tasks. In our model the task parameters are assumed to be generated from independent sources which account for the relatedness of the tasks. We use Laplace distributions to model hidden sources ..."
Abstract - Cited by 53 (5 self) - Add to MetaCart
We propose a probabilistic model based on Independent Component Analysis for learning multiple related tasks. In our model the task parameters are assumed to be generated from independent sources which account for the relatedness of the tasks. We use Laplace distributions to model hidden

likelihood and the role of models in molecular phylogenetics.

by Mike Steel , David Penny - Mol. Biol. Evol. , 2000
"... Methods such as maximum parsimony (MP) are frequently criticized as being statistically unsound and not being based on any ''model.'' On the other hand, advocates of MP claim that maximum likelihood (ML) has some fundamental problems. Here, we explore the connection between the ..."
Abstract - Cited by 70 (11 self) - Add to MetaCart
) to be this average value. That is, if ⌽( ͦ T) denotes the distribution function of the nuisance parameters conditional on the underlying tree T, then ͵ This approach is sometimes referred to as ''integrated likelihood,'' and we will refer to a tree T that maximizes P(D ͦ T) as a maximum

Multiperiod Corporate Default Prediction - A Forward Intensity Approach

by Jin-chuan Duan, Andras Fulop - Journal of Econometrics , 2012
"... The forward-intensity model of Duan, et al (2012) has proved to be a parsimonious and practical way for predicting corporate defaults over multiple horizons. However, it has a noticeable shortcoming because default correlations through intensities are conspicuously absent when the prediction horizon ..."
Abstract - Cited by 18 (6 self) - Add to MetaCart
The forward-intensity model of Duan, et al (2012) has proved to be a parsimonious and practical way for predicting corporate defaults over multiple horizons. However, it has a noticeable shortcoming because default correlations through intensities are conspicuously absent when the prediction
Next 10 →
Results 1 - 10 of 237
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