1 Introduction
Knowledge Graphs (KGs) provide structured representations of realworld entities and relations, which are categorized into the following two types: (i) Deterministic KGs, such as YAGO [Rebele et al.2016] and FreeBase [Bollacker et al.2008], consist of deterministic relation facts that describe semantic relations between entities; (ii) Uncertain KGs including ProBase [Wu et al.2012], ConceptNet [Speer, Chin, and Havasi2017] and NELL [Mitchell et al.2018] associate every relation fact with a confidence score that represents the likelihood of the relation fact to be true.
KG embedding models are essential tools for incorporating the structured knowledge representations in KGs into machine learning. These models encode entities as lowdimensional vectors and relations as algebraic operations among entity vectors. They accurately capture the similarity of entities and preserve the structure of KGs in the embedding space. Hence, they have been the crucial feature models that benefit numerous knowledgedriven tasks
[Bordes, Weston, and Usunier2014, He et al.2017, Das et al.2018]. Recently, extensive efforts have been devoted into embedding deterministic KGs. Translational models, e.g., TransE [Bordes et al.2013] and TransH [Wang et al.2014]), and bilinear models, e.g. DistMult [Yang et al.2015] and ComplEx [Trouillon et al.2016], have achieved promising performance in many tasks, such as link prediction [Yang et al.2015, Trouillon et al.2016], relation extraction [Weston, Bordes, and others2013], relational learning [Nickel et al.2016], and ontology population [Chen et al.2018].While current embedding models focus on capturing deterministic knowledge, it is critical to incorporate uncertainty information into knowledge sources for several reasons. First, uncertainty is the nature of many forms of knowledge. An example of naturally uncertain knowledge is the interactions between proteins. Since molecular reactions are random processes, biologists label the protein interactions with their probabilities of occurrence and present them as uncertain KGs called ProteinProtein Interaction (PPI) Networks. Second, uncertainty enhances inference in knowledgedriven applications. For example, short text understanding often entails interpreting realworld concepts that are ambiguous or intrinsically vague. The probabilistic KG Probase
[Wu et al.2012]provides a prior probability distribution of concepts behind a term that has critically supported short text understanding tasks involving disambiguation
[Wang et al.2015, Wang and Wang2016]. Furthermore, uncertain knowledge representations have largely benefited various applications, such as question answering [Yih et al.2013][Ratinov and Roth2009].Capturing the uncertainty information with KG embeddings remains an unresolved problem. This is a nontrivial task for several reasons. First, compared to deterministic KG embeddings, uncertain KG embeddings need to encode additional confidence information to preserve uncertainty. Second, current KG embedding models cannot capture the subtle uncertainty of unseen relation facts, as they assume that all the unseen relation facts are false beliefs and minimize the plausibility measures of relation facts. One major challenge of learning embeddings for uncertain KGs is to properly estimate the uncertainty of unseen relation facts.
To address the above issues, we propose a new embedding model UKGE (Uncertain Knowledge Graph Embeddings), which aims to preserve both structural and uncertainty information of relation facts in the embedding space. Embeddings of entities and relations on uncertain KGs are learned according to confidence scores. Unlike previous models that characterize relation facts with binary classification techniques, UKGE learns embeddings according to the confidence scores of uncertain relation facts. To further enhance the precision of UKGE, we also introduce probabilistic soft logic to infer the confidence score for unseen relation facts during training. We propose two variants of UKGE based on different embeddingbased confidence functions. We conducted extensive experiments using three realworld uncertain KGs on three tasks: (i) confidence prediction, which seeks to predict confidence scores of unseen relation facts; (ii) relation fact ranking, which focuses on retrieving tail entities for the query and ranking these retrieved tails in the right order; and (iii) relation fact classification, which decides whether or not a given relation fact is a strong relation fact. Our models consistently outperform the baseline models in these experiments.
The rest of the paper is organized as follows. We first review the related work in Section 2, then provide the problem definition and propose our model UKGE in the two sections that follow. In section 5, we present our experiments. Then we conclude the paper in Section 6.
2 Related Work
To the best of our knowledge, there has been no previous work on learning embeddings for uncertain KGs. We hereby discuss the following three lines of work that are closely related to this topic.
Deterministic Knowledge Graph Embeddings
Deterministic KG embeddings have been extensively explored by recent work. These models encode entities as lowdimensional vectors and relations as algebraic operations among entity vectors. There are two representative families of models, i.e. translational models and bilinear models.
Translational models share a common principle , where , are the entity embeddings projected in a relationspecific space. The forerunner of this family, TransE [Bordes et al.2013], lays and in a common space as and with regard to any relation . Variants of TransE, such as TransH [Wang et al.2014], TransR [Lin et al.2015], TransD [Ji et al.2015], and TransA, [Jia et al.2016] differentiate the translations of entity embeddings in different languagespecific embedded spaces based on different forms of relationspecific projections. Despite its simplicity, translational models achieve promising performance on knowledge completion and relation extraction tasks.
Bilinear models [Jenatton et al.2012] model relations as the secondorder correlations between entities, using the scoring function . This function is first adopted by RESCAL [Nickel, Tresp, and Kriegel2011], a collective matrix factorization model. DistMult [Yang et al.2015] constrains as a diagonal matrix which reduces the computing cost and also enhances the performance. ComplEx adjusts the corresponding scoring mechanism to a complex conjugation in a complex embedding space.
There are also other models for deterministic KG embedding, such as neural models like Neural Tensor Network (NTN)
[Socher et al.2013] and ConvE [Dettmers et al.2018], and the circularcorrelationbased model HolE [Nickel et al.2016].Uncertain Knowledge Graphs
Uncertain KGs provide a confidence score along with every relation fact. The development of relation extraction and crowdsourcing in recent years enabled the construction of largescale uncertain knowledge bases. ConceptNet [Speer, Chin, and Havasi2017] is a multilingual uncertain KG for commonsense knowledge that is collected via crowdsourcing. The confidence scores in ConceptNet mainly come from the cooccurrence frequency of the labels in crowdsourced task results. Probase [Wu et al.2012] is a universal probabilistic taxonomy built by relation extraction. Every fact in Probase is associated with a joint probability . NELL [Mitchell et al.2018]
collects relation facts by reading web pages and learns their confidence scores from semisupervised learning with the ExpectationMaximum (EM) algorithm. Aforementioned uncertain KGs have enabled numerous knowledgedriven applications. For example, wang2016understanding wang2016understanding utilize Probase to help understand short texts.
One recent work has proposed a matrixfactorizationbased approach to embed uncertain networks [Hu et al.2017]. However, it cannot be generalized to embed uncertain KGs because this model only considers the node proximity in the networks with no explicit relations and only generates node embeddings. As far as we know, we are among the first to study the uncertain KG embedding problem.
Probabilistic Soft Logic
Probabilistic soft logic (PSL) [Kimmig et al.2012] is a framework for probabilistic reasoning. A PSL program consists of a set of firstorder logic rules with conjunctive bodies and single literal heads. PSL takes the confidence from interval as the soft truth values for every atom. It uses Lukasiewics tnorm [Lukasiewicz and Straccia2008] to determine to which degree a rule is satisfied. In combination with HingeLoss Markov Random Field (HLMRF), PSL is widely used in probabilistic reasoning tasks, such as socialtrust prediction and preference prediction [Bach et al.2013, Bach et al.2017]. In this paper, we adopt PSL to enhance the embedding model performance on the unseen relation facts.
3 Problem Definition
We define the uncertain KG embedding problem in this section by first providing the definition of uncertain KGs.
Definition 1.
Uncertain Knowledge Graph. An uncertain KG represents knowledge as a set of relations () defined over a set of entities (). It consists of a set of weighted triples . For each pair , is a triple representing a relation fact where (the set of entities) and (the set of relations), and represents the confidence score for this relation fact to be true.
Note that we assume the confidence score and interpret it as a probability to leverage probabilistic soft logicbased inference. The range of original confidence scores for some uncertain KG (e.g., ConceptNet) may not fall in , and normalization will be needed in these cases. Some examples of weighted triples are listed below.
Example 3.1.
Weighted triples.

(choir, relatedto, sing): 1.00

(college, synonym, university): 0.99

(university, synonym, institute): 0.86

(fork, atlocation, kitchen): 0.4
Definition 2.
Uncertain Knowledge Graph Embedding Problem. Given an uncertain KG , the embedding model aims to encode each entity and relation in a lowdimensional space in which structure information and confidence scores of relation facts are preserved.
Notation wise, boldfaced are used to represent the embedding vectors for head , relation and tail respectively. are assumed lie in .
4 Modeling
In this section, we propose our model for uncertain KG embeddings. The proposed model UKGE encodes the KG structure according to the confidence scores for both observed and unseen relation facts, such that the embeddings of relation facts with higher confidence scores receive higher plausibility values.
We first design relation fact confidence score modeling based on embeddings of entities and relations, then introduce how probabilistic soft logic can be used to infer confidence scores for unseen relations, and lastly describe the joint model UKGE and its two variants.
4.1 Embeddingbased Confidence Score Modeling for Relation Facts
Unlike deterministic KG embedding models, uncertain KG embedding models need to explicitly model the confidence score for each triple and compare the prediction with the true score. We hereby first define and model the plausibility of triples, which can be considered as a unnormalized confidence score.
Definition 3.
Plausibility. Given a relation fact triple , the plausibility measures how likely this relation fact holds. The higher plausibility value corresponds to the higher confidence score .
Given a triple and their embeddings , we model the plausibility of by the following function:
(1) 
where is the elementwise product, and is the inner product. This function captures the relatedness between embeddings and under the condition of relation and is first adopted by DistMult [Yang et al.2015]. We employ this triple modeling technique for three reasons: (i) This technique has represented the stateoftheart performance for modeling deterministic KGs [Kadlec, Bajgar, and Kleindienst2017], (ii) It agrees with the nature of our model to quantify the confidence of an uncertain relation fact by comparing the relation embeddings with the pair of head and tail embeddings, (iii) It does not introduce additional parameter complexity to the model like other techniques, such as TransH [Wang et al.2014], TransR [Lin et al.2015], ConvE [Dettmers et al.2018] and ProjE [Shi and Weninger2017]. Nevertheless, this scoring function can be further explored in future work.
From plausibility to confidence scores
In order to transform plausibility scores to confidence scores, we consider two different mapping functions and test them in the experimental section. Formally, let a triple be and its plausibility score be , a transformation function maps to a confidence score .
(2) 
Two choices of mapping are listed below.
Logistic function. One way to map plausibility values to confidence score is a logistic function as follows:
(3) 
Bounded rectifier. Another mapping is a bounded rectifier [Chen et al.2015]:
(4) 
where is a weight is a bias.
4.2 PSLbased Confidence Score Reasoning for Unseen Relation Facts
In order to better estimate confidence scores, both observed and unseen relation facts in KGs should be utilized. Deterministic KG embedding methods assume that all unseen relation facts are false beliefs, and use negative sampling to add some of these false relations into training. One major challenge of learning embeddings for uncertain KGs, however, is to properly estimate the uncertainty of unseen triples, as simply treating their confidence score as can no longer capture the subtle uncertainty. For example, it is common that a ProteinProtein Interaction Network KG may have no interaction records for two proteins that can be potentially binded. Ignoring such possibility will result in information loss.
We thus introduce probabilistic soft logic (PSL) [Kimmig et al.2012] to infer confidence scores for these unseen relation facts to further enhance the embedding performance. PSL is a framework for confidence reasoning that propagates confidence of existing knowledge to unseen triples using soft logic.
Probabilistic Soft Logic
A PSL program consists of a set of first order logic rules that describe logical dependencies between facts (atoms). One example of logical rule is shown below:
Example 4.1.
A Logical Rule on Transitivity of Synonym Relation.
(A,synonym,B) (B,synonym,C)
(A,synonym,C)
This logical rule describes the transitivity of the relation synonym. In this logical rule, A, B and C are placeholders for entities, synonym is the predicate that corresponds to the relation in uncertain KGs, (A,synonym,B) (B,synonym,C) is the body of the rule, and (A,synonym,C) is the head of the rule.
A logical rule serves as a template rule. By replacing the placeholders in a logical rule with concrete entities and relations, we can get rule instances, which are called ground rules. Considering Example 4.1 and uncertain relation facts from Example 3.1, we can have the following ground rule by replacing the placeholders with real relation facts in KG.
Example 4.2.
A Ground Rule on Transitivity of Synonym.
(college, synonym, university) (university, synonym, institute)
(college, synonym, institute)
Different from Boolean logic, PSL associates every atom, i.e., a triple , with a soft truth value from the interval , which corresponds to the confidence score in our context and enables fuzzy reasoning. The assignment process of soft truth values is called an interpretation. We denote the soft truth value of an atom assigned by the interpretation as . Naturally, for observed relation facts, their observed confidence scores are used for assignment; and for unseen triples, the embeddingbased estimated confidence scores will be assigned to them:
(5)  
where denotes the observed triple set, denotes the unseen triples, denotes the confidence score for observed triple , and denotes the embeddingbased confidence score function for .
In PSL, Lukasiewicz tnorm is used to define the basic logical operations, including logical conjunction (), disjunction (), and negation (), as follows:
(6)  
(7)  
(8) 
For example, according to Eq. (6) and (7), and . For a rule , as it can be written as , its value can be computed as
(9) 
PSL regards a rule as satisfied when the truth value of its head is the same or higher than its body , i.e., when its value is greater than or equal to 1. Then a rule’s distance to satisfaction is defined as the probability that it cannot be satisfied:
(10) 
Consider Example 4.2. Let (college, synonym, university) be , (university, synonym, college) be , and (college, synonym, institute) be . Assuming that and are observed triples in KG, and is unseen, according to Equation (5), (6), and (9), the distance to satisfaction of this ground rule is calculated as below:
where and are the ground truth confidence scores of corresponding relation facts in the uncertain KG.
This equation indicates that the ground rule in Example 4.2 is completely satisfied when , the estimated confidence score of (college, synonym institute), is above 0.85. When is under 0.85, the smaller is, the larger loss we have. In other words, a bigger confidence score is preferable. In the above example, we can see that the embeddingbased confidence score for this unseen relation fact,
, will affect the loss function, and it is desirable to learn embeddings that minimize these losses. Note that if we simply treat the unseen relation
as false and use MSE (Mean Squared Error) as the loss, the loss would be , which is in favor of a lower confidence score mistakenly.Moreover, we add a rule to penalize the predicted confidence scores of all unseen relation facts, which can be considered as a prior knowledge, i.e., any unseen relation fact has a low probability to be true. Formally, for an unseen relation fact , we have a ground rule :
(11) 
According to Eq. (8) and (10), its distance to satisfaction is derived as:
(12) 
4.3 Embedding Uncertain KGs
In this subsection, we present the objective function of uncertain KG embeddings.
Loss on observed relation facts
Let be the set of observed relation facts, the goal is to minimize the mean squared error (MSE) between the ground truth confidence score and our prediction for each relation :
(13) 
Loss on unseen relation facts
Let be the sampled set of unseen relations, and be the set of ground rules with as the rule head, the goal is to minimize the distance to rule satisfaction for each triple . In particular, we choose to use the square of the distance as the following loss [Bach et al.2013]:
(14) 
where denotes the distance to satisfaction of the rule as a function of .
Note that when is only covered by , we have , which is essentially the MSE loss by treating unseen relation facts as false.
The Joint Objective Function
5 Experiments
Dataset  #Ent.  #Rel.  #Rel. Facts  Avg()  Std() 
CN15k  15,000  36  241,158  0.629  0.232 
NL27k  27,221  404  175,412  0.797  0.242 
PPI5k  5,000  7  271,666  0.415  0.213 
) are the average and standard deviation of the confidence scores.
Dataset  Logical Rules  Hit Ratio 
CN15k  (A, relatedTo, B)(B, relatedTo, C)(A, relatedTo, C)  37.0% 
(A, causes, B)(B, causes, C)(A, causes, C)  35.6%  
NL27k  (A, competesWith, B)(B, competesWith, C)(A, competesWith, C)  30.1% 
(A, atheletePlaysForTeam,B) (A, athletePlaysSport, C) (B, teamPlaysSport, C)  42.9%  
PPI5k  (A, binding, B)(B, binding, C)(A, binding, C)  80.8% 
In this section, we evaluate our models on three tasks: confidence prediction, relation fact ranking, and relation fact classification.
5.1 Datasets
The evaluation is conducted on three datasets named as CN15k, NL27k, and PPI5k, which are extracted from ConceptNet, NELL, and the ProteinProtein Interaction Knowledge Base STRING [Szklarczyk et al.2016] respectively. CN15k matches the number of nodes with FB15k [Bordes et al.2013]  the widely used benchmark dataset for deterministic KG embeddings [Bordes et al.2013, Wang et al.2014, Yang et al.2015], while NL27k is a larger dataset. PPI5k is a denser graph with fewer entities but more relation facts than the other two. Table 1 gives the statistics of the datasets, and more details are introduced below.
Dataset  CN15k  NL27k  PPI5k  
Metrics  MSE  MAE  MSE  MAE  MSE  MAE 
URGE  10.32  22.72  7.48  11.35  1.44  6.00 
UKGE  23.96  30.38  24.86  36.67  7.46  19.32 
UKGE  9.02  20.05  2.67  7.03  0.96  4.09 
UKGE  8.61  19.90  2.36  6.90  0.95  3.79 
UKGE  9.86  20.74  3.43  7.93  0.96  4.07 
metrics  CN15K  NL27k  PPI5k  
Dataset  linear  exp.  linear  exp.  linear  exp. 
TransE  0.601  0.591  0.730  0.722  0.710  0.700 
DistMult  0.689  0.677  0.911  0.897  0.894  0.880 
ComplEx  0.723  0.712  0.921  0.913  0.896  0.881 
URGE  0.572  0.570  0.593  0.593  0.726  0.723 
UKGE  0.236  0.232  0.245  0.245  0.514  0.517 
UKGE  0.769  0.768  0.933  0.929  0.940  0.944 
UKGE  0.773  0.775  0.939  0.942  0.946  0.946 
UKGE  0.789  0.788  0.955  0.956  0.970  0.969 
Dataset  head  relation  true tail  confidence  predicted tail  predicted confidence  true confidence 
CN15k  rush  relatedto  fast  0.968  fast  0.703  0.968 
motion  0.709  move  0.623  0.557  
rapid  0.709  hour  0.603  0.654  
urgency  0.709  time  0.601  0.105  
hotel  usedfor  sleeping  1.0  relaxing  0.858  N/A  
rest  0.984  sleeping  0.849  1.0  
bed away from home  0.709  rest  0.827  0.984  
stay overnight  0.709  hotel room  0.797  N/A  
NL27k  Toyota  competeswith  Honda  1.0  Honda  0.942  1.0 
Ford  1.0  Hyundai  0.910  0.719  
BMW  0.964  Chrysler  0.908  N/A  
General Motors  0.930  Nissan  0.896  0.859 
Metrics  CN15k  NL27k  PPI5k  
Dataset  F1  Accu.  F1  Accu.  F1  Accu. 
TransE  23.4  67.9  65.1  53.4  83.2  98.5 
DistMult  27.9  71.1  72.1  70.1  86.9  97.1 
ComplEx  18.9  73.2  63.3  53.4  83.2  98.9 
URGE  21.2  86.0  83.6  88.7  85.2  98.6 
UKGE  23.6  86.1  64.4  65.5  92.7  99.3 
UKGE  26.2  88.7  89.7  93.4  94.2  99.3 
UKGE  28.8  90.4  92.3  95.2  95.1  99.4 
UKGE  25.9  90.1  88.4  93.0  94.5  99.5 
CN15k
CN15k is a subgraph of the commonsense KG ConceptNet. This subgraph contains 15,000 entities and 241,158 uncertain relation facts in English. The original scores in ConceptNet vary from 0.1 to 22, where 99.6% are less than or equal to 3.0. For normalization, we first bound confidence scores to , and then applied the minmax normalization to map them into [0.1, 1.0].
Nl27
NL27k is extracted from NELL [Mitchell et al.2018], an uncertain KG obtained from webpage reading. NL27k contains 27,221 entities, 404 relations, and 175,412 uncertain relation facts. In the process of minmax normalization, we search for the lower boundary from 0.1 to 0.9. We have found out that normalizing the confidence score to interval yields best results.
PPI5k
The ProteinProtein Interaction Knowledge Base STRING labels the interactions between proteins with the probabilities of occurrence. PPI5k is a subset of STRING that contains 271,666 uncertain relation facts for 5,000 proteins and 7 interactions.
5.2 Experimental Setup
We split each dataset into three parts: 60% for training, 10% for validation, and 30% for testing. To test if our model can correctly interpret negative links, we add the same amount of negative links as existing relation facts into the test sets.
We use Adam optimizer [Kingma and Ba2014] for training, for which we set the exponential decay rates and
. We report results for all models respectively based on their best hyperparameter settings. For each model, the setting is identified based on the validation set performance. We select among the following sets of hyperparameter values: learning rate
{0.001, 0.005, 0.01}, dimensionality {64, 128, 256, 512}, batch size {128, 256, 512, 1024}, The regularization coefficientis fixed as 0.005. Training was stopped using early stopping based on MSE on the validation set, computed every 10 epochs. The best hyperparameter combinations on CN15k and NL27k are
and for UKGE, for UKGE. On PPI5k they are for both variants.5.3 Logical Rule Generation
Our model requires additional input as logical rules for PSL reasoning. We heuristically create candidate logical rules by considering length2 paths (i.e., (
,,) (,,) (,,)) and validate them by hit ratio, i.e. the proportion of relation facts implied by the rule to be truly existent in the KG. The higher ratio implies that the rule is more convincing. We eventually create 3 logical rules for CN15k, 4 for NL27k, and 1 for PPI5k. Table 2 gives some examples of the logical rules and their hit ratios. How to systematically create more promising logical rules will be considered as future work.5.4 Baselines
Three types of baselines are considered in our comparison, which include (i) deterministic KG embedding models TransE [Bordes et al.2013], DistMult [Yang et al.2015] and ComplEx [Trouillon et al.2016], (ii) an uncertain graph embedding model URGE [Hu et al.2017], and (iii) UKGE and UKGE that are two simplified versions of our model.

Deterministic KG Embedding Models. TransE, DistMult, and ComplEx have demonstrated high performance on deterministic KGs. Only the highconfidence relation facts from KGs are used for training. For each KG, we have a KGspecific confidence score threshold to distinguish the highconfidence relation facts from the lowconfidence ones, which will be discussed later in Section 5.7. These models cannot predict confidence scores. We compare our methods to them only on the ranking and the classification tasks. For the same reason, the early stopping is based on mean reciprocal rank (MRR) on the validation set. We adopt the implementation given by [Trouillon et al.2016] and choose the best hyperparameters following the same grid search procedure. This implementation uses [Duchi, Hazan, and others2011] for optimization. The best hyperparameter combinations on CN15k and NL27k are , {} for TransE and for DistMult and ComplEx. On PPI5k they are , {} for DistMult and {} for TransE and ComplEx.

Uncertain Graph Embedding Model. URGE is proposed very recently to embed uncertain graphs. However, it cannot deal with multiple types of relations in KGs, and it only produces node embeddings. We simply ignore relation types when applying URGE to our datasets. We adopt its firstorder proximity version as our tasks focus on the edge relations between nodes.

Two Simplified Versions of Our Model. To justify the use of negative links and PSL reasoning in our model, we propose two simplified versions of UKGE , called UKGE and UKGE. In UKGE, we only keep the observed relation facts and remove negative sampling, and in UKGE, we remove PSL reasoning and use the MSE loss for unseen relation facts.
5.5 Confidence Prediction
The objective of this task is to predict confidence scores of unseen relation facts.
Evaluation protocol
For each uncertain relation fact in the test set, we predict the confidence score of and report the mean squared error (MSE) and mean absolute error (MAE).
Results
Results are reported in Table 3. Both our variants UKGE and UKGE outperform the baselines URGE, UKGE, and UKGE, since URGE only takes node proximity information and cannot model the rich relations between entities, and UKGE does not adopt negative sampling and cannot recognize negative links. The better results of UKGE than UKGE demonstrate that introducing PSL into embedding learning can enhance the model performance. Between the two model variants, UKGE results in smaller MSE and MAE than UKGE. We notice that all the models achieve much smaller MSE on PPI5k than CN15k and NL27k. We hypothesize that this is because the much higher density of PPI5k facilitates embedding learning [Pujara, Augustine, and Getoor2017].
5.6 Relation Fact Ranking
The next task focuses on ranking tail entities in the right order for the query .
Evaluation protocol
For a query , we rank all the entities in the vocabulary as tail candidates and evaluate the ranking performance using the normalized Discounted Cumulative G ain (nDCG) [Li, Liu, and Zhai2009]. We define the gain in retrieving a relevant tail as the ground truth confidence score . We take the mean nDCG over the test query set as our ranking metric. We report the two versions of nDCG that use linear gain and exponential gain respectively. The exponential gain version puts stronger emphasis on highly relevant results.
Results
Table 4 shows the mean nDCG over all test queries for all compared methods. Though TransE, DistMult, and ComplEx do not encode the confidence score information, they maximize the plausibility of all observed relation facts and therefore rank these existing relation facts high. We observe that DistMult and ComplEx have considerably better performance than TransE, as TransE does not handle 1toN relations well. ComplEx embeds entities and relations in the complex domain and handles asymmetric relations better than DistMult. It achieves the best results among the deterministic KG embedding models on this task. As UKGE removes negative sampling from the loss function, it cannot distinguish the negative links from existing relation facts and results in the worst performance. UKGE yields slightly worse performance than UKGE. Besides ranking the existing relation facts highly, our models also preserve the order of the observed relation facts and thus achieve higher nDCG scores. Both UKGE and UKGE outperform all the baselines under all settings, while UKGE yields higher nDCG on all three datasets than UKGE. Considering the confidence prediction results of UKGE in Section 5.5, we hypothesize that the easy saturation of logistic function allows UKGE to better distinguish negative links from true relation facts, while this feature compromises its ability to fit confidence scores more precisely.
Case study
Table 5 gives some examples of relation fact ranking results by UKGE. Given a query , the top 4 predicted tails and true tails are given, sorted by their scores in descending order. The predictions are consistent with our commonsense. It is worth noting that some quite reasonable unseen relation facts such as hotel is used for relaxing, can be predicted correctly. In other words, our proposed approach can be potentially used to infer new knowledge from the observed ones with reasonable confidence scores, which may shed light on another line of future study.
5.7 Relation Fact Classification
This last task is a binary classification task to decide whether a given relation fact is a strong relation fact or not. The embedding models need to distinguish relation facts in the KG from negative links and highconfidence relation facts from lowconfidence ones.
In an uncertain KG, a relation fact is considered strong if its confidence score is above a KGspecific threshold . Here we set for both CN15k and NL27k and for PPI5k. Under this setting, 20.4% of relation facts in CN15k, 20.1% of those in NL27k, and of those in PPI5k are considered strong.
Evaluation protocol
We follow a procedure that is similar to [Wang et al.2014]. Our test set consists of relation facts from the KG and randomly sampled negative links equally. We divide the test cases into two groups, strong and weak/false, by their ground truth confidence scores. A test relation fact is strong when is in the KG and
, otherwise weak/false. We fit a logistic regression classifier as a downstream classifier on the predicted confidence scores.
Results
F1 scores and accuracies are reported in Table 6. These results show that our two model variants consistently outperform all baseline models. The deterministic KG models can distinguish the existing relation facts from negative links, but they do not leverage the confidence information and cannot recognize the highconfidence ones. URGE does not encode the rich relations. Although UKGE fits confidence scores in the KG, it cannot correctly interpret negative links as false. Consistent with the previous two tasks, the performance of UKGE is worse than UKGE.
6 Conclusion and Future Work
To the best of our knowledge, this paper is the first work on embedding uncertain knowledge graphs. Our model UKGE effectively preserves both the relation facts and uncertainty information in the embedding space of KG. We propose two variants of our model and conduct extensive experiments on relation fact confidence score prediction, relation fact ranking, and relation fact classification. The results are very promising. For future work, we will study how to systematically generate reasonable logical rules and test its impact on embedding quality. We are interested in extending UKGE for uncertain knowledge extraction from text.
Acknowledgements
This work is partially supported by NSF III1705169, NSF CAREER Award 1741634, Snapchat gift funds, and PPDai gift fund.
References
 [Bach et al.2013] Bach, S.; Huang, B.; London, B.; and Getoor, L. 2013. Hingeloss markov random fields: Convex inference for structured prediction.
 [Bach et al.2017] Bach, S. H.; Broecheler, M.; Huang, B.; and Getoor, L. 2017. Hingeloss markov random fields and probabilistic soft logic. JMLR.
 [Bollacker et al.2008] Bollacker, K.; Evans, C.; Paritosh, P.; Sturge, T.; and Taylor, J. 2008. Freebase: a collaboratively created graph database for structuring human knowledge. In SIGMOD.
 [Bordes et al.2013] Bordes, A.; Usunier, N.; GarciaDuran, A.; Weston, J.; and Yakhnenko, O. 2013. Translating embeddings for modeling multirelational data. In NIPS.
 [Bordes, Weston, and Usunier2014] Bordes, A.; Weston, J.; and Usunier, N. 2014. Open question answering with weakly supervised embedding models. In ECMLPKDD. Springer.

[Chen et al.2015]
Chen, M.; Weinberger, K. Q.; Xu, Z.; and Sha, F.
2015.
Marginalizing stacked linear denoising autoencoders.
JMLR.  [Chen et al.2018] Chen, M.; Tian, Y.; Chen, X.; Xue, Z.; and Zaniolo, C. 2018. On2vec: Embeddingbased relation prediction for ontology population. In SDM.

[Das et al.2018]
Das, R.; Dhuliawala, S.; Zaheer, M.; Vilnis, L.; Durugkar, I.; Krishnamurthy,
A.; Smola, A.; and McCallum, A.
2018.
Go for a walk and arrive at the answer: Reasoning over paths in knowledge bases using reinforcement learning.
In ICLR.  [Dettmers et al.2018] Dettmers, T.; Minervini, P.; Stenetorp, P.; and Riedel, S. 2018. Convolutional 2d knowledge graph embeddings. In AAAI.
 [Duchi, Hazan, and others2011] Duchi, J.; Hazan, E.; et al. 2011. Adaptive subgradient methods for online learning and stochastic optimization. JMLR 12(Jul).
 [He et al.2017] He, H.; Balakrishnan, A.; Eric, M.; and Liang, P. 2017. Learning symmetric collaborative dialogue agents with dynamic knowledge graph embeddings. In ACL.
 [Hu et al.2017] Hu, J.; Cheng, R.; Huang, Z.; Fang, Y.; and Luo, S. 2017. On embedding uncertain graphs. In CIKM.
 [Jenatton et al.2012] Jenatton, R.; Roux, N. L.; Bordes, A.; and Obozinski, G. R. 2012. A latent factor model for highly multirelational data. In NIPS.
 [Ji et al.2015] Ji, G.; He, S.; Xu, L.; Liu, K.; and Zhao, J. 2015. Knowledge graph embedding via dynamic mapping matrix. In ACL.
 [Jia et al.2016] Jia, Y.; Wang, Y.; Lin, H.; Jin, X.; and Cheng, X. 2016. Locally adaptive translation for knowledge graph embedding. In AAAI, 992–998.
 [Kadlec, Bajgar, and Kleindienst2017] Kadlec, R.; Bajgar, O.; and Kleindienst, J. 2017. Knowledge base completion: Baselines strike back. In ACL.
 [Kimmig et al.2012] Kimmig, A.; Bach, S.; Broecheler, M.; Huang, B.; and Getoor, L. 2012. A short introduction to probabilistic soft logic. In Proceedings of the NIPS Workshop on Probabilistic Programming: Foundations and Applications, 1–4.
 [Kingma and Ba2014] Kingma, D. P., and Ba, J. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980.
 [Li, Liu, and Zhai2009] Li, H.; Liu, T.Y.; and Zhai, C. 2009. Learning to rank for information retrieval. Foundations and Trends® in Information Retrieval.
 [Lin et al.2015] Lin, Y.; Liu, Z.; Sun, M.; Liu, Y.; and Zhu, X. 2015. Learning entity and relation embeddings for knowledge graph completion. In AAAI.
 [Lukasiewicz and Straccia2008] Lukasiewicz, T., and Straccia, U. 2008. Managing uncertainty and vagueness in description logics for the semantic web. Web Semantics: Science, Services and Agents on the World Wide Web.
 [Mitchell et al.2018] Mitchell, T.; Cohen, W.; Hruschka, E.; Talukdar, P.; Yang, B.; Betteridge, J.; Carlson, A.; Dalvi, B.; Gardner, M.; Kisiel, B.; et al. 2018. Neverending learning. Communications of the ACM.
 [Nickel et al.2016] Nickel, M.; Rosasco, L.; Poggio, T. A.; et al. 2016. Holographic embeddings of knowledge graphs. In AAAI.
 [Nickel, Tresp, and Kriegel2011] Nickel, M.; Tresp, V.; and Kriegel, H.P. 2011. A threeway model for collective learning on multirelational data. In ICML.
 [Pujara, Augustine, and Getoor2017] Pujara, J.; Augustine, E.; and Getoor, L. 2017. Sparsity and noise: Where knowledge graph embeddings fall short. In EMNLP.
 [Ratinov and Roth2009] Ratinov, L., and Roth, D. 2009. Design challenges and misconceptions in named entity recognition. In CoNLL.
 [Rebele et al.2016] Rebele, T.; Suchanek, F.; Hoffart, J.; Biega, J.; Kuzey, E.; and Weikum, G. 2016. Yago: A multilingual knowledge base from wikipedia, wordnet, and geonames. In ISWC.
 [Shi and Weninger2017] Shi, B., and Weninger, T. 2017. Proje: Embedding projection for knowledge graph completion. In AAAI.
 [Socher et al.2013] Socher, R.; Chen, D.; Manning, C. D.; and Ng, A. 2013. Reasoning with neural tensor networks for knowledge base completion. In NIPS.
 [Speer, Chin, and Havasi2017] Speer, R.; Chin, J.; and Havasi, C. 2017. Conceptnet 5.5: An open multilingual graph of general knowledge. In AAAI.
 [Szklarczyk et al.2016] Szklarczyk, D.; Morris, J. H.; Cook, H.; Kuhn, M.; Wyder, S.; Simonovic, M.; Santos, A.; Doncheva, N. T.; Roth, A.; Bork, P.; et al. 2016. The string database in 2017: qualitycontrolled protein–protein association networks, made broadly accessible. Nucleic acids research.
 [Trouillon et al.2016] Trouillon, T.; Welbl, J.; Riedel, S.; Gaussier, E.; and Bouchard, G. 2016. Complex embeddings for simple link prediction. In ICML.
 [Wang and Wang2016] Wang, Z., and Wang, H. 2016. Understanding short texts. In ACL.

[Wang et al.2014]
Wang, Z.; Zhang, J.; Feng, J.; and Chen, Z.
2014.
Knowledge graph embedding by translating on hyperplanes.
In AAAI.  [Wang et al.2015] Wang, Z.; Wang, H.; Wen, J.R.; and Xiao, Y. 2015. An inference approach to basic level of categorization. In CIKM.
 [Weston, Bordes, and others2013] Weston, J.; Bordes, A.; et al. 2013. Connecting language and knowledge bases with embedding models for relation extraction. In EMNLP.
 [Wu et al.2012] Wu, W.; Li, H.; Wang, H.; and Zhu, K. Q. 2012. Probase: A probabilistic taxonomy for text understanding. In SIGMOD.
 [Yang et al.2015] Yang, B.; Yih, W.t.; He, X.; Gao, J.; and Deng, L. 2015. Embedding entities and relations for learning and inference in knowledge bases. ICLR.
 [Yih et al.2013] Yih, W.t.; Chang, M.W.; Meek, C.; and Pastusiak, A. 2013. Question answering using enhanced lexical semantic models. In ACL.
Comments
There are no comments yet.