中文摘要：

目前,基于论文合作关系的科学研究人员社会关系网络得到了极大的关注,但是存在实体识别不准确、数据更新不及时等数据质量问题.有鉴于此,提出利用历年项目申请书的合作关系,同时将实体识别问题归结为一个聚类问题,证明该问题的计算复杂度,然后提出了算法来解决该问题,最后在真实数据上验证算法的效率.

英文摘要：

For the time being,the social network based on paper cooperation has gained a great deal of attention,but there exists inaccurate entity recognition,failing to update data in time,and uncertain data quality etc.In view of this,this paper puts forward the cooperation on the basis of the history project application,and the problem of the entity recognition attributes to a clustering problem.The computational complexity of the problem is proved.Then the algorithm is proposed to settle the problem.Finally,the efficiency of the algorithm is verified by the experiments on real data.