Jay Pujara
Sameer Singh
ABSTRACT
Knowledge graphs have become an increasingly crucial component in machine intelligence systems, powering ubiquitous digital assistants and inspiring several large scale academic projects across the globe. Our tutorial explains why knowledge graphs are important, how knowledge graphs are constructed, and where new research opportunities exist for improving the state-of-the-art. In this tutorial, we cover the many sophisticated approaches that complete and correct knowledge graphs. We organize this exploration into two main classes of models. The first include probabilistic logical frameworks that use graphical models, random walks, or statistical rule mining to construct knowledge graphs. The second class of models includes latent space models such as matrix and tensor factorization and neural networks. We conclude the tutorial with a critical comparison of techniques and results. We will offer practical advice for novices to identify common empirical challenges and concrete data sets for initial experimentation. Finally, we will highlight promising areas of current and future work.
- A. Bordes, N. Usunier, A. García-Durán, J. Weston, and O. Yakhnenko. Translating embeddings for modeling multi-relational data. In NIPS, 2013. Google Scholar
Digital Library
- K.-W. Chang, W. tau Yih, B. Yang, and C. Meek. Typed tensor decomposition of knowledge bases for relation extraction. In EMNLP, 2014.Google ScholarCross Ref
- N. Lao, T. M. Mitchell, and W. W. Cohen. Random walk inference and learning in a large scale knowledge base. In EMNLP, 2011. Google ScholarDigital Library
- Y. Lin, Z. Liu, H.-B. Luan, M. Sun, S. Rao, and S. Liu. Modeling relation paths for representation learning of knowledge bases. In EMNLP, 2015.Google ScholarCross Ref
- Y. Lin, Z. Liu, M. Sun, Y. Liu, and X. Zhu. Learning entity and relation embeddings for knowledge graph completion. In AAAI, 2015. Google ScholarDigital Library
- M. Nimishakavi, U. S. Saini, and P. Talukdar. Relation schema induction using tensor factorization with side information. CoRR, abs/1605.04227, 2016.Google Scholar
- J. Pujara, H. Miao, L. Getoor, and W. W. Cohen. Knowledge graph identification. In SEMWEB, 2013. Google ScholarDigital Library
- M. Richardson and P. M. Domingos. Markov logic networks. Machine Learning, 62:107--136, 2006. Google ScholarDigital Library
- S. Riedel, L. Yao, A. McCallum, and B. M. Marlin. Relation extraction with matrix factorization and universal schemas. In NAACL, 2013.Google Scholar
- W. Y. Wang, K. Mazaitis, and W. W. Cohen. Programming with personalized pagerank: a locally groundable first-order probabilistic logic. In CIKM, 2013. Google ScholarDigital Library
- Z. Wang, J. Zhang, J. Feng, and Z. Chen. Knowledge graph embedding by translating on hyperplanes. In AAAI, 2014. Google ScholarDigital Library
Recommendations
Knowledge Graphs: Opportunities and Challenges
AbstractWith the explosive growth of artificial intelligence (AI) and big data, it has become vitally important to organize and represent the enormous volume of knowledge appropriately. As graph data, knowledge graphs accumulate and convey knowledge of ...
Knowledge vault: a web-scale approach to probabilistic knowledge fusion
KDD '14: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data miningRecent years have witnessed a proliferation of large-scale knowledge bases, including Wikipedia, Freebase, YAGO, Microsoft's Satori, and Google's Knowledge Graph. To increase the scale even further, we need to explore automatic methods for constructing ...
A retrospective of knowledge graphs
Information on the Internet is fragmented and presented in different data sources, which makes automatic knowledge harvesting and understanding formidable for machines, and even for humans. Knowledge graphs have become prevalent in both of industry and ...
Comments