Discovering Operational Signatures with Time Constraints from a Discrete Event Sequence

  • Authors:
  • Philippe Bouche;Marc Le Goc

  • Affiliations:
  • Domaine Universitaire St Jérome, France;Domaine Universitaire St Jérome, France

  • Venue:
  • HIS '04 Proceedings of the Fourth International Conference on Hybrid Intelligent Systems
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.