Learning complex event descriptions by abstraction

  • Authors:
  • Ugo Galassi;Attilio Giordana;Lorenza Saitta;Marco Botta

  • Affiliations:
  • Universitá Amedeo Avogadro, Dipartimento di Informatica, Alessandria, Italy;Universitá Amedeo Avogadro, Dipartimento di Informatica, Alessandria, Italy;Universitá Amedeo Avogadro, Dipartimento di Informatica, Alessandria, Italy;Universitá di Torino, Dipartimento di Informatica, Torino, Italy

  • Venue:
  • IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The presence of long gaps dramatically increases the difficulty of detecting and characterizing complex events hidden in long sequences. In order to cope with this problem, a learning algorithm based on an abstraction mechanism is proposed: it can infer a Hierarchical Hidden Markov Model, from a learning set of sequences. The induction algorithm proceeds bottom-up, progressively coarsening the sequence granularity, and letting correlations between subsequences, separated by long gaps, naturally emerge. As a case study, the method is evaluated on an application of user profiling. The results show that the proposed algorithm is suitable for developing real applications in network security and monitoring.