• ܲ Ӓܿ (ױয пп ߓ҃धਸ ߈) ա য়ט ࡎ ݡয য Ӓې աب ݡয 2VFSZ 3FQMZ X = hs G = sponse e prob- graphs ds in a in G 2. , τNgi } oted as the en- bridge nstruc- urpose: , t) = formed knowledge graphs. The entity is selected by attending on the graphs and the triples within each graph. 3.3 Knowledge Interpreter h t-1 Knowledge Interpreter h t Knowledge Interpreter h t+1 Knowledge Interpreter … … rays of sunlight Knowledge Graph Knowledge Graph Knowledge Graph Word Vector Key Entity Neighboring Entity Not_A_Fact Triple Retrieved Graph Figure 3: Knowledge interpreter concatenates a word vector and the national Joint Conference on Artificial Intelligence (IJCAI-18) gi = Ngi n=1 αs n [hn; tn], (4) αs n = exp(βs n ) Ngi j=1 exp(βs j ) , (5) βs n = (Wrrn)⊤tanh(Whhn + Wttn), (6) where (hn, rn, tn) = kn , Wh, Wr, Wt are weight matri- ces for head entities, relations, and tail entities, respectively. The attention weight measures the association of a relation rn to a head entity hn and a tail entity tn . Essentially, a graph vector gi is a weighted sum of the head and tail vectors [hn; tn] of the triples contained in the graph. 3.4 Knowledge Aware Generator Not_A_Fact Triple Vector Word Vector Key Entity Neighboring Entity Attended Entity Not_A_Fact Triple Attended Graph Previously Selected Triple Vector s t-1 s t s t+1 … … a Knowledge Aware Generator lack Knowledge Graph of Knowledge Graph lack of uv Knowledge Graph Knowledge Aware Generator Knowledge Aware Generator … Figure 4: Knowledge aware generator dynamically attends on the graphs and for final w attends on to compute is defined a where Vb/ of choosing vector cg t weight me st and a gr The mo K(gi) = { late the pro formally as Proceedings of the Twenty-Seventh International Joint Conference