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}
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.