H.3. Artificial Intelligence
Afrooz Moradbeiky; Farzin Yaghmaee
Abstract
Knowledge graphs are widely used tools in the field of reasoning, where reasoning is facilitated through link prediction within the knowledge graph. However, traditional methods have limitations, such as high complexity or an inability to effectively capture the structural features of the graph. The ...
Read More
Knowledge graphs are widely used tools in the field of reasoning, where reasoning is facilitated through link prediction within the knowledge graph. However, traditional methods have limitations, such as high complexity or an inability to effectively capture the structural features of the graph. The main challenge lies in simultaneously handling both the structural and similarity features of the graph. In this study, we employ a constraint satisfaction approach, where each proposed link must satisfy both structural and similarity constraints. For this purpose, each constraint is considered from a specific perspective, referred to as a view. Each view computes a probability score using a GRU-RNN, which satisfies its own predefined constraint. In the first constraint, the proposed node must have a probability of over 0.5 with frontier nodes. The second constraint computes the Bayesian graph, and the proposed node must have a link in the Bayesian graph. The last constraint requires that a proposed node must fall within an acceptable fault. This allows for N-N relationships to be accurately determined, while also addressing the limitations of embedding. The results of the experiments showed that the proposed method improved performance on two standard datasets.
