Skip to main content

Propositionalization of Relational Data

  • Chapter
  • First Online:
Representation Learning

Abstract

Relational learning addresses the task of learning models or patterns from relational data. Complementary to relational learning approaches that learn directly from relational data, developed in the Inductive Logic Programming research community, this chapter addresses the propositionalization approach of first transforming a relational database into a single-table representation, followed by a model or pattern construction step using a standard machine learning algorithm.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
eBook
USD 129.00
Price excludes VAT (USA)
Softcover Book
USD 169.99
Price excludes VAT (USA)
Hardcover Book
USD 169.99
Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://relational.fit.cvut.cz/.

  2. 2.

    https://pypi.org/project/python-rdm/.

  3. 3.

    https://python-rdm.readthedocs.io/en/latest/.

References

  • Chowdhury Farhan Ahmed, Nicolas Lachiche, Clément Charnay, Soufiane El Jelali, and Agnès Braud. Flexible propositionalization of continuous attributes in relational data mining. Expert Systems with Applications, 42 (21): 7698–7709, 2015.

    Google Scholar 

  • Ivan Bratko. Prolog Programming for Artificial Intelligence. Addison-Wesley, Wokingham, 2nd edition, 1990.

    Google Scholar 

  • Clément Charnay, Nicolas Lachiche, and Agnès Braud. CARAF: Complex aggregates within random forests. In Proceedings of the 25th International Conference on Inductive logic programming, pages 15–29, 2015.

    Google Scholar 

  • Peter Clark and Tim Niblett. The CN2 induction algorithm. Machine Learning, 3 (4): 261–283, 1989.

    Google Scholar 

  • Tirtharaj Dash, Ashwin Srinivasan, Lovekesh Vig, Oghenejokpeme I Orhobor, and Ross D King. Large-scale assessment of deep relational machines. In Proceedings of the International Conference on Inductive Logic Programming, pages 22–37, 2018.

    Google Scholar 

  • Sebastijan Dumančić, Tias Guns, Wannes Meert, and Hendrik Blockleel. Auto-encoding logic programs. In Proceedings of the International Conference on Machine Learning, 2018.

    Google Scholar 

  • Sašo Džeroski and Nada Lavrač, editors. Relational Data Mining. Springer, Berlin, 2001.

    Google Scholar 

  • Peter Flach and Nicholas Lachiche. 1BC: A first-order Bayesian classifier. In Proceedings of the 9th International Workshop on Inductive Logic Programming (ILP-99), pages 92–103. Springer, 1999.

    Google Scholar 

  • Peter Flach and Nicholas Lachiche. Confirmation-guided discovery of first-order rules with Tertius. Machine Learning, 42 (1/2): 61–95, 2001.

    Article  Google Scholar 

  • Lise Getoor. Introduction to Statistical Relational Learning. The MIT Press, 2007.

    Book  Google Scholar 

  • Arno J. Knobbe. Multi-Relational Data Mining, volume 145. IOS Press, 2005.

    Google Scholar 

  • Stefan Kramer, Bernhard Pfahringer, and Christoph Helma. Stochastic propositionalization of non-determinate background knowledge. In Proceedings of the 8th International Conference on Inductive Logic Programming (ILP-2000), pages 80–94, 2000.

    Google Scholar 

  • Stefan Kramer, Nada Lavrač, and Peter Flach. Propositionalization approaches to relational data mining. In Sašo Džeroski and Nada Lavrač, editors, Relational Data Mining, pages 262��291. Springer, 2001.

    Google Scholar 

  • Mark A. Krogel and Stefan Wrobel. Transformation-based learning using multirelational aggregation. In Proceedings of International Conference on Inductive Logic Programming, pages 142–155. Springer, 2001.

    Google Scholar 

  • Mark A. Krogel, Simon Rawles, Filip Železný, Peter Flach, Nada Lavrač, and Stefan Wrobel. Comparative evaluation of approaches to propositionalization. In Proceedings of the 13th International Conference on Inductive Logic Programming (ILP-2003), pages 197–214, 2003.

    Google Scholar 

  • Ondřej Kuželka and Filip Železný. Block-wise construction of tree-like relational features with monotone reducibility and redundancy. Machine Learning, 83 (2): 163–192, 2011.

    Article  MathSciNet  Google Scholar 

  • Ondřej Kuželka and Filip Železný. HiFi: Tractable propositionalization through hierarchical feature construction. In Late Breaking Papers, the 18th International Conference on Inductive Logic Programming, pages 69–74, 2008.

    Google Scholar 

  • Nicolas Lachiche and Peter Flach. 1BC2: A true first-order Bayesian classifier. In Proceedings of Inductive Logic Programming, pages 133–148, 2003.

    Google Scholar 

  • Nada Lavrač and Sašo Džeroski. Inductive Logic Programming: Techniques and Applications. Ellis Horwood, 1994.

    MATH  Google Scholar 

  • Nada Lavrač and Peter Flach. An extended transformation approach to inductive logic programming. ACM Transactions on Computational Logic, 2 (4): 458–494, 2001.

    Article  Google Scholar 

  • Nada Lavrač, Sašo Džeroski, and Marko Grobelnik. Learning nonrecursive definitions of relations with LINUS. In Proceedings of the 5th European Working Session on Learning (EWSL-91), pages 265–281, 1991.

    Google Scholar 

  • Nada Lavrač, Blaž Škrlj, and Marko Robnik-Šikonja. Propositionalization and embeddings: Two sides of the same coin. Machine Learning, 109: 1465–1507, 2020.

    Article  MathSciNet  Google Scholar 

  • Huma Lodhi. Deep Relational Machines. In Proceedings of the International Conference on Neural Information Processing, pages 212–219, 2013.

    Google Scholar 

  • Donald Michie, Stephen H. Muggleton, David Page, and Ashwin Srinivasan. To the international computing community: A new East-West challenge. Technical report, Oxford University Computing laboratory, 1994.

    Google Scholar 

  • Stephen H. Muggleton, editor. Inductive Logic Programming. Academic Press, London, 1992.

    Google Scholar 

  • Stephen H. Muggleton. Inverse entailment and Progol. New Generation Computing, 13 (3–4): 245–286, 1995.

    Article  Google Scholar 

  • Fabian Pedregosa, Gaël Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, Peter Prettenhofer, Ron Weiss, Vincent Dubourg, Jake Vanderplas, Alexandre Passos, David Cournapeau, Matthieu Brucher, Matthieu Perrot, Edouard Duchesnay, and Gilles Louppe. Scikit-learn: Machine learning in Python. Journal of Machine Learning Research, 12: 2825–2830, 2011.

    MathSciNet  MATH  Google Scholar 

  • Matic Perovšek, Anže Vavpetič, Bojan Cestnik, and Nada Lavrač. A wordification approach to relational data mining. In Proceedings of the International Conference on Discovery Science, pages 141–154, 2013.

    Google Scholar 

  • Matic Perovšek, Anze Vavpetič, Janez Kranjc, Bojan Cestnik, and Nada Lavrač. Wordification: Propositionalization by unfolding relational data into bags of words. Expert Systems with Applications, 42 (17–18): 6442–6456, 2015.

    Article  Google Scholar 

  • J. Ross Quinlan. Learning logical definitions from relations. Machine Learning, 5: 239–266, 1990.

    Google Scholar 

  • Marco Tulio Ribeiro, Sameer Singh, and Carlos Guestrin. Why should I trust you?: Explaining the predictions of any classifier. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 1135–1144. ACM, 2016.

    Google Scholar 

  • Jorma Rissanen. A universal prior for integers and estimation by minimum description length. The Annals of Statistics, 11 (2): 416–431, 1983.

    Article  MathSciNet  Google Scholar 

  • Ashwin Srinivasan. The Aleph Manual. University of Oxford, 2007. Online. Accessed 26 October 2020. https://www.cs.ox.ac.uk/activities/programinduction/Aleph/.

  • Ashwin Srinivasan, Stephen H. Muggleton, Ross D. King, and Michael J. E. Sternberg. Mutagenesis: ILP experiments in a non-determinate biological domain. In Proceedings of the 4th International Workshop on Inductive Logic Programming, volume 237 of GMD-Studien, pages 217–232, 1994.

    Google Scholar 

  • Ashwin Srinivasan, Lovekesh Vig, and Michael Bain. Logical explanations for Deep Relational Machines using relevance information. Journal of Machine Learning Research, 20 (130): 1–47, 2019.

    MathSciNet  MATH  Google Scholar 

  • Stefan Van Der Walt, Chris Colbert, and Gaël Varoquaux. The NumPy array: A structure for efficient numerical computation. Computing in Science & Engineering, 13 (2): 22, 2011.

    Google Scholar 

  • Filip Železný and Nada Lavrač. Propositionalization-based relational subgroup discovery with RSD. Machine Learning, 62: 33–63, 2006.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Lavra��, N., Podpečan, V., Robnik-Šikonja, M. (2021). Propositionalization of Relational Data. In: Representation Learning. Springer, Cham. https://doi.org/10.1007/978-3-030-68817-2_4

Download citation

Publish with us

Policies and ethics