preprint · arXiv (Cornell University) · 2016
Probabilistic Knowledge Graph Construction
Dongwoo Kim, Lexing Xie, Cheng Soon Ong
Cited by 11Open access
Abstract
Knowledge graph construction consists of two tasks: extracting information from external resources (knowledge population) and inferring missing information through a statistical analysis on the extracted information (knowledge completion). In many cases, insufficient external resources in the knowledge population hinder the subsequent statistical inference. The gap between these two processes can be reduced by an incremental population approach. We propose a new probabilistic knowledge graph factorisation method that benefits from the path structure of existing knowledge (e.g. syllogism) and enables a common modelling approach to be used for both incremental population and knowledge completion tasks. More specifically, the probabilistic formulation allows us to develop an incremental population algorithm that trades off exploitation-exploration. Experiments on three benchmark datasets show that the balanced exploitation-exploration helps the incremental population, and the additional path structure helps to predict missing information in knowledge completion.
Cite this paper
Kim, D., Xie, L., & Ong, C. S. (2016). Probabilistic Knowledge Graph Construction. arXiv (Cornell University), 2257–2262. https://doi.org/10.1145/2983323.2983677
Kim, Dongwoo, et al. “Probabilistic Knowledge Graph Construction.” arXiv (Cornell University), 2016, pp. 2257–62, https://doi.org/10.1145/2983323.2983677.
Kim, Dongwoo, Lexing Xie, and Cheng Soon Ong. 2016. “Probabilistic Knowledge Graph Construction.” arXiv (Cornell University): 2257–62. https://doi.org/10.1145/2983323.2983677.
Kim, D., Xie, L. and Ong, C.S. (2016) ‘Probabilistic Knowledge Graph Construction’, arXiv (Cornell University), pp. 2257–2262. Available at: https://doi.org/10.1145/2983323.2983677.
@misc{kim2016probabilistic,
title = {{Probabilistic Knowledge Graph Construction}},
author = {Kim, Dongwoo and Xie, Lexing and Ong, Cheng Soon},
journal = {arXiv (Cornell University)},
pages = {2257--2262},
year = {2016},
doi = {10.1145/2983323.2983677}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Comparing Apples and Oranges: Taxonomy and Design of Pairwise Comparisons within Tabular Data
Po-Ming Law, Subhajit Das, Rahul C. Basole · CHI Conference on Human Factors in Computing Systems · 2019
Cited by 9
Incomplete Large-Dimensional Pairwise Comparison Matrices
Jana Krejčí · Studies in fuzziness and soft computing · 2018
Cited by 2
Non-pairwise Collaborative Filtering
Meng Jian, Chenlin Zhang, Tuo Wang et al. · Neural Processing Letters · 2023
Cited by 2
Resolution of Activity Scheduling Conflicts: Reverse Pairwise Comparison of In-Home and Out-of-Home Activities
Mehran Fasihozaman Langerudi, Ramin Shabanpour, Mahmoud Javanmardi et al. · Transportation Research Record Journal of the Transportation Research Board · 2016
Cited by 9
Pairwise semiregular properties on generalized pairwise regular-Lindelof spaces.
Zabidin Salleh, Adem Kılıçman · DergiPark (Istanbul University) · 2009
Cited by 0Open access
Lotka-Volterra pairwise modeling fails to capture diverse pairwise microbial interactions
Babak Momeni, Li Xie, Wenying Shou · eLife · 2017
Cited by 235Open access