Skip to main content

Reframing on Relational Data

  • Conference paper
  • First Online:
Inductive Logic Programming

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

  • 454 Accesses

Abstract

Construction of aggregates is a crucial task to discover knowledge from relational data and hence becomes a very important research issue in relational data mining. However, in a real-life scenario, dataset shift may occur between the training and deployment environments. Therefore, adaptation of aggregates among several deployment contexts is a useful and challenging task. Unfortunately, the existing aggregate construction algorithms are not capable of tackling dataset shift. In this paper, we propose a new approach called reframing to handle dataset shift in relational data. The main objective of reframing is to build a model once and make it workable in many deployment contexts without retraining. We propose an efficient reframing algorithm to learn optimal shift parameter values using only a small amount of labelled data available in the deployment. The algorithm can deal with both simple and complex aggregates. Our experimental results demonstrate the efficiency and effectiveness of the proposed approach.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Notes

  1. 1.

    http://lisp.vse.cz/pkdd99/Challenge/chall.htm.

References

  1. Bache, K., Lichman, M.: UCI machine learning repository (2013) http://archive.ics.uci.edu/ml/

  2. Bickel, S., Brückner, M., Scheffer, T.: Discriminative learning under covariate shift. J. Mach. Learn. Res. 10, 2137–2155 (2009)

    MathSciNet  MATH  Google Scholar 

  3. Blockeel, H., De Raedt, L.: Top-down induction of first-order logical decision trees. Artif. Intell. 101(1–2), 285–297 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Charnay, C., Lachiche, N., Braud, A.: Incremental construction of complex aggregates: counting over a secondary table. In: Late Breaking Papers of the 23rd International Conference on Inductive Logic Programming (ILP), pp. 1–6 (2013)

    Google Scholar 

  5. Charnay, C., Lachiche, N., Braud, A.: Pairwise optimization of bayesian classifiers for multi-class cost-sensitive learning. In: Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pp. 499–505 (2013)

    Google Scholar 

  6. Davis, J., Domingos, P.: Deep transfer via second-order markov logic. In: Proceedings of the 26th Annual International Conference on Machine Learning (ICML), pp. 217–224 (2009)

    Google Scholar 

  7. Dzeroski, S.: Relational data mining. In: Maimon, O., Rokach, L. (eds.) Data Mining and Knowledge Discovery Handbook, pp. 887–911. Springer, New York (2010)

    Google Scholar 

  8. El Jelali, S., Braud, A., Lachiche, N.: Propositionalisation of continuous attributes beyond simple aggregation. In: Riguzzi, F., Železný, F. (eds.) ILP 2012. LNCS, vol. 7842, pp. 32–44. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  9. Fanaee-T, H., Gama, J.: Event labeling combining ensemble detectors and background knowledge. Prog. Artif. Intell. 2(2–3), 113–127 (2014)

    Article  Google Scholar 

  10. Gretton, A., Smola, A., Huang, J., Schmittfull, M., Borgwardt, K., Schölkopf, B.: Covariate shift by kernel mean matching. In: Dataset Shift in Machine Learning, pp. 131–160. MIT Press, Cambridge (2009)

    Google Scholar 

  11. Hernández-Orallo, J.: ROC curves for regression. Pattern Recogn. 46(12), 3395–3411 (2013)

    Article  MATH  Google Scholar 

  12. Krogel, M.-A., Wrobel, S.: Transformation-based learning using multirelational aggregation. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol. 2157, p. 142. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Lachiche, N.: Propositionalization. In: Sammut, C., Webb, G.I. (eds.) Encyclopedia of Machine Learning, pp. 812–817. Springer, New York (2010)

    Google Scholar 

  14. Moreno-Torres, J.G., Raeder, T., Alaíz-Rodríguez, R., Chawla, N.V., Herrera, F.: A unifying view on dataset shift in classification. Pattern Recogn. 45(1), 521–530 (2012)

    Article  Google Scholar 

  15. Moreno-Torres, J.G.: Dataset shift in classification: terminology, benchmarks and methods. Ph.D thesis (2013)

    Google Scholar 

  16. Moreno-Torres, J.G., Llorà, X., Goldberg, D.E., Bhargava, R.: Repairing fractures between data using genetic programming-based feature extraction: a case study in cancer diagnosis. Inf. Sci. 222, 805–823 (2013)

    Article  Google Scholar 

  17. Pan, S.J., Yang, Q.: A survey on transfer learning. IEEE Trans. Knowl. Data Eng. 22(10), 1345–1359 (2010)

    Article  Google Scholar 

  18. Sugiyama, M., Krauledat, M., Müller, K.R.: Covariate shift adaptation by importance weighted cross validation. J. Mach. Lear. Res. 8, 985–1005 (2007)

    MATH  Google Scholar 

  19. Van Assche, A., Vens, C., Blockeel, H., Dzeroski, S.: First order random forests: learning relational classifiers with complex aggregates. Mach. Learn. 64(1–3), 149–182 (2006)

    Article  MATH  Google Scholar 

  20. Vens, C., Ramon, J., Blockeel, H.: Refining aggregate conditions in relational learning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 383–394. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  21. Weise, T.: Global optimization algorithms -theory and application, Second Edition (2009)

    Google Scholar 

  22. Zhao, H., Sinha, A.P., Bansal, G.: An extended tuning method for cost-sensitive regression and forecasting. Decis. Support Syst. 51(3), 372–383 (2011)

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by the REFRAME project granted by the European Coordinated Research on Long-term Challenges in Information and Communication Sciences & Technologies ERA-Net (CHIST-ERA).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nicolas Lachiche .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Ahmed, C.F., Charnay, C., Lachiche, N., Braud, A. (2015). Reframing on Relational Data. In: Davis, J., Ramon, J. (eds) Inductive Logic Programming. Lecture Notes in Computer Science(), vol 9046. Springer, Cham. https://doi.org/10.1007/978-3-319-23708-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23708-4_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23707-7

  • Online ISBN: 978-3-319-23708-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics