Advertisement

A Heuristic Approach to Handling Sequential Information in Incremental ILP

  • Stefano Ferilli
  • Floriana Esposito
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8249)

Abstract

When using Horn Clause Logic as a representation formalism, the use of uninterpreted predicates cannot fully account for the complexity of some domains. In particular, in Machine Learning frameworks based on Horn Clause Logic, purely syntactic generalization cannot be applied to these kinds of predicates, requiring specific problems to be addressed and tailored strategies and techniques to be introduced. Among others, outstanding examples are those of numeric, taxonomic or sequential information. This paper deals with the case of (multidimensional) sequential information.Coverage and generalization techniques are devised and presented, and their integration in an incremental ILP system is used to run experiments showing its performance.

Keywords

Heuristic Approach Inductive Logic Programming Event Association Smart Environment Sequential Relationship 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agrawal, R., Gunopulos, D., Leymann, F.: Mining process models from workflow logs. In: Schek, H.-J., Saltor, F., Ramos, I., Alonso, G. (eds.) EDBT 1998. LNCS, vol. 1377, pp. 469–483. Springer, Heidelberg (1998)Google Scholar
  2. 2.
    Anderson, C.R., Domingos, P., Weld, D.S.: Relational markov models and their application to adaptive web navigation. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2002), pp. 143–152. ACM Press (2002)Google Scholar
  3. 3.
    Bombini, G., Di Mauro, N., Esposito, F., Ferilli, S.: Incremental learning from positive examples. In: Atti del 24-esimo Convegno Italiano di Logica Computazionale 2009, CILC 2009 (2009)Google Scholar
  4. 4.
    Ceri, S., Gottlöb, G., Tanca, L.: Logic Programming and Databases. Springer, Heidelberg (1990)CrossRefGoogle Scholar
  5. 5.
    Cook, J.E., Wolf, A.L.: Discovering models of software processes from event-based data. Technical Report CU-CS-819-96, Department of Computer Science, University of Colorado (1996)Google Scholar
  6. 6.
    Esposito, F., Di Mauro, N., Basile, T.M.A., Ferilli, S.: Multi-dimensional relational sequence mining. Fundamenta Informaticae 89(1), 23–43 (2008)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Esposito, F., Semeraro, G., Fanizzi, N., Ferilli, S.: Multistrategy theory revision: Induction and abduction in inthelex. Machine Learning 38(1/2), 133–156 (2000)CrossRefzbMATHGoogle Scholar
  8. 8.
    Ferilli, S., Basile, T.M.A., Biba, M., Di Mauro, N., Esposito, F.: A general similarity framework for horn clause logic. Fundamenta Informaticæ 90(1-2), 43–46 (2009)zbMATHGoogle Scholar
  9. 9.
    Ferilli, S., De Carolis, B., Redavid, D.: Logic-based incremental process mining in smart environments. In: Ali, M., Bosse, T., Hindriks, K.V., Hoogendoorn, M., Jonker, C.M., Treur, J. (eds.) IEA/AIE 2013. LNCS, vol. 7906, pp. 392–401. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  10. 10.
    Ferilli, S., Esposito, F.: A logic framework for incremental learning of process models. Fundamenta Informaticae (to appear)Google Scholar
  11. 11.
    Gutmann, B., Kersting, K.: TildeCRF: Conditional random fields for logical sequences. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 174–185. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  12. 12.
    Herbst, J., Karagiannis, D.: An inductive approach to the acquisition and adaptation of workflow models. In: Proceedings of the IJCAI 1999 Workshop on Intelligent Workflow and Process Management: The New Frontier for AI in Business, pp. 52–57 (1999)Google Scholar
  13. 13.
    Jacobs, N.: Relational sequence learning and user modelling. PhD thesis, K.U.Leuven, Department of Computer Science, Faculty of Science (2004)Google Scholar
  14. 14.
    Kersting, K., De Raedt, L., Gutmann, B., Karwath, A., Landwehr, N.: Relational sequence learning. In: De Raedt, L., Frasconi, P., Kersting, K., Muggleton, S.H. (eds.) Probabilistic ILP 2007. LNCS (LNAI), vol. 4911, pp. 28–55. Springer, Heidelberg (2008)Google Scholar
  15. 15.
    Kersting, K., Raiko, T., Kramer, S., De Raedt, L.: Towards discovering structural signatures of protein folds based on logical hidden markov models. In: Pac. Symp. Biocomput., pp. 192–203 (2003)Google Scholar
  16. 16.
    Lee, S.D., De Raedt, L.: Constraint based mining of first order sequences in seqLog. In: Meo, R., Lanzi, P.L., Klemettinen, M. (eds.) Database Support for Data Mining Applications. LNCS (LNAI), vol. 2682, pp. 154–173. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  17. 17.
    Muggleton, S.: Inductive logic programming. New Generation Computing 8(4), 295–318 (1991)CrossRefzbMATHGoogle Scholar
  18. 18.
    van der Aalst, W.M.P.: The application of petri nets to workflow management. The Journal of Circuits, Systems and Computers 8, 21–66 (1998)CrossRefGoogle Scholar
  19. 19.
    Weijters, A.J.M.M., van der Aalst, W.M.P.: Rediscovering workflow models from event-based data. In: Proceedings of the 11th Dutch-Belgian Conference of Machine Learning (Benelearn 2001), pp. 93–100 (2001)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Stefano Ferilli
    • 1
    • 2
  • Floriana Esposito
    • 1
    • 2
  1. 1.Dipartimento di InformaticaUniversità di BariItaly
  2. 2.Centro Interdipartimentale per la Logica e sue ApplicazioniUniversità di BariItaly

Personalised recommendations