Sciweavers

697 search results - page 7 / 140
» Learning a Hidden Hypergraph
Sort
View
STOC
2005
ACM
84views Algorithms» more  STOC 2005»
14 years 7 months ago
Learning nonsingular phylogenies and hidden Markov models
In this paper, we study the problem of learning phylogenies and hidden Markov models. We call the Markov model nonsingular if all transtion matrices have determinants bounded away...
Elchanan Mossel, Sébastien Roch
MICAI
2007
Springer
14 years 1 months ago
An EM Algorithm to Learn Sequences in the Wavelet Domain
The wavelet transform has been used for feature extraction in many applications of pattern recognition. However, in general the learning algorithms are not designed taking into acc...
Diego H. Milone, Leandro E. Di Persia
ESANN
2008
13 years 8 months ago
Word recognition and incremental learning based on neural associative memories and hidden Markov models
Abstract. An architecture for achieving word recognition and incremental learning of new words in a language processing system is presented. The architecture is based on neural ass...
Zöhre Kara Kayikci, Günther Palm
CVPR
2011
IEEE
13 years 3 months ago
Hyper-graph Matching via Reweighted Random Walks
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
Jungmin Lee (Seoul National University), Minsu Cho...
ICONIP
2008
13 years 8 months ago
Experimental Study of Ergodic Learning Curve in Hidden Markov Models
A number of learning machines used in information science are not regular, but rather singular, because they are non-identifiable and their Fisher information matrices are singula...
Masashi Matsumoto, Sumio Watanabe