Please wait a minute...
Advanced Search
现代图书情报技术  2016, Vol. 32 Issue (10): 42-49     https://doi.org/10.11925/infotech.1003-3513.2016.10.05
  研究论文 本期目录 | 过刊浏览 | 高级检索 |
文献-作者二分网络中基于路径组合的合著关系预测研究*
张金柱1(),王小梅2,韩涛2
1南京理工大学经济管理学院 南京 210094
2中国科学院文献情报中心 北京 100190
Predicting Co-authorship with Combination of Paths in Paper-author Bipartite Networks
Zhang Jinzhu1(),Wang Xiaomei2,Han Tao2
1School of Economics and Management, Nanjing University of Science and Technology, Nanjing 210094, China
2National Science Library, Chinese Academy of Sciences, Beijing 100190, China
全文: PDF (474 KB)   HTML ( 16
输出: BibTeX | EndNote (RIS)      
摘要 

目的】降低文献-作者二分网络在投影为合著网络过程中的信息丢失影响, 形成适应特定二分网络的合著关系预测指标和方法, 提高预测准确率和结果可解释性。【方法】首先构建文献-作者二分网络及其投影合著网络; 接着抽取二分网络中的二阶路径和三阶路径表示作者间的关联关系; 最后利用逻辑回归方法学习不同路径对于合著关系预测的贡献, 由此形成文献-作者二分网络中基于路径组合的合著关系预测指标。【结果】在图书情报领域的实验证实, 文献-作者二分网络在投影为合著网络过程中存在较大的信息丢失, 并以合著关系预测准确率变化进行定量计算; 逻辑回归方法适合学习不同路径对于合著关系预测的贡献, 由此形成的路径组合指标准确率远远高出其他指标, 并且预测结果更易解释。【局限】其他的多阶路径尚未引入到该模型中, 方法通用性还需在其他领域进行验证。【结论】合著关系预测应直接在文献-作者二分网络上进行, 以降低投影过程中的信息丢失影响; 文献-作者二分网络上的路径组合指标是合著关系预测的最优指标; 该方法可扩展应用到其他类型的二分网络中, 如专利-发明人二分网络。

服务
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章
张金柱
王小梅
韩涛
关键词 文献-作者二分网络路径组合指标图书情报合著网络合著关系预测    
Abstract

[Objective] This paper aims to predict co-authorship more effectively and reduce the information loss. [Methods] First, we constructed a paper-author bipartite network and its co-authorship counterpart in the field of library and information science. Second, we described the relationships among authors with the path-length of two and three from the bipartite network. Third, we used the logistic regression method to learn the influence of different factors. Finally, we predicted co-authorship in the paper-author bipartite network with various indictors. [Results] We found significant information loss in the change from the paper-author bipartite network to the co-authorship network. The logistic regression method was an appropriate way to learn the contributions of paths. The new indicators were more accurate and the predicted co-authorships could be interpreted more easily. [Limitations] We did not include the multiple paths methods to the present study and more research is needed to examine the proposed method in other areas. [Conclusions] Co-authorship prediction should be conducted in the paper-author bipartite network to reduce the information loss. The paths combination indicator in the paper-author bipartite network might be the most effective method to predict co-authorship, which could be applied to the patent-inventor bipartite network.

Key wordsPaper-author bipartite network    Paths combination indicator    Library and Information Science    Co-authorship network    Co-authorship prediction
收稿日期: 2016-06-15      出版日期: 2016-11-23
基金资助:*本文系国家自然科学基金青年基金“基于被引科学知识突变的突破性创新动态识别及其形成机理研究”(项目编号: 71503125)、教育部人文社会科学研究青年基金“异构知识网络中主题突变动态识别研究”(项目编号: 14YJC870025)和中央高校基本科研业务专项资金“基于专利引用科学知识突变的突破性创新动态识别方法与形成机理研究”(项目编号: 30915013101)的研究成果之一
引用本文:   
张金柱,王小梅,韩涛. 文献-作者二分网络中基于路径组合的合著关系预测研究*[J]. 现代图书情报技术, 2016, 32(10): 42-49.
Zhang Jinzhu,Wang Xiaomei,Han Tao. Predicting Co-authorship with Combination of Paths in Paper-author Bipartite Networks. New Technology of Library and Information Service, 2016, 32(10): 42-49.
链接本文:  
https://manu44.magtech.com.cn/Jwk_infotech_wk3/CN/10.11925/infotech.1003-3513.2016.10.05      或      https://manu44.magtech.com.cn/Jwk_infotech_wk3/CN/Y2016/V32/I10/42
[1] Barabasi A L, Jeong H, Neda Z, et al.Evolution of the Social Network of Scientific Collaborations[J]. Physica A: Statistical Mechanics and Its Applications, 2002, 311(3): 590-614.
[2] Guns R, Rousseau R.Recommending Research Collaborations Using Link Prediction and Random Forest Classifiers[J]. Scientometrics, 2014, 101(2): 1461-1473.
[3] Zhang Q, Xu X, Zhu Y, et al. Measuring Multiple Evolution Mechanisms of Complex Networks [J]. Scientific Reports, 2015, 5: Ariticle No. 10350.
[4] 张斌, 马费成. 科学知识网络中的链路预测研究述评[J]. 中国图书馆学报, 2015, 41(3): 99-113.
[4] (Zhang Bin, Ma Feicheng.A Review on Link Prediction of Scientific Knowledge Network[J]. Journal of Library Science in China, 2015, 41(3): 99-113.)
[5] Zhang J, Han T, Wang X.Uncovering the Mechanism of Knowledge Network Evolution by Link Prediction[J]. Geomatics and Information Science of Wuhan University, 2015, 39(S1): 100-106.
[6] Zhao J, Miao L, Yang J, et al. Prediction of Links and Weights in Networks by Reliable Routes [J]. Scientific Reports, 2015, 5: Ariticle No. 12261.
[7] Lv L, Zhou T.Link Prediction in Complex Networks: A Survey[J]. Physica A: Statistical Mechanics and Its Applications, 2010, 390(6): 1150-1170.
[8] Guns R.Bipartite Networks for Link Prediction: Can They Improve Prediction Performance?[C]. In: Proceedings of International Society for Scientometrics and Informetrics. 2011: 249-260.
[9] Gao M, Chen L, Xu Y.Projection Based Algorithm for Link Prediction in Bipartite Network[J]. Computer Science, 2016, 43(2): 118.
[10] 吴亚晶, 张鹏, 狄增如, 等. 二分网络研究[J]. 复杂系统与复杂性科学, 2010, 7(1): 1-12.
[10] (Wu Yajing, Zhang Peng, Di Zengru, et al.Study on Bipartite Networks[J]. Complex Systems and Complexity Science, 2010, 7(1): 1-12.)
[11] Daminelli S, Thomas J M, Duran C, et al.Common Neighbours and the Local-Community-Paradigm for Topological Link Prediction in Bipartite Networks[J]. New Journal of Physics, 2015, 17. .
[12] Zhou T, Lv L, Zhang Y C.Predicting Missing Links via Local Information[J]. The European Physical Journal B-Condensed Matter and Complex Systems, 2009, 71(4): 623-630.
[13] Hosmer Jr D W, Lemeshow S. Applied Logistic Regression[M]. New York: John Wiley & Sons, 2004.
[14] Güne? ?, Gündüz-??üdücü ?, ?ataltepe Z. Link Prediction Using Time Series of Neighborhood-Based Node Similarity Scores[J]. Data Mining and Knowledge Discovery, 2016, 30(1): 147-180.
[15] Sett N, Singh S R, Nandi S.Influence of Edge Weight on Node Proximity Based Link Prediction Methods: An Empirical Analysis[J]. Neurocomputing, 2016, 172: 71-83.
[1] 陈仕吉, 邱均平, 余波. 基于Overlay图谱的图情领域大数据主题分析*[J]. 数据分析与知识发现, 2021, 5(10): 51-59.
[2] 盛嘉祺, 许鑫. 融合主题相似度与合著网络的学者标签扩展方法研究*[J]. 数据分析与知识发现, 2020, 4(8): 75-85.
[3] 张轩慧, 赵宇翔. 国际公众科学领域演化路径与研究热点分析*[J]. 数据分析与知识发现, 2017, 1(7): 22-34.
[4] 王曰芬,靳嘉林. 比较分析《现代图书情报技术》近10年发文特征与发展趋势*[J]. 现代图书情报技术, 2016, 32(9): 1-16.
[5] 任妮, 周建农. 合著网络加权模式下科研团队的发现与评价研究[J]. 现代图书情报技术, 2015, 31(9): 68-75.
[6] 李盛庆, 蔡国永. 复杂网络领域科研合著网络演化及知识传播特点研究[J]. 现代图书情报技术, 2013, (5): 64-72.
[7] 张金柱. 利用K-shell分析合著网络中的作者传播影响力[J]. 现代图书情报技术, 2012, 28(5): 65-69.
[8] 王继民, 李雷明子, 张鹏. 搜索引擎日志挖掘领域的论文合著网络分析[J]. 现代图书情报技术, 2011, 27(4): 58-63.
[9] 安璐, 李纲. 国外图书情报类期刊热点主题及发展趋势研究[J]. 现代图书情报技术, 2010, 26(9): 48-55.
[10] 李丽蓉 钱巍 冯玉强. 管理信息系统领域的合著网络中作者的广度中心度分析[J]. 现代图书情报技术, 2010, 26(5): 66-72.
[11] 白云,苏新宁. 《现代图书情报技术》载文及引文特征的学术影响力分析——基于CSSCI (2004-2006)年[J]. 现代图书情报技术, 2008, 24(4): 95-102.
[12] 胡群. 《现代图书情报技术》自引分析[J]. 现代图书情报技术, 2004, 20(7): 90-92.
[13] 朱亚丽. 《现代图书情报技术》核心著者测评[J]. 现代图书情报技术, 2004, 20(12): 83-84.
[14] 邱均平,张晓丹. 《现代图书情报技术》的回顾、评价和展望[J]. 现代图书情报技术, 2003, 19(3): 6-7.
[15] 王知津,孙美丽. 1998-2000年《现代图书情报技术》引文及影响因子分析[J]. 现代图书情报技术, 2003, 19(3): 8-11.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
版权所有 © 2015 《数据分析与知识发现》编辑部
地址:北京市海淀区中关村北四环西路33号 邮编:100190
电话/传真:(010)82626611-6626,82624938
E-mail:jishu@mail.las.ac.cn