Skip to main content

WPI: Markov Logic Network-Based Statistical Predicate Invention

  • Conference paper
  • First Online:
  • 718 Accesses

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

Abstract

Predicate Invention aims at discovering new emerging concepts in a logic theory. Since there is usually a combinatorial explosion of candidate concepts to be invented, only those that are really relevant should be selected, which cannot be done manually due to the huge number of candidates. While purely logical automatic approaches may be too rigid, statistical solutions provide more flexibility in assigning a degree of relevance to the various candidates in order to select the best ones. This paper proposes a new Statistical Relational Learning approach to Predicate Invention. It was implemented and tested on a traditional problem, yielding interesting results.

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

Buying options

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

Learn about institutional subscriptions

Notes

  1. 1.

    In a normal procedure, the learned theory is to be tested on the remaining example; however, for the purposes of this paper we are not interested in the predictive capabilities of the theories, so we skip this step.

References

  1. Craven, M., Slattery, S.: Relational learning with statistical predicate invention: better models for hypertext. Mach. Learn. 43(1/2), 97 (2001)

    Article  MATH  Google Scholar 

  2. Elidan, G., Friedman, N.: Learning hidden variable networks: the information bottleneck approach. J. Mach. Learn. Res. 6, 81–127 (2005)

    MathSciNet  MATH  Google Scholar 

  3. Esposito, F., Semeraro, G., Fanizzi, N., Ferilli, S.: Multistrategy theory revision: induction and abduction in inthelex. Mach. Learn. J. 38(1/2), 133–156 (2000)

    Article  MATH  Google Scholar 

  4. Kemp, C., Tenenbaum, J.B., Griffiths, T.L., Yamada, T., Ueda, N.: Learning systems of concepts with an infinite relational model. In: AAAI, pp. 381–388. AAAI Press (2006)

    Google Scholar 

  5. Kok, S., Domingos, P.: Toward statistical predicate invention. In: SRL2006: Open Problems in Statistical Relational Learning (2006)

    Google Scholar 

  6. Kok, S., Domingos, P.: Statistical predicate invention. In: Ghahramani, Z. (ed.) ICML of ACM International Conference Proceeding Series, vol. 227, pp. 433–440. ACM (2007)

    Google Scholar 

  7. Kramer, S.: Predicate invention: a comprehensive view. Technical report TR-95-32, Oesterreichisches Forschungsinstitut fuer Artificial Intelligence, Wien, Austria (1995)

    Google Scholar 

  8. Muggleton, S.: Predicate invention and utilization. J. Exp. Theor. Artif. Intell. 6(1), 121–130 (1994)

    Article  MATH  Google Scholar 

  9. Muggleton, S., Buntine, W.: Machine invention of first-order predicates by inverting resolution. In: MLC-88 (1988)

    Google Scholar 

  10. Niu, F., Ré, C., Doan, A., Shavlik, J.W.: Tuffy: scaling up statistical inference in markov logic networks using an RDBMS (2011). CoRR, abs/1104.3216

    Google Scholar 

  11. Perlich, C., Provost, F.: Aggregation-based feature invention and relational concept classes. In: Domingos, P., Faloutsos, C., Senator, T., Kargupta, H., Getoor, L. (eds.) Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-03), pp. 167–176. ACM Press, New York (2003)

    Chapter  Google Scholar 

  12. Popescul, A., Ungar, L.H.: Cluster-based concept invention for statistical relational learning. In: Kim, W., Kohavi, R., Gehrke, J., DuMouchel, W. (eds.) KDD, pp. 665–670. ACM (2004)

    Google Scholar 

  13. Semeraro, G., Esposito, F., Malerba, D., Fanizzi, N., Ferilli, S.: A logic framework for the incremental inductive synthesis of datalog theories. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS, vol. 1463, pp. 300–321. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  14. Silverstein, G., Pazzani, M.: Relational cliches: constraining constructive induction during relational learning. In: Proceedings of the Sixth International Workshop on Machine Learning. Kaufmann, Los Altos (1989)

    Google Scholar 

  15. Srinivasan, A., Muggleton, S., Bain, M.: Distinguishing exceptions from noise in non monotonic learning. In: Rouveirol, C. (ed.) Proceedings of the ECAI-92 Workshop on Logical Approaches to Machine Learning (1992)

    Google Scholar 

  16. Wogulis, J., Langley, P.: Improving efficiency by learning intermediate concepts. In: Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pp. 657–662. Morgan Kaufmann, Detroit (1989)

    Google Scholar 

Download references

Acknowledgments

This work was partially funded by the Italian PON 2007–2013 project PON02\(_{-}\)00563\(_{-}\)3489339 ‘Puglia@Service’.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stefano Ferilli .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Ferilli, S., Fatiguso, G. (2015). WPI: Markov Logic Network-Based Statistical Predicate Invention. In: Esposito, F., Pivert, O., Hacid, MS., Rás, Z., Ferilli, S. (eds) Foundations of Intelligent Systems. ISMIS 2015. Lecture Notes in Computer Science(), vol 9384. Springer, Cham. https://doi.org/10.1007/978-3-319-25252-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25252-0_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25251-3

  • Online ISBN: 978-3-319-25252-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics