基于云的名称消歧算法

Yang Juan, He Hua, Wu Bin
{"title":"基于云的名称消歧算法","authors":"Yang Juan, He Hua, Wu Bin","doi":"10.1109/ISME.2010.33","DOIUrl":null,"url":null,"abstract":"In Scientific Collaboration Networks, the phenomenon that one author name corresponds to many author entities is very common. Traditional algorithms for name disambiguation performed inefficiently in dealing with massive data. This paper presents a parallel algorithm for solving the name disambiguation problem: first merge authors with same names and similar author information, then divide the scientific collaboration networks into author communities, authors with same name in one community is supposed as one entity with great possibility. The algorithm is based on the Cloud-Computing platform, and has the ability to deal with massive data. In our experiment, the algorithm efficiently processed massive data and achieved an average f-score of 0.93.","PeriodicalId":348878,"journal":{"name":"2010 International Conference of Information Science and Management Engineering","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Cloud-Based Name Disambiguation Algorithm\",\"authors\":\"Yang Juan, He Hua, Wu Bin\",\"doi\":\"10.1109/ISME.2010.33\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In Scientific Collaboration Networks, the phenomenon that one author name corresponds to many author entities is very common. Traditional algorithms for name disambiguation performed inefficiently in dealing with massive data. This paper presents a parallel algorithm for solving the name disambiguation problem: first merge authors with same names and similar author information, then divide the scientific collaboration networks into author communities, authors with same name in one community is supposed as one entity with great possibility. The algorithm is based on the Cloud-Computing platform, and has the ability to deal with massive data. In our experiment, the algorithm efficiently processed massive data and achieved an average f-score of 0.93.\",\"PeriodicalId\":348878,\"journal\":{\"name\":\"2010 International Conference of Information Science and Management Engineering\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference of Information Science and Management Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISME.2010.33\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference of Information Science and Management Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISME.2010.33","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在科学协作网络中,一个作者名称对应多个作者实体的现象非常普遍。传统的名称消歧算法在处理海量数据时效率低下。本文提出了一种解决姓名消歧问题的并行算法:首先合并具有相同姓名和相似作者信息的作者,然后将科学协作网络划分为多个作者社区,将同一社区中具有相同姓名的作者视为一个具有较大可能性的实体。该算法基于云计算平台,具有处理海量数据的能力。在我们的实验中,该算法有效地处理了大量数据,平均f-score达到0.93。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cloud-Based Name Disambiguation Algorithm
In Scientific Collaboration Networks, the phenomenon that one author name corresponds to many author entities is very common. Traditional algorithms for name disambiguation performed inefficiently in dealing with massive data. This paper presents a parallel algorithm for solving the name disambiguation problem: first merge authors with same names and similar author information, then divide the scientific collaboration networks into author communities, authors with same name in one community is supposed as one entity with great possibility. The algorithm is based on the Cloud-Computing platform, and has the ability to deal with massive data. In our experiment, the algorithm efficiently processed massive data and achieved an average f-score of 0.93.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信