Skip to main content

Exploiting Propositionalization Based on Random Relational Rules for Semi-supervised Learning

  • Conference paper
Book cover Advances in Knowledge Discovery and Data Mining (PAKDD 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5012))

Included in the following conference series:

Abstract

In this paper we investigate an approach to semi-supervised learning based on randomized propositionalization, which allows for applying standard propositional classification algorithms like support vector machines to multi-relational data. Randomization based on random relational rules can work both with and without a class attribute and can therefore be applied simultaneously to both the labeled and the unlabeled portion of the data present in semi-supervised learning.

An empirical investigation compares semi-supervised propositionalization to standard propositionalization using just the labeled data portion, as well as to a variant that also just uses the labeled data portion but includes the label information in an attempt to improve the resulting propositionalization. Preliminary experimental results indicate that propositionalization generated on the full dataset, i.e. the semi- supervised approach, tends to outperform the other two more standard approaches.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anderson, G., Pfahringer, B.: Clustering Relational Data based on Randomized Propositionalization. In: Proceedings International Conference on Inductive Logic Programming 2007 (ILP 2007). Springer, Heidelberg (2007)

    Google Scholar 

  2. Breiman, L.: Random Forests. Machine Learning 45(1), 5–32 (2001)

    Article  MATH  Google Scholar 

  3. de Castro Dutra, I., Page, D., Santos Costa, V., Shavlik, J.: An Empirical Evaluation of Bagging in Inductive Logic Programming. In: Matwin, S., Sammut, C. (eds.) ILP 2002. LNCS (LNAI), vol. 2583. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Chapelle, O., Schölkopf, B., Zien, A.: Semi-Supervised Learning. MIT Press, Cambridge (2006)

    Google Scholar 

  5. Dietterich, T., Lathrop, R., Lozano-Perez, T.: Solving the multiple-instance problem with axis-parallel rectangles. Artificial Intelligence 89, 31–71 (1997)

    Article  MATH  Google Scholar 

  6. Džeroski, S., Schulze-Kremer, S., Heidtke, K.R., Siems, K., Wettschereck, D.: Applying ILP to Diterpene Structure Elucidation from 13C NMR Spectra. In: Proc. 6th Int. Workshop on Inductive Logic Programming, pp. 41–54 (1996)

    Google Scholar 

  7. Freund, Y., Mason, L.: The Alternating Decision Tree Learning Algorithm. In: Proceedings of the Sixteenth International Conference on Machine Learning (ICML 1999). Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  8. Giordana, A., Saitta, L.: Phase Transitions in Relational Learning. Machine Learning 41(2), 217–251 (2000)

    Article  MATH  Google Scholar 

  9. Horváth, T., Wrobel, S., Bohnebeck, U.: Relational Instance-Based Learning with Lists and Terms. Machine Learning 43, 53–80 (2001)

    Article  MATH  Google Scholar 

  10. King, R.D., Srinivasan, A., Dehaspe, L.: Warmr: A Data Mining Tool for Chemical Data. Journal of Computer Aided Molecular Design 15, 173–181 (2001)

    Article  Google Scholar 

  11. Kleinberg, E.M.: On the Algorithmic Implementation of Stochastic Discrimination. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(5), 473–490 (2000)

    Article  Google Scholar 

  12. Kramer, S., Lavrac, N., Flach, P.: Propositionalization Approaches to Relational Data Mining. Relational Data Mining. Springer, Heidelberg (2001)

    Google Scholar 

  13. Krogel, S., Scheffer, T.: Multi-Relational Learning, Text Mining, and Semi-Supervised Learning for Functional Genomics. Machine Learning 57, 61–81 (2004)

    Article  MATH  Google Scholar 

  14. Muggleton, S.: Inverse entailment and Progol. New Generation Computing, Special issue on Inductive Logic Programming 13(3-4), 245–286 (1995)

    Google Scholar 

  15. Pfahringer, B., Leschi, C., Reutemann, P.: Scaling Up Semi-supervised Learning: An Efficient and Effective LLGC Variant. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4426, pp. 236–247. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  16. Platt, J.: Machines using Sequential Minimal Optimization. In: Schoelkopf, B., Burges, C., Smola, A. (eds.) Advances in Kernel Methods - Support Vector Learning. MIT Press, Cambridge (1998)

    Google Scholar 

  17. Ping, L., Zhe, W., Chunguang, Z.: A Spectrum-Based Support Vector Algorithm for Relational Data Semi-supervised Classification. In: Proceedings of the 13th International Conference on Neural Information Processing, pp. 801–810 (2006)

    Google Scholar 

  18. Quinlan, J.R.: Learning logical definitions from relations. Machine Learning 5, 239–266 (1990)

    Google Scholar 

  19. Srinivasan, A., Muggleton, S., King, R.D., Sternberg, M.J.E.: Mutagenesis: ILP experiments in a non-determinate biological domain. In: Proceedings of the Fourth Inductive Logic Programming Workshop (1994)

    Google Scholar 

  20. Srinivasan, A., Muggleton, S., King, R.D., Sternberg, M.J.E.: Carcinogenesis Predictions Using ILP. In: Proceedings of the 7th International Workshop on Inductive Logic Programming (1997), pp. 273–887 (1994)

    Google Scholar 

  21. Woźnica, A., Kalousis, A., Hilario, M.: Kernels over Relational Algebra Structures. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 588–598. Springer, Heidelberg (2005)

    Google Scholar 

  22. Zelezny, F., Lavrac, N.: Propositionalization-Based Relational Subgroup Discovery with RSD. Machine Learning 62(1-2), 33–63 (2006)

    Article  Google Scholar 

  23. Zhou, D., Huang, J., Schölkopf, B.: Learning from labeled and unlabeled data on a directed graph. In: Proc. of the 22nd International Conference on Machine Learning (ICML 2005), Bonn, Germany, August 2005, pp. 1041–1048 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Takashi Washio Einoshin Suzuki Kai Ming Ting Akihiro Inokuchi

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Anderson, G., Pfahringer, B. (2008). Exploiting Propositionalization Based on Random Relational Rules for Semi-supervised Learning. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2008. Lecture Notes in Computer Science(), vol 5012. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68125-0_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68125-0_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68124-3

  • Online ISBN: 978-3-540-68125-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics