Please wait a minute...
New Technology of Library and Information Service  2016, Vol. 32 Issue (10): 42-49    DOI: 10.11925/infotech.1003-3513.2016.10.05
Orginal Article Current Issue | Archive | Adv Search |
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
Export: BibTeX | EndNote (RIS)      

[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     
Received: 15 June 2016      Published: 23 November 2016

Cite this article:

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.

URL:     OR

[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] Chen Shiji, Qiu Junping, Yu Bo. Topic Analysis of LIS Big Data Research with Overlay Mapping[J]. 数据分析与知识发现, 2021, 5(10): 51-59.
[2] Sheng Jiaqi, Xu Xin. Expanding Scholar Labels with Research Similarity and Co-authorship Network[J]. 数据分析与知识发现, 2020, 4(8): 75-85.
[3] Zhang Xuanhui,Zhao Yuxiang. Evolution Path and Hot Topics of Citizen Science Studies[J]. 数据分析与知识发现, 2017, 1(7): 22-34.
[4] Shen Gengyu, Huang Shuiqing, Wang Dongbo. On the Scientific Research Teams Identification Method Taking Co-authorship of Collaboration as the Source Data[J]. 现代图书情报技术, 2013, 29(1): 57-62.
[5] Li Shuqing, Bai Yun. The Analysis of Research Trend in Library and Information Science Based on Hotspot Recognition of Timing Keywords (2000-2009)[J]. 现代图书情报技术, 2011, 27(5): 69-76.
[6] Wang Jimin, Lilei Mingzi, Zhang Peng. Co-authorship Network Analysis in the Research Field of Search Engine’s Log Mining[J]. 现代图书情报技术, 2011, 27(4): 58-63.
[7] Li Lirong Qian Wei Feng Yuqiang. Analysis of Author’s Extensity Centrality in Co-authorship Networks in the Field of Management Information Systems[J]. 现代图书情报技术, 2010, 26(5): 66-72.
[8] Dong Hui,Yu Chuanming. Principle and Realization of “Virtual Library of Library and Information Science”[J]. 现代图书情报技术, 2000, 16(3): 9-12.
  Copyright © 2016 Data Analysis and Knowledge Discovery   Tel/Fax:(010)82626611-6626,82624938