Abstract
The growth of social networks in modern information systems has enabled the collaboration of experts at a scale that was unseen before. Given a task and a graph of experts where each expert possesses some skills, we tend to find an effective team of experts who are able to accomplish the task. This team should consider how team members collaborate in an effective manner to perform the task as well as how efficient the team assignment is, considering each expert has the minimum required level of skill. Here, we generalize the problem in multiple perspectives. First, a method is provided to determine the skill level of each expert based on his/her skill and collaboration among neighbors. Second, the graph is aggregated to the set of skilled expert groups that are strongly correlated based on their skills as well as the best connection among them. By considering the groups, search space is significantly reduced and moreover it causes to prevent from the growth of redundant communication costs and team cardinality while assigning the team members. Third, the existing RarestFirst algorithm is extended to more generalized version, and finally the cost definition is customized to improve the efficiency of selected team. Experiments on DBLP co-authorship graph show that in terms of efficiency and effectiveness, our proposed framework is achieved well in practice.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Lappas T, Liu K, Terzi E. Finding a team of experts in social networks. In Proc. the 15th ACM Int. Conference on Knowledge Discovery and Data Mining, June 28-July 1, 2009, pp.467–476.
Li C, Shan M. Team formation for generalized tasks in expertise social networks. In Proc. the 2nd SocialCom/PASSAT, Aug. 2010, pp.9–16.
Baykasoglu A, Dereli T, Das S. Project team selection using fuzzy optimization approach. Cybernetics and Systems, 2007, 38(2): 155–185.
Chen S J, Lin L. Modeling team member characteristics for the formation of a multifunctional team in concurrent engineering. IEEE Transactions on Engineering Management, 2004, 51(2): 111–124.
Wi H, Oh S, Mun J, Jung M. A team formation model based on knowledge and collaboration. Expert Syst. Appl., July 2009, 36(5): 9121–9134.
Zakarian A, Kusiak A. Forming teams: An analytical approach. IIE Transactions, 1999, 31(1): 85–97.
Fitzpatrick E L, Askin R G. Forming effective worker teams with multi-functional skill requirements. Journal of Computers & Industrial Engineering, May 2005, 48(3): 593–608.
Gaston M, Simmons J, DesJardins M. Adapting network structures for efficient team formation. In Proc. the AAMAS2004 Workshop on Learning and Evolution in Agent-Based Systems, July 2004.
Kautz H, Selman B, Shah M. The hidden Web. In Proc. the 13th Conference on Uncertainty in Artificial Intelligence, Aug. 1997, pp.27–36.
Cheatham M, Cleereman K. Application of social network analysis to collaborative team formation. In Proc. the Int. Symposium on Collaborative Technologies and Systems, May 2006, pp.306–311.
Backstrom L, Huttenlocher D, Kleinberg J, Lan X. Group formation in large social networks: Membership, growth and evolution. In Proc. the 12th ACM Int. Conference on Knowledge Discovery and Data Mining, Aug. 2006, pp.44–54.
Boon B H, Siersksma G. Team formation: Matching quality supply and quality demand. European Journal of Operational Research, 2003, 148(3): 277–292.
Korvin A D, Shipley M F, Kleyle R. Utilizing fuzzy compatibility of skill sets for team selection in multi-phase projects. Journal of Engineering and Technology Management, September 2002, 19(3-4): 307–319.
Dereli T, Baykasoglu A, Das G S. Fuzzy quality-team formation for value added auditing: A case study. Journal of Engineering and Technology Management, December 2007, 24(4): 366–394.
Liu N N, Yang Q. EigenRank: A ranking-oriented approach to collaborative filtering. In Proc. the 31st SIGIR, July 2008, pp.83–90.
Candillier L, Meyer F, Fessant F. Designing specific weighted similarity measures to improve collaborative filtering systems. In Proc. the 8th IEEE Int. Conference on ICDM, Dec. 2008, pp.242–255.
Faloutsos C, McCurley K S, Tomkins A. Fast discovery of connection subgraph. In Proc. the 10th ACM Int. Conference on Knowledge Discovery and Data Mining, Aug. 2004, pp.118–127.
Tong H, Faloutsos C, Pan J Y. Fast random walk with restart and its application. In Proc. the 6th IEEE Int. Conference on Data Mining, Dec. 2006, pp. 613–622.
Tong H, Faloutsos C. Center-Piece subgraph: Problem definition and fast solution. In Proc. the 12th ACM Int. Conference on Knowledge Discovery and Data Mining, Aug. 2006, pp.404–413.
Tong H, Qu H, Jamjoom H, Faloutsos C. iPoG: Fast interactive proximity querying on graphs. In Proc. the 18th ACM Int. Conference on Information and Knowledge Management, Nov. 2009, pp.1673–1676.
Tong H, Faloutsos C, Gallagher B, Eliassi-Rad T. Fast best effort pattern matching in large attributed graphs. In Proc. the 13th ACM Int. Conference on Knowledge Discovery and Data Mining, Aug. 2007, pp.737–746.
Kasneci G, Ramanath M, Sozio M, Suchanek F M,Weikum G. STAR: Steiner-tree approximation in relationship graphs. In Proc. the 25th IEEE Int. Conference on Data Engineering, March 29-April 2, 2009, pp.868–879.
Cheng J, Ke Y, Ng W, Yu J X. Context-aware object connection discovery in large graphs. In Proc. the IEEE Int. Conference on Data Engineering, 2009, pp.856–867.
Cheng J, Ke Y, Ng W. Efficient processing of group-oriented connection queries in large graph. In Proc. the 18th ACM Int. Conference on Information and Knowledge Management, Nov. 2009, pp.1481–1484.
Resnick P, Iacovou N, Suchak M, Bergstrom P, Riedl J. GroupLens: An open architecture for collaborative filtering of net-news. In Proc. the Conference on Computer Supported Cooperative Work, Oct. 1994, pp.175–186.
Karypis G. Evaluation of item-based top-N recommendation algorithms. In Proc. the 10th ACM Int. Conference on Information and Knowledge Management, Nov. 2001, pp.247–254.
Linden G, Smith B, York J. Amazon com recommendations: Item to item collaborative filtering. IEEE Internet Computing, 2003, 7(1): 76–80.
Deshpande M, Karypis G. Item-based top-N recommendation algorithms. ACM Transactions on Information Systems, 2004, 22(1): 143–177.
Tarjan R E. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1972, 1(2): 146–160.
Author information
Authors and Affiliations
Corresponding author
Electronic Supplementary Material
Below is the link to the electronic supplementary material.
Rights and permissions
About this article
Cite this article
Farhadi, F., Sorkhi, M., Hashemi, S. et al. An Effective Framework for Fast Expert Mining in Collaboration Networks: A Group-Oriented and Cost-Based Method. J. Comput. Sci. Technol. 27, 577–590 (2012). https://doi.org/10.1007/s11390-012-1245-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11390-012-1245-9