CoBERT: Scientific Collaboration Prediction via Sequential Recommendation

  title={CoBERT: Scientific Collaboration Prediction via Sequential Recommendation},
  author={Tobias Koopmann and Konstantin Kobs and Konstantin Herud and Andreas Hotho},
  journal={2021 International Conference on Data Mining Workshops (ICDMW)},
Collaborations are an Important factor for scientific success, as the joint work leads to results individual scientists cannot easily reach. Recommending collaborations automatically can alleviate the time consuming and tedious search for potential collaborators. Usually, such recommendation systems rely on graph structures modeling co-authorship of papers and content-based relations such as similar paper keywords. Models are then trained to estimate the probability of links between certain… 
1 Citations

Figures and Tables from this paper

Effective and Efficient Training for Sequential Recommendation using Recency Sampling

A novel Recency-based Sampling of Sequences training objective that addresses both limitations of current sequential recommender systems and can achieve performances exceeding or very close to state-of-the-art BERT4Rec, but with much less training time.



Co-author Relationship Prediction in Heterogeneous Bibliographic Networks

Experiments are presented on a real bibliographic network, the DBLP network, which show that metapath-based heterogeneousTopological features can generate more accurate prediction results as compared to homogeneous topological features.

Co-author Relationship Prediction in Bibliographic Network: A New Approach Using Geographic Factor and Latent Topic Information

A supervised method to predict the co-author relationship formation where combining dissimilar features with the dissimilar measuring coefficient is utilized, and content feature based on textual information from author's papers is discovered using topic modeling.

Computational Approaches for Predicting Biomedical Research Collaborations

It is found that the most informative semantic features for author collaborations are related to research interest, including similarity of out-citing citations, similarity of abstracts, and logistic regression.

Integrating Keywords into BERT4Rec for Sequential Recommendation

KeBERT4Rec is proposed, a modification of BERT4Rec, which utilizes keyword descriptions of items, and two variants for adding keywords to the model are compared on two datasets, a Movielens dataset and a dataset of an online fashion store.

Proximity dimensions and the emergence of collaboration: a HypTrails study on German AI research

It is found that social proximity and cognitive proximity are more important for the emergence of collaboration than geographic proximity.

Self-Attentive Sequential Recommendation

Extensive empirical studies show that the proposed self-attention based sequential model (SASRec) outperforms various state-of-the-art sequential models (including MC/CNN/RNN-based approaches) on both sparse and dense datasets.

LINE: Large-scale Information Network Embedding

A novel network embedding method called the ``LINE,'' which is suitable for arbitrary types of information networks: undirected, directed, and/or weighted, and optimizes a carefully designed objective function that preserves both the local and global network structures.

Session-based Recommendations with Recurrent Neural Networks

It is argued that by modeling the whole session, more accurate recommendations can be provided by an RNN-based approach for session-based recommendations, and introduced several modifications to classic RNNs such as a ranking loss function that make it more viable for this specific problem.

Construction of the Literature Graph in Semantic Scholar

This paper reduces literature graph construction into familiar NLP tasks, point out research challenges due to differences from standard formulations of these tasks, and report empirical results for each task.

node2vec: Scalable Feature Learning for Networks

In node2vec, an algorithmic framework for learning continuous feature representations for nodes in networks, a flexible notion of a node's network neighborhood is defined and a biased random walk procedure is designed, which efficiently explores diverse neighborhoods.