Skip to main content

A Probabilistic Inference Based Approach for Querying Associative Entities in Knowledge Graph

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 12859))

Abstract

Querying associative entities is to provide top ranked entities in knowledge graph (KG). Many entities are not linked explicitly in KG but actually associated when incorporating outside user-generated data, which could enrich entity associations for the query processing of KG. In this paper, we leverage user-entity interactions (called user-entity data) to improve the accuracy of querying associative entities in KG. Upon the association rules obtained from user-entity data, we construct the association entity Bayesian network (AEBN), which facilitates the representation and inference of the dependencies among entities. Consequently, we formulate the problem of querying associative entities as the probabilistic inferences over AEBN. To rank the associative entities, we propose the approximate method to evaluate the association degree between entities. Extensive experiments on various datasets verify the effectiveness and efficiency of our method. Experimental results show that our proposed method outperforms some state-of-the-art competitors.

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

    https://www.w3.org/TR/rdf-sparql-query/.

  2. 2.

    https://tianchi.aliyun.com/dataset/dataDetail?dataId=649&userId=1.

References

  1. Cao, X., Shi, C., Zheng, Y., Ding, J., Li, X., Wu, B.: A heterogeneous information network method for entity set expansion in knowledge graph. In: Phung, D., Tseng, V.S., Webb, G.I., Ho, B., Ganji, M., Rashidi, L. (eds.) PAKDD 2018. LNCS (LNAI), vol. 10938, pp. 288–299. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-93037-4_23

    Chapter  Google Scholar 

  2. Galárraga, L.A., Teflioudi, C., Hose, K., Suchanek, F.: Amie: association rule mining under incomplete evidence in ontological knowledge bases. In: Proceedings of the 22nd International World Wide Web Conference, pp. 413–422 (2013)

    Google Scholar 

  3. Gu, Y., Zhou, T., Cheng, G., Li, Z., Pan, J.Z., Qu, Y.: Relevance search over schema-rich knowledge graphs. In: Proceedings of the 12th ACM International Conference on Web Search and Data Mining, pp. 114–122 (2019)

    Google Scholar 

  4. Han, J., Kamber, M., Pei, J.: Data Mining: Concepts and Techniques, 3rd edn. Morgan Kaufmann, San Francisco (2011)

    MATH  Google Scholar 

  5. Harper, F.M., Konstan, J.A.: The movielens datasets: History and context. ACM Trans. Interact. Intell. Syst. 5(4), 1–19 (2015)

    Article  Google Scholar 

  6. He, G., Li, J., Zhao, W.X., Liu, P., Wen, J.R.: Mining implicit entity preference from user-item interaction data for knowledge graph completion via adversarial learning. In: Proceedings of the 29nd International World Wide Web Conference, pp. 740–751 (2020)

    Google Scholar 

  7. Jayaram, N., Khan, A., Li, C., Yan, X., Elmasri, R.: Querying knowledge graphs by example entity tuples. IEEE Trans. Knowl. Data Eng. 27(10), 2797–2811 (2015)

    Article  Google Scholar 

  8. Jin, J., Luo, J., Samamon, K., Dong, F., Gao, L.: GStar: an efficient framework for answering top-k star queries on billion-node knowledge graphs. World Wide Web: Internet Web Inf. Syst. 22(4), 1611–1638 (2019). https://doi.org/10.1007/s11280-018-0611-0

    Article  Google Scholar 

  9. Koller, D., Friedman, N.: Probabilistic Graphical Models - Principles and Techniques. MIT Press, Cambridge (2009)

    MATH  Google Scholar 

  10. Li, G., Chen, Q., Zheng, B., Zhao, X.: Reverse top-k query on uncertain preference. In: Cai, Y., Ishikawa, Y., Xu, J. (eds.) APWeb-WAIM 2018. LNCS, vol. 10988, pp. 350–358. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-96893-3_26

    Chapter  Google Scholar 

  11. Li, L., Yue, K., Zhang, B., Sun, Z.: A probabilistic approach for inferring latent entity associations in textual web contents. In: Li, G., Yang, J., Gama, J., Natwichai, J., Tong, Y. (eds.) DASFAA 2019. LNCS, vol. 11448, pp. 3–18. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-18590-9_1

    Chapter  Google Scholar 

  12. Ponza, M., Ferragina, P., Chakrabarti, S.: On computing entity relatedness in wikipedia, with applications. Knowl.-Based Syst. 188, 105051 (2020)

    Article  Google Scholar 

  13. Poole, D.: Probabilistic horn abduction and Bayesian networks. Artif. Intell. 64(1), 81–129 (1993)

    Article  Google Scholar 

  14. Ren, H., Hu, W., Leskovec, J.: Query2box: reasoning over knowledge graphs in vector space using box embeddings. In: Proceedings of the 8th International Conference on Learning Representations (2020)

    Google Scholar 

  15. Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Prentice Hall Press, Hoboken (2009)

    MATH  Google Scholar 

  16. Shi, B., Weninger, T.: Open-world knowledge graph completion. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence, pp. 1957–1964 (2018)

    Google Scholar 

  17. Sun, S., Luo, Q.: Scaling up subgraph query processing with efficient subgraph matching. In: Proceedings of the 35th International Conference on Data Engineering, pp. 220–231 (2019)

    Google Scholar 

  18. Wang, H., Zhao, M., Xie, X., Li, W., Guo, M.: Knowledge graph convolutional networks for recommender systems. In: Proceedings of the 28th World Wide Web Conference, pp. 3307–3313 (2019)

    Google Scholar 

  19. Wei, Z., Zhao, J., Liu, K., Qi, Z., Sun, Z., Tian, G.: Large-scale knowledge base completion: inferring via grounding network sampling over selected instances. In: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, pp. 1331–1340 (2015)

    Google Scholar 

  20. Wu, T., et al.: Knowledge graph construction from multiple online encyclopedias. World Wide Web 23(5), 2671–2698 (2019). https://doi.org/10.1007/s11280-019-00719-4

    Article  Google Scholar 

  21. Yang, Y., Agrawal, D., Jagadish, H., Tung, A.K., Wu, S.: An efficient parallel keyword search engine on knowledge graphs. In: Proceedings of the 35th International Conference on Data Engineering, pp. 338–349 (2019)

    Google Scholar 

  22. Zhang, A., Wang, J., Li, J., Gao, H.: Aggregate query processing on incomplete data. In: Cai, Y., Ishikawa, Y., Xu, J. (eds.) APWeb-WAIM 2018. LNCS, vol. 10987, pp. 286–294. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-96890-2_24

    Chapter  Google Scholar 

  23. Zhang, R., Mao, Y., Zhao, W.: Knowledge graphs completion via probabilistic reasoning. Inf. Sci. 521, 144–159 (2020)

    Article  MathSciNet  Google Scholar 

  24. Zheng, W., Zou, L., Peng, W., Yan, X., Song, S., Zhao, D.: Semantic SPARQL similarity search over RDF knowledge graphs. Proc. VLDB Endow. 9(11), 840–851 (2016)

    Article  Google Scholar 

Download references

Acknowledgements

This paper was supported by the National Natural Science Foundation of China (U1802271, 62002311), Major Project of Science and Technology of Yunnan Province (202002AD080002), Science Foundation for Distinguished Young Scholars of Yunnan Province (2019FJ011), China Postdoctoral Science Foundation (2020M673310), and Program of Donglu Scholars of Yunnan University.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kun Yue .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, J., Yue, K., Li, J., Duan, L. (2021). A Probabilistic Inference Based Approach for Querying Associative Entities in Knowledge Graph. In: U, L.H., Spaniol, M., Sakurai, Y., Chen, J. (eds) Web and Big Data. APWeb-WAIM 2021. Lecture Notes in Computer Science(), vol 12859. Springer, Cham. https://doi.org/10.1007/978-3-030-85899-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-85899-5_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-85898-8

  • Online ISBN: 978-3-030-85899-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics