A Probabilistic Algorithm to Predict Missing Facts from Knowledge Graphs.
André GonzagaMirella M. MoroMário S. AlvimPublished in: DEXA (1) (2019)
Keyphrases
- experimental evaluation
- knowledge base
- high accuracy
- learning algorithm
- probabilistic model
- computational cost
- spanning tree
- k means
- cost function
- optimization algorithm
- optimal solution
- search space
- detection algorithm
- objective function
- computational complexity
- preprocessing
- dynamic programming
- knowledge management
- expectation maximization
- missing data
- matching algorithm
- search algorithm
- knowledge representation
- worst case
- knowledge acquisition
- np hard
- significant improvement
- tree structure
- graph construction
- context free parsing