Browsing by Subject "Hidden markov models"
Now showing items 1-9 of 9
-
Conference Object
Bound on the probability of HMM misclassification
(2011)In this paper we consider the problem of classifying a sequence of observations among two known hidden Markov models (HMMs). We use a classifier that minimizes the probability of error (i.e., the probability of misclassification), ...
-
Conference Object
Bounds on the probability of misclassification among hidden Markov models
(2011)Given a sequence of observations, classification among two known hidden Markov models (HMMs) can be accomplished with a classifier that minimizes the probability of error (i.e., the probability of misclassification) by ...
-
Conference Object
Detection of collaborative cyber-attacks through correlation and time dependency analysis
(Institute of Electrical and Electronics Engineers Inc., 2016)In this paper, we consider the detection of suspiciously high correlation between malicious Internet users that are collaborating in order to cause a Denial of Service (DoS) Attack. The main goal is to recognise cyber ...
-
Conference Object
Hidden markov model classification based on empirical frequencies of observed symbols
(IFAC Secretariat, 2014)Given a sequence of observations, classification among two known hidden Markov models (HMMs) can be accomplished with a classifier that minimizes the probability of error (i.e., the probability of misclassification) by ...
-
Article
Maximum likelihood failure diagnosis in finite state machines under unreliable observations
(2010)In this paper, we develop a probabilistic methodology for failure diagnosis in finite state machines based on a sequence of unreliable observations. Given prior knowledge of the input probability distribution but without ...
-
Conference Object
Probabilistic failure diagnosis in finite state machines under unreliable observations
(2006)In this paper we develop a probabilistic methodology for calculating the likelihood that an observed, possibly corrupted event sequence was generated by two (or more) candidate finite state machines (FSMs) (one of which ...
-
Conference Object
Probabilistic system opacity in discrete event systems
(Institute of Electrical and Electronics Engineers Inc., 2016)In many emerging security applications, a system designer frequently needs to ensure that a certain property of a given system (that may reveal important details about the system's operation) be kept secret (opaque) to ...
-
Article
Probabilistic system opacity in discrete event systems
(2018)In many emerging security applications, a system designer frequently needs to ensure that a certain property of a given system (that may reveal important details about the system’s operation) be kept secret (opaque) to ...
-
Conference Object
Probability of error bounds for failure diagnosis and classification in hidden Markov models
(2008)In this paper we consider a formulation of the failure diagnosis problem in stochastic systems as a maximum likelihood classification problem: a diagnoser observes the system under diagnosis online and determines which ...