Skip to main content
SpringerLink
Log in

Contrasting logical sequences in multi-relational learning

  • Regular Paper
  • Published:
Progress in Artificial Intelligence Aims and scope Submit manuscript

Abstract

In this paper, we present the BeamSouL sequence miner that finds sequences of logical atoms. This algorithm uses a levelwise hybrid search strategy to find a subset of contrasting logical sequences available in a SeqLog database. The hybrid search strategy runs an exhaustive search, in the first phase, followed by a beam search strategy. In the beam search phase, the algorithm uses the confidence metric to select the top k sequential patterns that will be specialized in the next level. Moreover, we develop a first-order logic classification framework that uses predicate invention technique to include the BeamSouL findings in the learning process. We evaluate the performance of our proposals using four multi-relational databases. The results are promising, and the BeamSouL algorithm can be more than one order of magnitude faster than the baseline and can find long and highly discriminative contrasting sequences.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. http://lisp.vse.cz/challenge/.

References

  1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487–499. Morgan Kaufmann, Santiago de Chile (1994)

  2. Agrawal, R., Srikant, R.: Mining sequential patterns. In: Eleventh International Conference on Data Engineering, Taipei, Taiwan, pp. 3–14 (1995)

  3. Amo, S.D., Furtado, D.A.: First-order temporal pattern mining with regular expression constraints. Data Knowl. Eng. 62(3), 401–420 (2007). including special issue: 20th Brazilian Symposium on Databases (SBBD 2005)

    Article  Google Scholar 

  4. Bayardo, J., Roberto, J.: Efficiently mining long patterns from databases. SIGMOD Rec. 27(2), 85–93 (1998). https://doi.org/10.1145/276305.276313

    Article  Google Scholar 

  5. Blockeel, H., Sebag, M.: Scalability and efficiency in multi-relational data mining. SIGKDD Explor. 5(1), 17–30 (2003)

    Article  Google Scholar 

  6. Ceri, S., Gottlob, G., Tanca, L.: What you always wanted to know about datalog (and never dared to ask). IEEE Trans. Knowl. Data Eng. 1(1), 146–166 (1989)

    Article  Google Scholar 

  7. Dan Lee, S., 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: Discovering Knowledge with Inductive Queries. LNCS, vol. 2682, pp. 154–173. Springer, Berlin (2004)

    Chapter  Google Scholar 

  8. De Raedt, L.: Logical and Relational Learning. Cognitive Technologies. Springer, Berlin (2008)

    Book  Google Scholar 

  9. Deng, K., Zaïane, O.R.: Contrasting sequence groups by emerging sequences. In: Gama, J., Santos Costa, V., Jorge, A.M., Brazdil, P. (eds.) Discovery Science. Lecture Notes in Computer Science, vol. 5808, pp. 377–384. Springer, Berlin (2009)

    Chapter  Google Scholar 

  10. Di Mauro, N., Basile, T., Ferilli, S., Esposito, F.: Feature construction for relational sequence learning. CoRR arXiv:1006.5188 (2010)

  11. Esposito, F., Di Mauro, N., Basile, T.M.A., Ferilli, S.: Multi-dimensional relational sequence mining. Fundam. Inform. 89(1), 23–43 (2009)

    MATH  Google Scholar 

  12. Ferreira, C.A., Gama, J., Costa, V.S.: Predictive sequence miner in ilp learning. In: Proceedings of the 21st Inductive Logic Programming Conference. Lecture Notes in Computer Science, pp. 130–144. Springer, Windsor Great Park (2012)

  13. Ferreira, C.A., Gama, J., Costa, V.S.: Exploring multi-relational temporal databases with a propositional sequence miner. Prog. AI 4(1–2), 11–20 (2015). https://doi.org/10.1007/s13748-015-0065-x

    Article  Google Scholar 

  14. Fürnkranz, J.: Round robin classification. J. Mach. Learn. Res. 2, 721–747 (2002)

    MathSciNet  MATH  Google Scholar 

  15. Han, J., Kamber, M., Pei, J.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers Inc., San Francisco, CA (2011)

    MATH  Google Scholar 

  16. Kersting, K., De Raedt, L., Raiko, T.: Logical hidden Markov models. J. Artif. Intell. Res. (JAIR) 25, 425–456 (2006)

    Article  MathSciNet  Google Scholar 

  17. Kramer, S., De Raedt, L., Helma, C.: Molecular feature mining in HIV data. In: Lee, D., Schkolnick, M., Provost, F.J., Srikant, R. (eds.) KDD, pp. 136–143. ACM, New York (2001)

  18. Lesh, N., Zaki, M.J., Ogihara, M.: Mining features for sequence classification (1999)

  19. Muggleton, S., Raedt, L.D.: Inductive logic programming: theory and methods. J. Log. Program. 19, 629–679 (1994)

    Article  MathSciNet  Google Scholar 

  20. Nica, C., Braud, A., Dolques, X., Huchard, M., Le Ber, F.: Extracting hierarchies of closed partially-ordered patterns using relational concept analysis. In: Haemmerlé, O., Stapleton, G., Faron-Zucker, C. (eds.) ICCS: International Conference on Conceptual Structures. Graph-Based Representation and Reasoning, vol. 9717, pp. 17–30. Springer, Annecy (2016). https://doi.org/10.1007/978-3-319-40985-6_2. https://hal.archives-ouvertes.fr/hal-01380407

  21. Novak, P.K., Lavrač, N., Webb, G.I.: Supervised descriptive rule discovery: a unifying survey of contrast set, emerging pattern and subgroup mining. J. Mach. Learn. Res. 10, 377–403 (2009)

    MATH  Google Scholar 

  22. Ohara, K., Yoshida, T., Geamsakul, W., Motoda, H., Washio, T., Yokoi, H., Takabayashi, K.: Analysis of hepatitis dataset by decision tree graph-based induction (2004). https://dblp.org/rec/bibtex/conf/jsai/GeamsakulMYOMWYT04

  23. Srikant, R., Agrawal, R.: Mining sequential patterns: generalizations and performance improvements. In: 5th International Conference on Extending Database Technology, LNCS, vol. 1057, pp. 3–17. Springer, London (1996)

  24. Srinivasan, A.: The Aleph manual. http://www.comlab.ox.ac.uk/activities/machinelearning/Aleph/aleph.html (2003). Accessed 5 May 2014

  25. Stahl, I.: Predicate invention in inductive logic programming. In: De Raedt, L. (ed.) Advances in Inductive Logic Programming, pp. 34–47. IOS Press, Amsterdam (1996)

    Google Scholar 

  26. Yan, X., Han, J., Afshar, R.: Clospan: mining closed sequential patterns in large datasets. In: Proceedings of the Third SIAM International Conference on Data Mining, pp. 166–177. SIAM, San Francisco, CA (2003)

  27. Zaki, M.J.: Sequence mining in categorical domains: incorporating constraints. In: CIKM, pp. 422–429 (2000)

Download references

Acknowledgements

This work is supported by the NanoSTIMA Project: Macro-to-Nano Human Sensing: Towards Integrated Multimodal Health Monitoring and Analytics/NORTE-01-0145-FEDER-000016 which is financed by the North Portugal Regional Operational Programme (NORTE 2020), under the PORTUGAL 2020 Partnership Agreement, and through the European Regional Development Fund (ERDF).

Author information

Authors and Affiliations

  1. School of Engineering, Polytechnic of Porto, Rua Dr. António Bernardino de Almeida, 431, 4200-072, Porto, Portugal

    Carlos Abreu Ferreira

  2. LIAAD - INESC TEC LA, Rua Dr. Roberto Frias, 378, 4200-465, Porto, Portugal

    João Gama

  3. CRACS - INESC TEC LA, Rua do Campo Alegre, 1021-1055, 4169-007, Porto, Portugal

    Vítor Santos Costa

Authors
  1. Carlos Abreu Ferreira
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. João Gama
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vítor Santos Costa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Carlos Abreu Ferreira.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendix: additional results

Appendix: additional results

Table 3 Run-time of the ConFOLding framework (in seconds)
Full size table
Table 4 Peak memory usage of the ConFOLding framework
Full size table
Table 5 Generalization accuracy of the propositional ConFOLding framework
Full size table

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Abreu Ferreira, C., Gama, J. & Santos Costa, V. Contrasting logical sequences in multi-relational learning. Prog Artif Intell 8, 487–503 (2019). https://doi.org/10.1007/s13748-019-00188-w

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13748-019-00188-w

Keywords

Search

Navigation