loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fourth International Conference on Hybrid Intelligent Systems (HIS'04)
Discovering Operational Signatures with Time Constraints from a Discrete Event Sequence
Kitakyushu, Japan
December 05-December 08
ISBN: 0-7695-2291-2
ASCII Text
x 
 
Philippe Bouch?, Marc Le Goc, "Discovering Operational Signatures with Time Constraints from a Discrete Event Sequence," Hybrid Intelligent Systems, International Conference on, pp. 55-60, Fourth International Conference on Hybrid Intelligent Systems (HIS'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/ICHIS.2004.37,
author = {Philippe Bouch? and Marc Le Goc},
title = {Discovering Operational Signatures with Time Constraints from a Discrete Event Sequence},
journal ={Hybrid Intelligent Systems, International Conference on},
volume = {0},
year = {2004},
isbn = {0-7695-2291-2},
pages = {55-60},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICHIS.2004.37},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Hybrid Intelligent Systems, International Conference on
TI - Discovering Operational Signatures with Time Constraints from a Discrete Event Sequence
SN - 0-7695-2291-2
SP55
EP60
A1 - Philippe Bouch?,
A1 - Marc Le Goc,
PY - 2004
KW - null
VL - 0
JA - Hybrid Intelligent Systems, International Conference on
ER -
 
Philippe Bouch?, Domaine Universitaire St J?rome, France
Marc Le Goc, Domaine Universitaire St J?rome, France
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.
Citation:
Philippe Bouch?, Marc Le Goc, "Discovering Operational Signatures with Time Constraints from a Discrete Event Sequence," his, pp.55-60, Fourth International Conference on Hybrid Intelligent Systems (HIS'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.