Advanced Academic Team Worker Recommendation Models

• URL: http://arxiv.org/abs/2402.16876v1
• Date: Wed, 7 Feb 2024 22:37:18 GMT
• Title: Advanced Academic Team Worker Recommendation Models
• Authors: Mi Wu
• Abstract summary: We propose a new task: academic team worker recommendation. We can recommend an academic team formed as (prime professor, assistant professor, student) The experiment results show the effectiveness of the proposed method.
• Score: 0.1864807003137943
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Collaborator recommendation is an important task in academic domain. Most of the existing approaches have the assumption that the recommendation system only need to recommend a specific researcher for the task. However, academic successes can be owed to productive collaboration of a whole academic team. In this work, we propose a new task: academic team worker recommendation: with a given status: student, assistant professor or prime professor, research interests and specific task, we can recommend an academic team formed as (prime professor, assistant professor, student). For this task, we propose a model CQBG-R(Citation-Query Blended Graph-Ranking). The key ideas is to combine the context of the query and the papers with the graph topology to form a new graph(CQBG), which can target at the research interests and the specific research task for this time. The experiment results show the effectiveness of the proposed method.

Related papers

• Promoting Research Collaboration with Open Data Driven Team Recommendation in Response to Call for Proposals [10.732914229005903]
  We describe a novel system to recommend teams using a variety of AI methods. We create teams to maximize goodness along a metric balancing short- and long-term objectives.
  arXiv  Detail & Related papers  (2023-09-18T00:04:08Z)
• Zero-shot Item-based Recommendation via Multi-task Product Knowledge Graph Pre-Training [106.85813323510783]
  This paper presents a novel paradigm for the Zero-Shot Item-based Recommendation (ZSIR) task. It pre-trains a model on product knowledge graph (PKG) to refine the item features from PLMs. We identify three challenges for pre-training PKG, which are multi-type relations in PKG, semantic divergence between item generic information and relations and domain discrepancy from PKG to downstream ZSIR task.
  arXiv  Detail & Related papers  (2023-05-12T17:38:24Z)
• Reinforcement Learning with Success Induced Task Prioritization [68.8204255655161]
  We introduce Success Induced Task Prioritization (SITP), a framework for automatic curriculum learning. The algorithm selects the order of tasks that provide the fastest learning for agents. We demonstrate that SITP matches or surpasses the results of other curriculum design methods.
  arXiv  Detail & Related papers  (2022-12-30T12:32:43Z)
• Few-shot Relational Reasoning via Connection Subgraph Pretraining [81.30830261527231]
  Connection Subgraph Reasoner (CSR) can make predictions for the target few-shot task directly without the need for pre-training. Our framework can already perform competitively to existing methods on target few-shot tasks.
  arXiv  Detail & Related papers  (2022-10-13T04:35:14Z)
• Detection, Disambiguation, Re-ranking: Autoregressive Entity Linking as a Multi-Task Problem [46.028180604304985]
  We propose an autoregressive entity linking model, that is trained with two auxiliary tasks, and learns to re-rank generated samples at inference time. We show through ablation studies that each of the two auxiliary tasks increases performance, and that re-ranking is an important factor to the increase.
  arXiv  Detail & Related papers  (2022-04-12T17:55:22Z)
• Arch-Graph: Acyclic Architecture Relation Predictor for Task-Transferable Neural Architecture Search [96.31315520244605]
  Arch-Graph is a transferable NAS method that predicts task-specific optimal architectures. We show Arch-Graph's transferability and high sample efficiency across numerous tasks. It is able to find top 0.16% and 0.29% architectures on average on two search spaces under the budget of only 50 models.
  arXiv  Detail & Related papers  (2022-04-12T16:46:06Z)
• Heterogeneous Graph Learning for Explainable Recommendation over Academic Networks [14.99215332381067]
  This study aims to understand the behavior of academic job transition and hence recommend suitable institutions for PhD graduates. The design is built on top of scholarly/academic networks, which contains abundant information about scientific collaboration among scholars and institutions. We propose scholar attention and meta-path attention to discover the hidden relationships between several meta-paths.
  arXiv  Detail & Related papers  (2022-02-16T02:40:09Z)
• Towards Collaborative Question Answering: A Preliminary Study [63.91687114660126]
  We propose CollabQA, a novel QA task in which several expert agents coordinated by a moderator work together to answer questions that cannot be answered with any single agent alone. We make a synthetic dataset of a large knowledge graph that can be distributed to experts. We show that the problem can be challenging without introducing prior to the collaboration structure, unless experts are perfect and uniform.
  arXiv  Detail & Related papers  (2022-01-24T14:27:00Z)
• An Explanatory Query-Based Framework for Exploring Academic Expertise [10.887008988767061]
  Finding potential collaborators in institutions is a time-consuming manual search task prone to bias. We propose a novel query-based framework for searching, scoring, and exploring research expertise automatically. We show that our simple method is effective in identifying matches, while satisfying desirable properties and being efficient.
  arXiv  Detail & Related papers  (2021-05-28T10:48:08Z)
• UniNet: Next Term Course Recommendation using Deep Learning [0.0]
  We propose a deep learning approach to represent how chronological order of course grades affects the probability of success. We have shown that it is possible to obtain a performance of 81.10% on AUC metric using only grade information. This is shown to be meaningful across different student GPA levels and course difficulties.
  arXiv  Detail & Related papers  (2020-09-20T00:07:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.