Sciweavers

39 search results - page 6 / 8
» Selecting Features by Learning Markov Blankets
Sort
View
PAMI
2006
143views more  PAMI 2006»
13 years 7 months ago
Variational Bayes for Continuous Hidden Markov Models and Its Application to Active Learning
In this paper we present a variational Bayes (VB) framework for learning continuous hidden Markov models (CHMMs), and we examine the VB framework within active learning. Unlike a ...
Shihao Ji, Balaji Krishnapuram, Lawrence Carin
IJCNN
2000
IEEE
13 years 11 months ago
Competing Hidden Markov Models on the Self-Organizing Map
This paper presents an unsupervised segmentation method for feature sequences based on competitivelearning hidden Markov models. Models associated with the nodes of the Self-Organ...
Panu Somervuo
BMCBI
2010
159views more  BMCBI 2010»
13 years 7 months ago
Predicting domain-domain interaction based on domain profiles with feature selection and support vector machines
Background: Protein-protein interaction (PPI) plays essential roles in cellular functions. The cost, time and other limitations associated with the current experimental methods ha...
Alvaro J. González, Li Liao
AIPS
2007
13 years 9 months ago
Discovering Relational Domain Features for Probabilistic Planning
In sequential decision-making problems formulated as Markov decision processes, state-value function approximation using domain features is a critical technique for scaling up the...
Jia-Hong Wu, Robert Givan
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
14 years 2 months ago
Primal sparse Max-margin Markov networks
Max-margin Markov networks (M3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M3 N enjoys dual sparsity. However, the...
Jun Zhu, Eric P. Xing, Bo Zhang