知识图谱补全：Triple Classification（三元组分类）

6) Triple Classification: Triple classification is to determine whether facts are correct in testing data, which is typically regarded as a binary classification problem.

6)三元组分类: 三元组分类是确定测试数据中事实是否正确，通常被认为是一个二元分类问题。

 

The decision rule is based on the scoring function with a specific threshold. Aforementioned embedding methods could be applied for triple classification, including translational distance-based methods like TransH [20] and TransR [17] and semantic matching-based methods such as NTN [18], HolE [21] and ANALOGY [22]. 

决策规则基于具有特定阈值的评分函数。前面提到的嵌入方法可以应用于三级分类，包括基于翻译距离的TransH[20]、TransR[17]和基于语义匹配的NTN[18]、HolE[21]、类推[22]等方法。

Vanilla vector-based embedding methods failed to deal with 1-to-n relations. Recently, Dong et al. [79] extended the embedding space into region-based n-dimensional balls where the tail region is in the head region for 1-to-n relation using fine-grained type chains, i.e., tree-structure conceptual clusterings.

基于嵌入向量的方法无法处理1到n的关系。最近Dong等人[79]利用细粒度类型链，将嵌入空间扩展为基于区域的n维球，其中尾部区域位于头部区域，用于1到n的关系，即树结构概念聚类。

This relaxation of embedding to n-balls turns triple classification into a geometric containment problem and improves the performance for entities with long type chains. However, it relies on the type chains of entities and suffers from the scalability problem.
这种松弛的n球嵌入使三重分类问题变成一个几何包容问题，并提高了具有长类型链的实体的性能。然而，它依赖于实体的类型链，并受到可伸缩性问题的困扰。