Optimizing probabilistic models for relational sequence learning

  • Authors:
  • Nicola Di Mauro;Teresa M. A. Basile;Stefano Ferilli;Floriana Esposito

  • Affiliations:
  • Department of Computer Science, LACAM laboratory, University of Bari "Aldo Moro", Bari, Italy;Department of Computer Science, LACAM laboratory, University of Bari "Aldo Moro", Bari, Italy;Department of Computer Science, LACAM laboratory, University of Bari "Aldo Moro", Bari, Italy;Department of Computer Science, LACAM laboratory, University of Bari "Aldo Moro", Bari, Italy

  • Venue:
  • ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper tackles the problem of relational sequence learning selecting relevant features elicited from a set of labelled sequences. Each relational sequence is firstly mapped into a feature vector using the result of a feature construction method. The second step finds an optimal subset of the constructed features that leads to high classification accuracy, by adopting a wrapper approach that uses a stochastic local search algorithm embedding a Bayes classifier. The performance of the proposed method on a real-world dataset shows an improvement compared to other sequential statistical relational methods, such as Logical Hidden Markov Models and relational Conditional Random Fields.