%0 Conference Paper %1 10127014 %A Addanki, Bobby Ramesh %A Durga, Bhavani S %B 2023 5th International Conference on Recent Advances in Information Technology (RAIT) %D 2023 %I IEEE %K bench-mark data law myown networks of popularity power problem sets skills social team %P 1-6 %R 10.1109/RAIT57693.2023.10127014 %T Realistic Benchmark Datasets for Team Formation Problem in Social Networks %X Many heuristic algorithms have been proposed in the literature to solve the team formation problem. The researchers considered a project as a set of skills selected randomly from the given pool of skills. But this leads to a skewed distribution of skills in the projects with many skills having very few experts, which we term as rare skills. In this work, we create a realistic bench-mark dataset for this problem. In general, any project/task in the industry can be seen to have a good mix of popular as well as rare skills. We first conduct an empirical study of the distribution of popular skills vs rare skills in the well-known DBLP (Digital Bibliography & Library Project) data set. The distribution of popularity of skills is shown to satisfy a power law with a heavy tail, indicating the presence of a large number of skills with very few experts and a small number of highly popular skills. We build a realistic a benchmark dataset using stratified random sampling to form tasks with various distributions of popular and rare skills. The classical team formation algorithms are evaluated using this new benchmark dataset. The evaluation is done with respect to the available communication costs in the literature as well as the execution time incurred by the algorithms. It has been observed from the experiments that all the measures show lower values of communication cost for tasks having higher proportion of popular skills. %@ 979-8-3503-3570-5

@inproceedings{10127014, abstract = {Many heuristic algorithms have been proposed in the literature to solve the team formation problem. The researchers considered a project as a set of skills selected randomly from the given pool of skills. But this leads to a skewed distribution of skills in the projects with many skills having very few experts, which we term as rare skills. In this work, we create a realistic bench-mark dataset for this problem. In general, any project/task in the industry can be seen to have a good mix of popular as well as rare skills. We first conduct an empirical study of the distribution of popular skills vs rare skills in the well-known DBLP (Digital Bibliography & Library Project) data set. The distribution of popularity of skills is shown to satisfy a power law with a heavy tail, indicating the presence of a large number of skills with very few experts and a small number of highly popular skills. We build a realistic a benchmark dataset using stratified random sampling to form tasks with various distributions of popular and rare skills. The classical team formation algorithms are evaluated using this new benchmark dataset. The evaluation is done with respect to the available communication costs in the literature as well as the execution time incurred by the algorithms. It has been observed from the experiments that all the measures show lower values of communication cost for tasks having higher proportion of popular skills.}, added-at = {2023-10-04T13:48:24.000+0200}, author = {Addanki, Bobby Ramesh and Durga, Bhavani S}, biburl = {https://www.bibsonomy.org/bibtex/2ed4276ad5b4083421cca0dac03d9ac84/abrameshba}, booktitle = {2023 5th International Conference on Recent Advances in Information Technology (RAIT)}, doi = {10.1109/RAIT57693.2023.10127014}, interhash = {6bd4439cb7f625faa70b2ddc1da35900}, intrahash = {ed4276ad5b4083421cca0dac03d9ac84}, isbn = {979-8-3503-3570-5}, keywords = {bench-mark data law myown networks of popularity power problem sets skills social team}, language = {English}, month = {March}, pages = {1-6}, publisher = {IEEE}, timestamp = {2023-10-04T13:48:24.000+0200}, title = {Realistic Benchmark Datasets for Team Formation Problem in Social Networks}, year = 2023 }