Sciweavers

78 search results - page 8 / 16
» A choice model with infinitely many latent features
Sort
View
DLOG
2009
13 years 5 months ago
Revision of DL-Lite Knowledge Bases
Abstract. We address the revision problem for knowledge bases (KBs) in Description Logics (DLs). This problem has received much attention in the ontology management and DL communit...
Zhe Wang, Kewen Wang, Rodney W. Topor
TASLP
2002
84views more  TASLP 2002»
13 years 7 months ago
Maximum likelihood multiple subspace projections for hidden Markov models
The first stage in many pattern recognition tasks is to generate a good set of features from the observed data. Usually, only a single feature space is used. However, in some compl...
Mark J. F. Gales
AAAI
2011
12 years 7 months ago
An Online Spectral Learning Algorithm for Partially Observable Nonlinear Dynamical Systems
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
Byron Boots, Geoffrey J. Gordon
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 1 months ago
Learning noise
In this paper we propose a genetic programming approach to learning stochastic models with unsymmetrical noise distributions. Most learning algorithms try to learn from noisy data...
Michael D. Schmidt, Hod Lipson
ISI
2004
Springer
14 years 25 days ago
Spatial Forecast Methods for Terrorist Events in Urban Environments
Abstract. Terrorist events such as suicide bombings are rare yet extremely destructive events. Responses to such events are even rarer, because they require forecasting methods for...
Donald Brown, Jason Dalton, Heidi Hoyle