从合著者网络中挖掘中心作者

T. Peng, Delong Zhang, Xiaoming Liu, Shang Wang, Wanli Zuo
{"title":"从合著者网络中挖掘中心作者","authors":"T. Peng, Delong Zhang, Xiaoming Liu, Shang Wang, Wanli Zuo","doi":"10.1109/ISCID.2013.64","DOIUrl":null,"url":null,"abstract":"Most researches on co-authorship network analyze the author's information globally according to the overall network topology structure, instead of analyzing the author's local network. Therefore, this paper presents a community mining algorithm and divides big co-authorship network into small communities, in which entities' relationship is closer. Then we mine central authors in community by three different centrality standards including closeness centrality, eigenvector centrality and a new proposed measure termed extensity degree centrality. We choose the SIGMOD data as datasets and measure the centrality from different views. And experiments in co-authorship network achieve many interesting results, which indicate our technique is efficient and feasible, and also have reference value for scientific evaluation.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Central Author Mining from Co-authorship Network\",\"authors\":\"T. Peng, Delong Zhang, Xiaoming Liu, Shang Wang, Wanli Zuo\",\"doi\":\"10.1109/ISCID.2013.64\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most researches on co-authorship network analyze the author's information globally according to the overall network topology structure, instead of analyzing the author's local network. Therefore, this paper presents a community mining algorithm and divides big co-authorship network into small communities, in which entities' relationship is closer. Then we mine central authors in community by three different centrality standards including closeness centrality, eigenvector centrality and a new proposed measure termed extensity degree centrality. We choose the SIGMOD data as datasets and measure the centrality from different views. And experiments in co-authorship network achieve many interesting results, which indicate our technique is efficient and feasible, and also have reference value for scientific evaluation.\",\"PeriodicalId\":297027,\"journal\":{\"name\":\"2013 Sixth International Symposium on Computational Intelligence and Design\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Sixth International Symposium on Computational Intelligence and Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCID.2013.64\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Sixth International Symposium on Computational Intelligence and Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCID.2013.64","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

大多数关于合作网络的研究都是根据整体网络拓扑结构来分析作者的全局信息,而不是分析作者的局部网络。为此,本文提出了一种社区挖掘算法,将大型合作网络划分为实体关系更紧密的小社区。然后,我们通过三种不同的中心性标准来挖掘社区中的中心作者,包括接近中心性、特征向量中心性和一种新提出的度量方法——扩展度中心性。我们选择SIGMOD数据作为数据集,并从不同的角度测量中心性。并在合作作者网络上进行了实验,得到了许多有趣的结果,表明我们的技术是有效可行的,对科学评价也有参考价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Central Author Mining from Co-authorship Network
Most researches on co-authorship network analyze the author's information globally according to the overall network topology structure, instead of analyzing the author's local network. Therefore, this paper presents a community mining algorithm and divides big co-authorship network into small communities, in which entities' relationship is closer. Then we mine central authors in community by three different centrality standards including closeness centrality, eigenvector centrality and a new proposed measure termed extensity degree centrality. We choose the SIGMOD data as datasets and measure the centrality from different views. And experiments in co-authorship network achieve many interesting results, which indicate our technique is efficient and feasible, and also have reference value for scientific evaluation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信