Zhu, Y.; Quan, L.; Chen, P.-Y.; Kim, M.C.; Che, C.: Predicting coauthorship using bibliographic network embedding (2023)
0.01
0.0118597075 = product of:
0.035579123 = sum of:
0.035579123 = product of:
0.10673737 = sum of:
0.10673737 = weight(_text_:network in 917) [ClassicSimilarity], result of:
0.10673737 = score(doc=917,freq=10.0), product of:
0.19402927 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.043569047 = queryNorm
0.5501096 = fieldWeight in 917, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0390625 = fieldNorm(doc=917)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Abstract
- Coauthorship prediction applies predictive analytics to bibliographic data to predict authors who are highly likely to be coauthors. In this study, we propose an approach for coauthorship prediction based on bibliographic network embedding through a graph-based bibliographic data model that can be used to model common bibliographic data, including papers, terms, sources, authors, departments, research interests, universities, and countries. A real-world dataset released by AMiner that includes more than 2 million papers, 8 million citations, and 1.7 million authors were integrated into a large bibliographic network using the proposed bibliographic data model. Translation-based methods were applied to the entities and relationships to generate their low-dimensional embeddings while preserving their connectivity information in the original bibliographic network. We applied machine learning algorithms to embeddings that represent the coauthorship relationships of the two authors and achieved high prediction results. The reference model, which is the combination of a network embedding size of 100, the most basic translation-based method, and a gradient boosting method achieved an F1 score of 0.9 and even higher scores are obtainable with different embedding sizes and more advanced embedding methods. Thus, the strengths of the proposed approach lie in its customizable components under a unified framework.
