点击次数：

论文类型：期刊论文

发表时间：2022-06-29

发表刊物：计算机工程

卷号：35

期号：24

页面范围：60-62

ISSN号：1000-3428

摘要：When entities are represented by a group of members' records, the similar records matching problem is extended to record cluster matching problem. This paper proposes two matching patterns of record cluster, establishes mathematical model of record cluster matching by using the theory of weighted bipartite graph, and designs upper and lower bounds matching algorithm of record cluster. It deduces upper and lower bounds of record cluster matching threshold value quickly to decrease the matching times of maximum weight matching between record clusters. Experimental results show that the algorithm can improve matching accuracy and computational efficiency.

备注：新增回溯数据