Sciweavers

1014 search results - page 87 / 203
» A Spectral Algorithm for Learning Hidden Markov Models
Sort
View
JMLR
2010
185views more  JMLR 2010»
13 years 2 months ago
HMMPayl: an application of HMM to the analysis of the HTTP Payload
Zero-days attacks are one of the most dangerous threats against computer networks. These, by definition, are attacks never seen before. Thus, defense tools based on a database of ...
Davide Ariu, Giorgio Giacinto
ICML
2006
IEEE
14 years 8 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
13 years 11 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
UAI
1998
13 years 9 months ago
The Bayesian Structural EM Algorithm
In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a beli...
Nir Friedman
ICASSP
2010
IEEE
13 years 6 months ago
Learning in Gaussian Markov random fields
This paper addresses the problem of state estimation in the case where the prior distribution of the states is not perfectly known but instead is parameterized by some unknown par...
Thomas J. Riedl, Andrew C. Singer, Jun Won Choi