返回
Unsupervised Entity Resolution With Blocking and Graph Algorithms
DOI:10.1109/TKDE.2020.2991063.png)
摘要
En 中文
Entity resolution identifies all records in a database that refer to the same entity. In this paper, we propose an unsupervised framework for entity resolution using blocking and graph algorithms. The records are partitioned into blocks with no redundancy for efficiency improvement. For intra-block data processing, we propose a graph-theoretic fusion framework with two components, namely ITER and CliqueRank. Specifically, ITER constructs a weighted bipartite graph between terms and record-record pairs and iteratively propagates the node salience until convergence. Subsequently, CliqueRank constructs a record graph to estimate the likelihood of two records resident in the same clique. The derived likelihood from CliqueRank is fed back to ITER to rectify the edge weight until a joint optimum can be reached. Experimental evaluation was conducted with 4 real datasets. Results show that our unsupervised framework is comparable or even superior to state-of-the-art deep learning approaches.
Keyword:
Unsupervised entity resolution
blocking
graph-based algorithm
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
7.0K
被引数:
4.1W
机构
引用论文
Alaskan Lake Sediment Records and Their Implications for the Beringian Standstill Hypothesis
PaleoAmerica
IF0
Spatial variations of microbial communities in abyssal and hadal sediments across the Challenger Deep
PeerJ
IF0
Cobalt and Copper Composite Oxides as Efficient Catalysts for Preferential Oxidation of CO in H2-Rich Stream钴和铜复合氧化物作为H2-Rich流中CO优先氧化的有效催化剂

