By Topic

Discovering operational signatures with time constraints from a discrete event sequence

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
P. Bouche ; Lab. des Sci. de l'Inf. et des Syst., CNRS, Marseille, France ; M. Le Goc

This paper aims at showing a method to discover signatures (or models of chronicles) from a discrete event sequence (alarms) generated by a monitoring cognitive agent (MCA). When the counting process of the events generated by a couple (process, MCA) behaves like a Poisson process, this couple can be considered as stochastic discrete event generator SDEG(pr, MCA) and modeled as a superposition of Poisson and an homogeneous discrete time Markov chain. The 'BJT' algorithm uses these two representations in order to help in the discovering of signatures. The results obtained on an industrial process monitored with a Sachem system have been validated by experts, confirming so the relevance of the approach within an industrial frame.

Published in:

Hybrid Intelligent Systems, 2004. HIS '04. Fourth International Conference on

Date of Conference:

5-8 Dec. 2004