Computer Engineering & Science >
An Algorithm Based on Attributed Relational Graphs for Name Disambiguation
Received date: 2010-03-13
Revised date: 2010-06-14
Online published: 2010-09-08
The problem of name sharing is widespread in largescale 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 ARGResolution 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.
HAO Dandan,GUO Jingfeng,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.1007130X.2010.
/
| 〈 |
|
〉 |