Abstract: Recent years, the development of knowledge bases is very fast. They store large scale of entities and the relations between entities. However, most of the relations which have the same meanings are not in the same form. It is necessary to resolute the relations. For this purpose, this paper proposes an approach based on Markov cluster algorithm to cluster the relation with same meanings. Firstly, this paper calculates the semantic similarity between every two relations, and then it uses the relation similarity as weighted-edge to build a graph. Finally, this paper runs a Markov cluster algorithm on the graph and gets the result of relation clusters. Experiments show that the proposed approach has a higher purity than hierarchy cluster and k-means cluster.

Key words: Markov cluster, knowledge base, relation between entities

摘要： 随着面向网络大数据的知识库的不断出现，它们各自都包含海量的实体以及实体间的关系。然而许多有相同含义的关系并没有统一名称，针对这种情况，提出了一种基于马尔可夫聚类（Markov cluster algorithm，MCL）的实体间关系融合方法。该方法首先计算关系间的语义相似度，然后利用关系间的语义相似度作为有边的权重，构建无向图，并利用马尔可夫聚类算法进行聚类。实验表明，该方法相比层次聚类和k-means聚类方法在聚类纯度上有一定提高，并且更加方便使用。

关键词: 马尔可夫聚类, 知识库, 实体间关系