Sciweavers

1014 search results - page 141 / 203
» A Spectral Algorithm for Learning Hidden Markov Models
Sort
View
TNN
2008
181views more  TNN 2008»
13 years 7 months ago
Optimized Approximation Algorithm in Neural Networks Without Overfitting
In this paper, an optimized approximation algorithm (OAA) is proposed to address the overfitting problem in function approximation using neural networks (NNs). The optimized approx...
Yinyin Liu, Janusz A. Starzyk, Zhen Zhu
IJCAI
2003
13 years 9 months ago
Multiple-Goal Reinforcement Learning with Modular Sarsa(0)
We present a new algorithm, GM-Sarsa(0), for finding approximate solutions to multiple-goal reinforcement learning problems that are modeled as composite Markov decision processe...
Nathan Sprague, Dana H. Ballard
JCDL
2006
ACM
151views Education» more  JCDL 2006»
14 years 1 months ago
Tagging of name records for genealogical data browsing
In this paper we present a method of parsing unstructured textual records briefly describing a person and their direct relatives, which we use in the construction of a browsing t...
Mike Perrow, David Barber
ATAL
2005
Springer
14 years 1 months ago
Modeling task allocation using a decision theoretic model
Mediation is the process of decomposing a task into subtasks, finding agents suitable for these subtasks and negotiating with agents to obtain commitments to execute these subtas...
Sherief Abdallah, Victor R. Lesser
BMCBI
2002
108views more  BMCBI 2002»
13 years 7 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy