• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊
论文

An Algorithm Based on Attributed Relational Graphs for Name Disambiguation

Expand
  • (School of Information Science and Engineering,Yanshan University,Qinhuangdao 066004,China)

Received date: 2010-03-13

  Revised date: 2010-06-14

  Online published: 2010-09-08

Abstract

The problem of name sharing is widespread in largescale databases or digital libraries,and it causes many research troubles. We propose a graph module named Attributed Relational Graph to describe the figures and links between entities,then we apply an algorithm named ARGResolution based on Attributed Relational Graph to distinct the entities having the same name. The algorithm analyzes the entities and clusters them according to the similarity measure,and eventually gets a set of clusters that correspond to the real entity respectively. The experiment over real datasets shows that mining the links can improve the quality of name disambiguation and resolve the problem successfully.

Cite this article

HAO Dandan,GUO Jingfeng,ZHENG Chao . An Algorithm Based on Attributed Relational Graphs for Name Disambiguation[J]. Computer Engineering & Science, 2010 , 32(9) : 61 -64 . DOI: 10.3969/j.issn.1007130X.2010.

Outlines

/