Sciweavers

723 search results - page 18 / 145
» Learning a Hidden Subgraph
Sort
View
ICASSP
2008
IEEE
14 years 1 months ago
Maximum entropy relaxation for multiscale graphical model selection
We consider the problem of learning multiscale graphical models. Given a collection of variables along with covariance specifications for these variables, we introduce hidden var...
Myung Jin Choi, Venkat Chandrasekaran, Alan S. Wil...
IJON
2007
184views more  IJON 2007»
13 years 7 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen
ICML
2004
IEEE
14 years 8 months ago
Utile distinction hidden Markov models
This paper addresses the problem of constructing good action selection policies for agents acting in partially observable environments, a class of problems generally known as Part...
Daan Wierstra, Marco Wiering
ICA
2010
Springer
13 years 8 months ago
Non-negative Hidden Markov Modeling of Audio with Application to Source Separation
Abstract. In recent years, there has been a great deal of work in modeling audio using non-negative matrix factorization and its probabilistic counterparts as they yield rich model...
Gautham J. Mysore, Paris Smaragdis, Bhiksha Raj
JMLR
2010
112views more  JMLR 2010»
13 years 2 months ago
Reduced-Rank Hidden Markov Models
Hsu et al. (2009) recently proposed an efficient, accurate spectral learning algorithm for Hidden Markov Models (HMMs). In this paper we relax their assumptions and prove a tighte...
Sajid M. Siddiqi, Byron Boots, Geoffrey J. Gordon