Promoting Research Collaboration with Open Data Driven Team Recommendation in Response to Call for Proposals

• URL: http://arxiv.org/abs/2309.09404v5
• Date: Thu, 25 Jan 2024 16:22:56 GMT
• Title: Promoting Research Collaboration with Open Data Driven Team Recommendation in Response to Call for Proposals
• Authors: Siva Likitha Valluru, Biplav Srivastava, Sai Teja Paladi, Siwen Yan, Sriraam Natarajan
• Abstract summary: 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.
• Score: 10.732914229005903
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Building teams and promoting collaboration are two very common business activities. An example of these are seen in the TeamingForFunding problem, where research institutions and researchers are interested to identify collaborative opportunities when applying to funding agencies in response to latter's calls for proposals. We describe a novel system to recommend teams using a variety of AI methods, such that (1) each team achieves the highest possible skill coverage that is demanded by the opportunity, and (2) the workload of distributing the opportunities is balanced amongst the candidate members. We address these questions by extracting skills latent in open data of proposal calls (demand) and researcher profiles (supply), normalizing them using taxonomies, and creating efficient algorithms that match demand to supply. We create teams to maximize goodness along a novel metric balancing short- and long-term objectives. We validate the success of our algorithms (1) quantitatively, by evaluating the recommended teams using a goodness score and find that more informed methods lead to recommendations of smaller number of teams but higher goodness, and (2) qualitatively, by conducting a large-scale user study at a college-wide level, and demonstrate that users overall found the tool very useful and relevant. Lastly, we evaluate our system in two diverse settings in US and India (of researchers and proposal calls) to establish generality of our approach, and deploy it at a major US university for routine use.

Related papers

• Advanced Academic Team Worker Recommendation Models [0.1864807003137943]
  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.
  arXiv  Detail & Related papers  (2024-02-07T22:37:18Z)
• The Shifted and The Overlooked: A Task-oriented Investigation of User-GPT Interactions [114.67699010359637]
  We analyze a large-scale collection of real user queries to GPT. We find that tasks such as design'' and planning'' are prevalent in user interactions but are largely neglected or different from traditional NLP benchmarks.
  arXiv  Detail & Related papers  (2023-10-19T02:12:17Z)
• Benchmarking Robustness and Generalization in Multi-Agent Systems: A Case Study on Neural MMO [50.58083807719749]
  We present the results of the second Neural MMO challenge, hosted at IJCAI 2022, which received 1600+ submissions. This competition targets robustness and generalization in multi-agent systems. We will open-source our benchmark including the environment wrapper, baselines, a visualization tool, and selected policies for further research.
  arXiv  Detail & Related papers  (2023-08-30T07:16:11Z)
• A Reinforcement Learning-assisted Genetic Programming Algorithm for Team Formation Problem Considering Person-Job Matching [70.28786574064694]
  A reinforcement learning-assisted genetic programming algorithm (RL-GP) is proposed to enhance the quality of solutions. The hyper-heuristic rules obtained through efficient learning can be utilized as decision-making aids when forming project teams.
  arXiv  Detail & Related papers  (2023-04-08T14:32:12Z)
• Assisting Human Decisions in Document Matching [52.79491990823573]
  We devise a proxy matching task that allows us to evaluate which kinds of assistive information improve decision makers' performance. We find that providing black-box model explanations reduces users' accuracy on the matching task. On the other hand, custom methods that are designed to closely attend to some task-specific desiderata are found to be effective in improving user performance.
  arXiv  Detail & Related papers  (2023-02-16T17:45:20Z)
• Artificial Intelligence for Scientific Research: Authentic Research Education Framework [6.772344064510275]
  We implement a program in which teams of students with complementary skills develop useful artificial intelligence (AI) solutions for researchers in natural sciences. Our approach also directly benefits scientists, who get an opportunity to evaluate the usefulness of machine learning for their specific needs.
  arXiv  Detail & Related papers  (2022-09-19T16:50:05Z)
• ULTRA: A Data-driven Approach for Recommending Team Formation in Response to Proposal Calls [5.75290474288665]
  We introduce an emerging AI-based approach and prototype system for assisting team formation when researchers respond to calls for proposals from funding agencies. This is an instance of the general problem of building teams when demand opportunities come periodically and potential members may vary over time.
  arXiv  Detail & Related papers  (2022-01-13T02:48:42Z)
• Distributed Deep Learning in Open Collaborations [49.240611132653456]
  We propose a novel algorithmic framework designed specifically for collaborative training. We demonstrate the effectiveness of our approach for SwAV and ALBERT pretraining in realistic conditions and achieve performance comparable to traditional setups at a fraction of the cost.
  arXiv  Detail & Related papers  (2021-06-18T16:23:13Z)
• 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)
• Exploration in two-stage recommender systems [79.50534282841618]
  Two-stage recommender systems are widely adopted in industry due to their scalability and maintainability. A key challenge of this setup is that optimal performance of each stage in isolation does not imply optimal global performance. We propose a method of synchronising the exploration strategies between the ranker and the nominators.
  arXiv  Detail & Related papers  (2020-09-01T16:52:51Z)
• A Stochastic Team Formation Approach for Collaborative Mobile Crowdsourcing [1.4209473797379666]
  We develop an algorithm that exploit workers knowledge about their SN neighbors and asks a designated leader to recruit a suitable team. The proposed algorithm is inspired from the optimal stopping strategies and uses the odds-algorithm to compute its output. Experimental results show that, compared to the benchmark exponential optimal solution, the proposed approach reduces time and produces reasonable performance results.
  arXiv  Detail & Related papers  (2020-04-28T22:44:37Z)

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.