Skip to main content

A Probabilistic Soft Logic Reasoning Model with Automatic Rule Learning

  • Conference paper
  • First Online:
Big Data (BigData 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1120))

Included in the following conference series:

  • 1160 Accesses

Abstract

Probabilistic Soft Logic (PSL), as a declarative rule-based probability model, has strong extensibility and multi-domain adaptability and has been applied in many domains. In practice, a main difficult is that a lot of common sense and domain knowledge need to be set manually as preconditions for rule establishment, and the acquisition of these knowledge is often very expensive. To alleviate this dilemma, this paper has worked on two aspects: First, a rule automatic learning method was proposed, which combined AMIE+ algorithm and PSL to form a new reasoning model. Second, a multi-level method was used to improve the reasoning efficiency of the model. The experimental results showed that the proposed methods are feasible.

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

References

  1. Kimmig, A., Bach, S., Broecheler, M., et al.: A short introduction to probabilistic soft logic. In: Proceedings of the NIPS Workshop on Probabilistic Programming: Foundations and Applications, pp. 1–4 (2012)

    Google Scholar 

  2. Galárraga, L., Teflioudi, C., Hose, K., et al.: Fast rule mining in ontological knowledge bases with AMIE+. VLDB J.—Int. J. Very Large Data Bases 24(6), 707–730 (2015)

    Article  Google Scholar 

  3. Bach, S.H., Broecheler, M., Huang, B., et al.: Hinge-loss markov random fields and probabilistic soft logic. J. Mach. Learn. Res. 18(109), 1–67 (2017)

    MathSciNet  MATH  Google Scholar 

  4. Pellissier Tanon, T., Stepanova, D., Razniewski, S., Mirza, P., Weikum, G.: Completeness-aware rule learning from knowledge graphs. In: d’Amato, C., et al. (eds.) ISWC 2017. LNCS, vol. 10587, pp. 507–525. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68288-4_30

    Chapter  Google Scholar 

  5. Poon, H., Domingos, P.: Sum-product networks: a new deep architecture. In: 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops), pp. 689–690. IEEE (2011)

    Google Scholar 

  6. Huang, B., Kimmig, A., Getoor, L., et al.: A flexible framework for probabilistic models of social trust. In: Greenberg, A.M., Kennedy, W.G., Bos, N.D. (eds.) SBP 2013. LNCS, vol. 7812, pp. 265–273. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-37210-0_29

    Chapter  Google Scholar 

  7. Tomkins, S., Pujara, J., Getoor, L.: Disambiguating energy disaggregation: a collective probabilistic approach. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, pp. 2857–2863. AAAI Press (2017)

    Google Scholar 

  8. Sridhar, D., Fakhraei, S., Getoor, L.: A probabilistic approach for collective similarity-based drug–drug interaction prediction. Bioinformatics 32(20), 3175–3182 (2016)

    Article  Google Scholar 

  9. Pujara, J.: Probabilistic models for scalable knowledge graph construction. Doctoral dissertation, University of Maryland, College Park (2016)

    Google Scholar 

  10. Kouki, P., Pujara, J., Marcum, C., et al.: Collective entity resolution in multi-relational familial networks. Knowl. Inf. Syst., 1–35 (2018)

    Google Scholar 

  11. Farnadi, G., Babaki, B., Getoor, L.: Fairness-aware relational learning and inference. In: Workshops at the Thirty-Second AAAI Conference on Artificial Intelligence (2018)

    Google Scholar 

  12. Embar, V.R., Farnadi, G., Pujara, J., et al.: Aligning product categories using anchor products. In: First Workshop on Knowledge Base Construction, Reasoning and Mining (2018)

    Google Scholar 

  13. Srinivasan, S., Babaki, B., Farnadi, G., et al.: Lifted Hinge-Loss Markov Random Fields (2019)

    Google Scholar 

  14. Pujara, J., Augustine, E., Getoor, L.: Sparsity and noise: where knowledge graph embeddings fall short. In: Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, pp. 1751–1756 (2017)

    Google Scholar 

  15. Kouki, P., Pujara, J., Marcum, C., et al.: Collective entity resolution in familial networks. Under Review (2017)

    Google Scholar 

  16. Kinship dataset. https://archive.ics.uci.edu/ml/datasets/kinship. Accessed 27 Feb 2019

  17. YAGO2 dataset. http://resources.mpi-inf.mpg.de/yago-naga/amie/data/yago2/yago2core_facts.clean.notypes.tsv.7z. Accessed 27 Feb 2019

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hui Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, J., Zhang, H., Li, B., Yang, C., Zhao, X. (2019). A Probabilistic Soft Logic Reasoning Model with Automatic Rule Learning. In: Jin, H., Lin, X., Cheng, X., Shi, X., Xiao, N., Huang, Y. (eds) Big Data. BigData 2019. Communications in Computer and Information Science, vol 1120. Springer, Singapore. https://doi.org/10.1007/978-981-15-1899-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-1899-7_3

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-1898-0

  • Online ISBN: 978-981-15-1899-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics