Shifu2: A Network Representation Learning Based Model for Advisor-Advisee Relationship Mining

  title={Shifu2: A Network Representation Learning Based Model for Advisor-Advisee Relationship Mining},
  author={Jiaying Liu and Feng Xia and Lei Wang and Bo Xu and Xiangjie Kong and Hanghang Tong and Irwin King},
  journal={IEEE Transactions on Knowledge and Data Engineering},
The advisor-advisee relationship represents direct knowledge heritage, and such relationship may not be readily available from academic libraries and search engines. This work aims to discover advisor-advisee relationships hidden behind scientific collaboration networks. For this purpose, we propose a novel model based on Network Representation Learning (NRL), namely Shifu2, which takes the collaboration network as input and the identified advisor-advisee relationship as output. In contrast to… 

RPT: Toward Transferable Model on Heterogeneous Researcher Data via Pre-Training

A multi-task self-supervised learning-based researcher data pre-training model named RPT, which is efficient to accomplish multiple researcher data mining tasks and leverages contrastive learning to discriminate whether these captured two kinds of information belong to the same researcher.

MIRROR: Mining Implicit Relationships via Structure-Enhanced Graph Convolutional Networks

A novel research topic, how to identify implicit relationships across heterogeneous networks is proposed, and an efficient solution, namely MIRROR, a graph convolutional network (GCN) model to infer implicit ties under explicit connections is proposed.

Mining Multivariate Implicit Relationships in Academic Networks

  • Bo Xu
  • Computer Science
  • 2022
Based on the attributes of the node, edge, and network, the Capsule Network was transfered to multivariate relation analysis and the experimental results proved the simplicity and reliability of this model.

Mining Multivariate Implicit Relationships in Academic Networks

Based on the attributes of the node, edge, and network, the Capsule Network was transfered to multivariate relation analysis and the experimental results proved the simplicity and reliability of this model.

Attributed Collaboration Network Embedding for Academic Relationship Mining

This paper presents a meta-modelling architecture that automates the very labor-intensive and therefore time-heavy and expensive and expensive process of manually cataloging and cataloging scholarly data.

Network Completion with Auto-regressive Graph Generative Model

Recurrent Attention Network Completion is proposed, an efficient model to recover the missing parts of the network based on an auto-regressive graph generative model and outperforms state-of-the-art network completion methods.

Network Representation Learning: From Traditional Feature Learning to Deep Learning

Network representation learning (NRL) is an effective graph analytics technique and promotes users to deeply understand the hidden characteristics of graph data. It has been successfully applied in

S2AMP: A High-Coverage Dataset of Scholarly Mentorship Inferred from Publications

This work contributes two datasets to the study of mentorship, one of which has over 300,000 ground truth academic mentor-mentee pairs obtained from multiple diverse, manually-curated sources, and linked to the Semantic Scholar (S2) knowledge graph.

Relational Structure-Aware Knowledge Graph Representation in Complex Space

This work proposes a novel knowledge graph representation model in complex space, namely MARS, to exploit complex relations to embed knowledge graphs, and significantly outperforms existing state-of-the-art models for link prediction and triple classification.



Shifu: Deep Learning Based Advisor-advisee Relationship Mining in Scholarly Big Data

This work proposes Shifu, a deep-learning-based advisor-advisee relationship identification method which takes into account both the local properties and network characteristics and demonstrates that the proposed method outperforms other state-of-the-art machine learning methods in precision.

Mining advisor-advisee relationships from research publication networks

A time-constrained probabilistic factor graph model (TPFG), which takes a research publication network as input and models the advisor-advisee relationship mining problem using a jointly likelihood objective function is proposed and an efficient learning algorithm is designed to optimize the objective function.

Understanding the advisor–advisee relationship via scholarly data analysis

It is found that with the increase of advisors’ academic age, advisees’ performance experiences an initial growth, follows a sustaining stage, and finally ends up with a declining trend.

CANE: Context-Aware Network Embedding for Relation Modeling

Context-Aware Network Embedding (CANE), a novel NE model that learns context-aware embeddings for vertices with mutual attention mechanism and is expected to model the semantic relationships between vertices more precisely, is presented.

TransNet: Translation-Based Network Representation Learning for Social Relation Extraction

A novel Translation-based NRL model, TransNet, is presented by regarding the interactions between vertices as a translation operation, and it is demonstrated that TransNet significantly outperforms other baseline methods by 10% to 20% on hits@1.

GraRep: Learning Graph Representations with Global Structural Information

A novel model for learning vertex representations of weighted graphs that integrates global structural information of the graph into the learning process and significantly outperforms other state-of-the-art methods in such tasks.

Network Representation Learning with Rich Text Information

By proving that DeepWalk, a state-of-the-art network representation method, is actually equivalent to matrix factorization (MF), this work proposes text-associated DeepWalk (TADW), which incorporates text features of vertices into network representation learning under the framework of Matrix factorization.

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.

Relationship Identification for Social Network Discovery

A supervised ranking approach is proposed to the challenge of relationship identification where the objective is to identify relevant communications that substantiate a given social relationship type and its performance on a manager-subordinate relationship identification task using the Enron email corpus is assessed.