Skip to content

Commit 5e5c83c

Browse files
Update README.md
1 parent b42d018 commit 5e5c83c

File tree

1 file changed

+61
-14
lines changed

1 file changed

+61
-14
lines changed

docs/survey/graph/README.md

Lines changed: 61 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -1,40 +1,77 @@
11
This repository contains supplementary materials for our published survey paper:
22

33

4-
<h1 align="center">
4+
<h1 align="center" style="border-bottom: none;">
55
<a href="https://[example.com](https://hosseinfani.github.io/res/papers/2025_CSUR_A_Survey_of_Subgraph_Optimization_for_Expert_Team_Formation.pdf)"><strong>A Survey of Subgraph Optimization for Expert Team Formation</strong></a>
66
</h1>
77

8-
# Journal Highlight
8+
![#25D9C8](https://placehold.co/15x15/25D9C8/25D9C8.png) **Journal Highlight**
99

10-
[**ACM Computing Surveys**](https://dl.acm.org/journal/csur)
10+
> **[ACM Computing Surveys](https://dl.acm.org/journal/csur):**
11+
12+
13+
> **Impact Factor:**
14+
23.8
1115

12-
**Impact Factor:** 23.8
16+
> **H-Index:**
17+
232
1318

14-
**H-Index:** 232
19+
> **Ranking:**
20+
1st out of 143 journals in Computer Science – Theory & Methods
21+
22+
23+
![#25D9C8](https://placehold.co/15x15/25D9C8/25D9C8.png) **Timeline**
24+
25+
> **Started:**
26+
June 5, 2021
27+
28+
29+
> **Submitted:**
30+
November 22, 2023
31+
32+
> **[First Round Review:](https://hosseinfani.github.io/res/papers/2025_CSUR_R1_A_Survey_of_Subgraph_Optimization_for_Expert_Team_Formation.pdf)**
33+
October 11, 2024
34+
35+
> **[Second Round Review:](https://hosseinfani.github.io/res/papers/2025_CSUR_R2_A_Survey_of_Subgraph_Optimization_for_Expert_Team_Formation.pdf)**
36+
March 1, 2025
37+
38+
> **[Notification of Acceptance:](https://hosseinfani.github.io/res/papers/2025_CSUR_R3_A_Survey_of_Subgraph_Optimization_for_Expert_Team_Formation.txt)**
39+
May 8, 2025
1540

16-
**Ranking:** 1st out of 143 journals in Computer Science – Theory & Methods
1741

18-
<h2 style="border-bottom: none;">Timeline</h2>
1942
________________________________________________________________________________________________________________________________________________________
2043

2144
Expert Team Formation is the search for gathering a team of experts who are expected to collaboratively work towards accomplishing a given project, a problem that has historically been solved in a variety of ways, including manually in a time-consuming and bias-filled manner, and algorithmically within disciplines like social sciences and management. In the present effort, while providing a taxonomy to distinguish between search-based versus learning-based approaches, we survey graph-based studies from the search-based category, motivated as they comprise the mainstream. We present a unifying and vetted overview of the various definitions in this realm, scrutinize assumptions, and identify shortfalls. We start by reviewing initial approaches to the Expert Team Formation problem to lay the conceptual foundations and set forth the necessary notions for a more grounded view of this realm. Next, we provide a detailed view of graph-based Expert Team Formation approaches based on the objective functions they optimize. We lay out who builds on whom and how algorithms have evolved to solve the drawbacks of previous works. Further, we categorize evaluation schemas and elaborate on metrics and insights that can be drawn from each. Referring to the evaluation schemas and metrics, we compare works and propose future directions.
2245

23-
Within the search-based category, operations research, by and large, optimizes the mutually independent selection of experts, overlooking the organizational and collaborative ties among individuals [^1][^4][^5][^6]. However, graph-based methods rely on the premise that a team is inherently relational and is a property of the interaction among the experts and how effectively they can collaborate. Moreover,
24-
learning-based methods have been proposed to bring efficiency while enhancing efficacy due to their iterative and online learning procedure [^7][^8]. As seen in Figure 1, there is an overlap between team formation approaches. As an instance, graph-based and operations research-based methods, where optimization functions have been defined based on linear or nonlinear equation of Boolean variables
25-
representing edges on the expert graph [^9]. Additionally, learning-based methods utilize the expert graph to learn vector representations of skills using graph neural networks (GNNs), which helps reduce the complexity of neural models at the input layer [^12]. Specifically, graph neural networks [^10][^11] provide an effective and efficient general framework for solving graph analytics problems by converting
26-
a graph into a low-dimensional vector space while preserving its graph-structured information. Having demonstrated strong performances across a wide range of problems, including natural language processing [^13], knowledge graphs [^14] and recommender systems [^15], graph neural networks are gradually finding their application in Expert Team Formation [^12].
46+
Team formation involves selecting experts with certain skills to form a successful task-oriented team. Team formation approaches can be distinguished based on the way optimizations are performed: i) search-based, where the search for an *almost surely* successful team (optimum team) is carried out over the subgraphs of an expert graph using subgraph optimization methods, or it is performed on subsets of experts as variants of the set cover problem [^1][^2][^3] using operations research (OR) techniques including integer linear/nonlinear programming, and ii) learning-based, where machine learning approaches are used to learn the distributions of experts and skills in the context of previous (un)successful teams in order to draw
47+
future successful teams.
48+
49+
<div align="center">
50+
<img src="figures/figs_draft/methods-survey.png" alt="Figure1: A taxonomy of the computational Expert Team Formation methods." width="800" >
51+
<p align="center"><em>Figure1: A taxonomy of the computational Expert Team Formation methods.</em></p>
52+
</div>
53+
54+
Within the search-based category, operations research, by and large, optimizes the mutually independent selection of experts, overlooking the organizational and collaborative ties among individuals [^1][^4][^5][^6]. However, graph-based methods rely on the premise that a team is inherently relational and is a property of the interaction among the experts and how effectively they can collaborate. Moreover, learning-based methods have been proposed to bring efficiency while enhancing efficacy due to their iterative and online learning procedure [^7][^8]. As seen in Figure 1, there is an overlap between team formation approaches. As an instance, graph-based and operations research-based methods, where optimization functions have been defined based on linear or nonlinear equation of Boolean variables representing edges on the expert graph [^9].
55+
56+
From Figure 2, recently, a paradigm shift to machine learning-based methods, including artificial neural networks and graph neural networks [^12][^16][^17][^18][^19], has been observed due to advanced hardware computing power, especially graphic processing units (GPUs) and tensor processing units (TPUs), that reduced elapsed time from months to days and/or hours opening doors to the analysis of massive collections of candidates coming from different fields. These methods are different from search-based solutions in that they *learn* the inherent structure of the ties among candidates and their skills. Wherein, all past successful and *un*successful team compositions are considered as training samples to predict future teams and the team's performance. Learning-based methods bring efficiency while enhancing efficacy due to the inherently *iterative* and *online* learning procedure, and can address the limitations of search-based solutions with respect to scalability. This line of research started with Sapienza et al. [^20] who employed a non-variational autoencoder neural network architecture and is being followed by researchers through other neural-based architectures such as variational Bayesian neural network [^8][^7][^21][^22][^23].
57+
58+
Although learning-based literature is novel, it is still in its early stages. We chose to survey the graph-based approaches as they comprise the mainstream and a relatively larger body of research to be investigated in a survey such as the present one. Further, this body of work serves as a prelude to the learning-based works, especially the ones based on graph neural network in terms of the Expert Team Formation problem definition as well as experimental and evaluation settings. We are however tracing the learning-based paradigm's literature and its progress for a future potential survey.
2759

2860
<p align="center">
29-
<img src="figures/figs_draft/venn.png" alt="Figure1: Overlapping Team Formation Approaches">
61+
<img src="figures/figs_draft/alluvial_new.png" alt="Figure2: Expert Team Formation methods in time;.">
62+
<p align="center"><em>Figure2: Expert Team Formation methods in time;.</em></p>
3063
</p>
3164

3265
This survey pertains to the graph-based Expert Team Formation algorithms, that is, those that employ graphs to model the experts’ collaboration ties followed by subgraph optimization algorithms, as they comprise the mainstream body of research. While some OR-based works model the dataset as a graph structure, they opt for linear/non-linear integer/real programming methods as opposed to subgraph optimization. In this survey, we include works that not only model the data as graphs but also apply subgraph optimization methods. We exclude works that are based on operations research and learning-based methods, as they differ fundamentally from subgraph optimization algorithms. We recognize the importance of these areas and the wealth of work they include, but a thorough analysis of them is beyond the scope of this work and merits separate surveys.
3366

67+
<p align="center">
68+
<img src="figures/figs_draft/venn.png" alt="Figure3: Overlapping Team Formation Approaches.">
69+
<p align="center"><em>Figure3: Overlapping Team Formation Approaches.</em></p>
70+
</p>
71+
3472

73+
After screening 126 papers addressing Team Formation problems using computational and non-computational models, we present a comprehensive overview of 17 seminal graph-based research papers on the Expert Team Formation problem within the scope of our survey, including 18 unique objectives, to be optimized via 63 subgraph optimization algorithms considering variations of their exact algorithms and the heuristics they used to address the efficiency of their algorithms. Our survey brings forth a unifying and vetted methodology to review the various definitions of the notions, criticizes assumptions and comparative benchmarks, and points out shortfalls to smooth the path for future research directions. It targets the information retrieval (IR) and recommender systems (RecSys) research communities to propose new Expert Team Formation solutions and evaluate their effectiveness compared to existing methods and on datasets from various domains. Further, having regard to the unified comparative analysis, organizations and practitioners can compare different models and readily pick the most suitable one for their application to form teams of experts whose success is almost surely guaranteed.
3574

36-
We present a comprehensive overview of 18 seminal graph-based solutions to the Team Formation problem,
37-
including 13 proposed optimization objectives, after screening 63 algorithms from 126 papers.
3875
The examined papers in this survey can be categorized as follows:
3976

4077
[^1]: M. Muniz et al. A column generation approach for the team formation problem. https://www.sciencedirect.com/science/article/pii/S0305054823002708.
@@ -52,6 +89,16 @@ The examined papers in this survey can be categorized as follows:
5289
[^13]: L. Wu et al. Graph Neural Networks for Natural Language Processing: A Survey. https://www.nowpublishers.com/article/Details/MAL-096.
5390
[^14]: Z. Ye et al. A Comprehensive Survey of Graph Neural Networks for Knowledge Graphs. https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=9831453.
5491
[^15]: S. Wu et al. Graph Neural Networks in Recommender Systems: A Survey. https://dl.acm.org/doi/pdf/10.1145/3535101.
92+
[^16]: M. J. Ahmed et al. Vector Representation Learning of Skills for Collaborative Team Recommendation. https://link.springer.com/chapter/10.1007/978-981-96-0567-5_15.
93+
[^17]: H. Fani et al. A Streaming Approach to Neural Team Formation Training. https://link.springer.com/chapter/10.1007/978-3-031-56027-9_20.
94+
[^18]: R. Barzegar et al. Adaptive Loss-based Curricula for Neural Team Recommendation. https://dl.acm.org/doi/pdf/10.1145/3701551.3703574.
95+
[^19]: K. Thang et al. Translative Neural Team Recommendation: From Multilabel Classification to Sequence Prediction.https://hosseinfani.github.io/res/papers/2025_SIGIR_Translative_Neural_Team_Recommendation_From_Multilabel_Classification_to_Sequence_Prediction.pdf.
96+
[^20]: A. Sapienza et al. {Deep Neural Networks for Optimal Team Composition.https://www.frontiersin.org/journals/big-data/articles/10.3389/fdata.2019.00014/full.
97+
[^21]: R. Hamidi Rad et al. Learning to Form Skill-based Teams of Experts. https://dl.acm.org/doi/pdf/10.1145/3340531.3412140.
98+
[^22]: R. Hamidi Rad et al. A Variational Neural Architecture for Skill-based Team Formation. https://dl.acm.org/doi/pdf/10.1145/3589762.
99+
[^23]: B. Liu et al. Coach-Player Multi-agent Reinforcement Learning for Dynamic Team Composition. https://proceedings.mlr.press/v139/liu21m/liu21m.pdf.
100+
101+
55102
```
56103
57104

0 commit comments

Comments
 (0)