TY - GEN
T1 - Staffing open collaborative projects based on the degree of acquaintance
AU - Allaho, Mohammad Y.
AU - Lee, Wang-chien
AU - Yang, De Nian
PY - 2013/12/1
Y1 - 2013/12/1
N2 - We consider the team formation problem in open collaborative projects existing in large community setting such as the Open Source Software (OSS) community. Given a query specifying a set of required skills for an open project and an upper bound of team size, the goal is to find a team that maximizes the Degree of Acquaintance (DoA) and covers all the required skills in the query. We define the DoA in terms of the team graph connectivity and edge weights, corresponding to the local Clustering Coefficient for each team member and the strength of social ties between the team members, respectively. We perform a statistical analysis on historical data to show the importance of the connectivity and social tie strength to the overall productivity of the teams in open projects. We show that the problem defined is NP-hard and present three algorithms, namely, PSTA, STA and NFA, to solve the problem. We experiment the algorithms on a dataset from the OSS community. The results show the effectiveness of the proposed algorithms to find a well acquainted teams satisfying a given query.
AB - We consider the team formation problem in open collaborative projects existing in large community setting such as the Open Source Software (OSS) community. Given a query specifying a set of required skills for an open project and an upper bound of team size, the goal is to find a team that maximizes the Degree of Acquaintance (DoA) and covers all the required skills in the query. We define the DoA in terms of the team graph connectivity and edge weights, corresponding to the local Clustering Coefficient for each team member and the strength of social ties between the team members, respectively. We perform a statistical analysis on historical data to show the importance of the connectivity and social tie strength to the overall productivity of the teams in open projects. We show that the problem defined is NP-hard and present three algorithms, namely, PSTA, STA and NFA, to solve the problem. We experiment the algorithms on a dataset from the OSS community. The results show the effectiveness of the proposed algorithms to find a well acquainted teams satisfying a given query.
UR - http://www.scopus.com/inward/record.url?scp=84892893757&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84892893757&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-37450-0_29
DO - 10.1007/978-3-642-37450-0_29
M3 - Conference contribution
AN - SCOPUS:84892893757
SN - 9783642374494
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 385
EP - 400
BT - Database Systems for Advanced Applications - 18th International Conference, DASFAA 2013, Proceedings
T2 - 18th International Conference on Database Systems for Advanced Applications, DASFAA 2013
Y2 - 22 April 2013 through 25 April 2013
ER -