We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 27 Issue 3
May  2012
Turn off MathJax
Article Contents
Abstract
References
Related Articles
Farnoush Farhadi, Maryam Sorkhi, Sattar Hashemi, Ali Hamzeh. An Effective Framework for Fast Expert Mining in Collaboration Networks: A Group-Oriented and Cost-Based Method[J]. Journal of Computer Science and Technology, 2012, 27(3): 577-590. DOI: 10.1007/s11390-012-1245-9
Citation: Farnoush Farhadi, Maryam Sorkhi, Sattar Hashemi, Ali Hamzeh. An Effective Framework for Fast Expert Mining in Collaboration Networks: A Group-Oriented and Cost-Based Method[J]. Journal of Computer Science and Technology, 2012, 27(3): 577-590. DOI: 10.1007/s11390-012-1245-9
shu

An Effective Framework for Fast Expert Mining in Collaboration Networks: A Group-Oriented and Cost-Based Method

  • School of Electrical and Computer Engineering, Shiraz University, Shiraz, Iran

More Information
  • Author Bio:

    Farnoush Farhadi received her B.Sc degree from Shahid Beheshti University, Iran in 2005 majored in software engineering. She is cur-rently a graduate student of artificial intelligent in School of Electrical and Computer Engineering, Shiraz Uni-versity, Shiraz, Iran. She is a mem-ber of the soft computing group of her school since September 2008 with Professors Sattar Hashemi and Ali Hamzeh. Her research interest is in large-scale data mining for graphs, query an-swering, task assignment and social networks. Her current task focuses on team formation in collaboration networks regarding team performance.

  • Received Date: August 31, 2011
  • Revised Date: February 12, 2012
  • Published Date: May 04, 2012
    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.
    • FullText(HTML)
    • References (29)
  • [1]
    Lappas T, Liu K, Terzi E. Finding a team of experts in so-cial networks. In Proc. the 15th ACM Int. Conference onKnowledge Discovery and Data Mining, June 28-July 1, 2009,pp.467-476.
    [2]
    Li C, Shan M. Team formation for generalized tasks in exper-tise social networks. In Proc. the 2nd SocialCom/PASSAT,Aug. 2010, pp.9-16.
    [3]
    Baykasoglu A, Dereli T, Das S. Project team selection usingfuzzy optimization approach. Cybernetics and Systems, 2007,38(2): 155-185.
    [4]
    Chen S J, Lin L. Modeling team member characteristics forthe formation of a multifunctional team in concurrent engi-neering. IEEE Transactions on Engineering Management,2004, 51(2): 111-124.
    [5]
    Wi H, Oh S, Mun J, Jung M. A team formation model basedon knowledge and collaboration. Expert Syst. Appl., July2009, 36(5): 9121-9134.
    [6]
    Zakarian A, Kusiak A. Forming teams: An analytical ap-proach. IIE Transactions, 1999, 31(1): 85-97.
    [7]
    Fitzpatrick E L, Askin R G. Forming effective worker teamswith multi-functional skill requirements. Journal of Compu-ters & Industrial Engineering, May 2005, 48(3): 593-608.
    [8]
    Gaston M, Simmons J, DesJardins M. Adapting networkstructures for efficient team formation. In Proc. the AA-MAS2004 Workshop on Learning and Evolution in Agent-Based Systems, July 2004.
    [9]
    Kautz H, Selman B, Shah M. The hidden Web. In Proc.the 13th Conference on Uncertainty in Artificial Intelligence,Aug. 1997, pp.27-36.
    [10]
    Cheatham M, Cleereman K. Application of social networkanalysis to collaborative team formation. In Proc. the Int.Symposium on Collaborative Technologies and Systems, May2006, pp.306-311.
    [11]
    Backstrom L, Huttenlocher D, Kleinberg J, Lan X. Groupformation in large social networks: Membership, growth and evolution. In Proc. the 12th ACM Int. Conference on Know-ledge Discovery and Data Mining, Aug. 2006, pp.44-54.
    [12]
    Boon B H, Siersksma G. Team formation: Matching qualitysupply and quality demand. European Journal of OperationalResearch, 2003, 148(3): 277-292.
    [13]
    Korvin A D, Shipley M F, Kleyle R. Utilizing fuzzy com-patibility of skill sets for team selection in multi-phaseprojects. Journal of Engineering and Technology Manage-ment, September 2002, 19(3-4): 307-319.
    [14]
    Dereli T, Baykasoglu A, Das G S. Fuzzy quality-team for-mation for value added auditing: A case study. Journal ofEngineering and Technology Management, December 2007,24(4): 366-394.
    [15]
    Liu N N, Yang Q. EigenRank: A ranking-oriented approachto collaborative filtering. In Proc. the 31st SIGIR, July 2008,pp.83-90.
    [16]
    Candillier L, Meyer F, Fessant F. Designing specific weightedsimilarity measures to improve collaborative filtering systems.In Proc. the 8th IEEE Int. Conference on ICDM, Dec. 2008,pp.242-255.
    [17]
    Faloutsos C, McCurley K S, Tomkins A. Fast discovery ofconnection subgraph. In Proc. the 10th ACM Int. Confe-rence on Knowledge Discovery and Data Mining, Aug. 2004,pp.118-127.
    [18]
    Tong H, Faloutsos C, Pan J Y. Fast random walk with restartand its application. In Proc. the 6th IEEE Int. Conferenceon Data Mining, Dec. 2006, pp. 613-622.
    [19]
    Tong H, Faloutsos C. Center-Piece subgraph: Problem defi-nition and fast solution. In Proc. the 12th ACM Int. Confe-rence on Knowledge Discovery and Data Mining, Aug. 2006,pp.404-413.
    [20]
    Tong H, Qu H, Jamjoom H, Faloutsos C. iPoG: Fast interac-tive proximity querying on graphs. In Proc. the 18th ACMInt. Conference on Information and Knowledge Manage-ment, Nov. 2009, pp.1673-1676.
    [21]
    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 andData Mining, Aug. 2007, pp.737-746.
    [22]
    Kasneci G, Ramanath M, Sozio M, Suchanek F M,Weikum G.STAR: Steiner-tree approximation in relationship graphs. InProc. the 25th IEEE Int. Conference on Data Engineering,March 29-April 2, 2009, pp.868-879.
    [23]
    Cheng J, Ke Y, Ng W, Yu J X. Context-aware object con-nection discovery in large graphs. In Proc. the IEEE Int.Conference on Data Engineering, 2009, pp.856-867.
    [24]
    Cheng J, Ke Y, Ng W. Efficient processing of group-orientedconnection queries in large graph. In Proc. the 18th ACMInt. Conference on Information and Knowledge Manage-ment, Nov. 2009, pp.1481-1484.
    [25]
    Resnick P, Iacovou N, Suchak M, Bergstrom P, Riedl J. Grou-pLens: An open architecture for collaborative filtering of net-news. In Proc. the Conference on Computer Supported Co-operative Work, Oct. 1994, pp.175-186.
    [26]
    Karypis G. Evaluation of item-based top-N recommendationalgorithms. In Proc. the 10th ACM Int. Conference on Infor-mation and Knowledge Management, Nov. 2001, pp.247-254.
    [27]
    Linden G, Smith B, York J. Amazon com recommendations:Item to item collaborative filtering. IEEE Internet Comput-ing, 2003, 7(1): 76-80.
    [28]
    Deshpande M, Karypis G. Item-based top-N recommenda-tion algorithms. ACM Transactions on Information Systems,2004, 22(1): 143-177.
    [29]
    Tarjan R E. Depth-first search and linear graph algorithms.SIAM Journal on Computing, 1972, 1(2): 146-160.
    • Relative Articles

  • Related Articles

    [1]Yue Kou, Dong Li, De-Rong Shen, Tie-Zheng Nie, Ge Yu. Incremental User Identification Across Social Networks Based on User-Guider Similarity Index[J]. Journal of Computer Science and Technology, 2022, 37(5): 1086-1104. DOI: 10.1007/s11390-022-2430-0
    [2]Mehdi Azaouzi, Lotfi Ben Romdhane. An Efficient Two-Phase Model for Computing Influential Nodes in Social Networks Using Social Actions[J]. Journal of Computer Science and Technology, 2018, 33(2): 286-304. DOI: 10.1007/s11390-018-1820-9
    [3]Yu Zhou, Jian-Bin Huang, Xiao-Lin Jia, He-Li Sun. On Participation Constrained Team Formation[J]. Journal of Computer Science and Technology, 2017, 32(1): 139-154. DOI: 10.1007/s11390-017-1710-6
    [4]Bo-Lei Zhang, Zhu-Zhong Qian, Wen-Zhong Li, Bin Tang, Sang-Lu Lu, Xiaoming Fu. Budget Allocation for Maximizing Viral Advertising in Social Networks[J]. Journal of Computer Science and Technology, 2016, 31(4): 759-775. DOI: 10.1007/s11390-016-1661-3
    [5]Hong Tang, Shuai Mu, Jin Huang, Jia Zhu, Jian Chen, Rui Ding. Zip: An Algorithm Based on Loser Tree for Common Contacts Searching in Large Graphs[J]. Journal of Computer Science and Technology, 2015, 30(4): 799-809. DOI: 10.1007/s11390-015-1561-y
    [6]Rafael Messias Martins, Gabriel Faria Andery, Henry Heberle, Fernando Vieira Paulovich, Alneu de Andrade Lopes, Helio Pedrini, Rosane Minghim. Multidimensional Projections for Visual Analysis of Social Networks[J]. Journal of Computer Science and Technology, 2012, 27(4): 791-810. DOI: 10.1007/s11390-012-1265-5
    [7]Jun Hu, Bing Wang, Yu Liu, De-Yi Li. Personalized Tag Recommendation Using Social Influence[J]. Journal of Computer Science and Technology, 2012, 27(3): 527-540. DOI: 10.1007/s11390-012-1241-0
    [8]Jian-Yun Liu, Yu-Hang Zhao, Zhao-Xiang Zhang, Yun-Hong Wang, Xue-Mei Yuan, Lei Hu, Zhen-Jiang Dong. Spam Short Messages Detection via Mining Social Networks[J]. Journal of Computer Science and Technology, 2012, 27(3): 506-514. DOI: 10.1007/s11390-012-1239-7
    [9]Zhi-Hao Wu, You-Fang Lin, Steve Gregory, Huai-Yu Wan, Student, Sheng-Feng Tian. Balanced Multi-Label Propagation for Overlapping Community Detection in Social Networks[J]. Journal of Computer Science and Technology, 2012, 27(3): 468-479. DOI: 10.1007/s11390-012-1236-x
    [10]Mao-Guo Gong, Ling-Jun Zhang, Jing-Jing Ma, Li-Cheng Jiao. Community Detection in Dynamic Social Networks Based on Multiobjective Immune Algorithm[J]. Journal of Computer Science and Technology, 2012, 27(3): 455-467. DOI: 10.1007/s11390-012-1235-y
    • Supplements (0)

Catalog

    Get Citation
    PDF
    XML
    Article views (22) PDF downloads (1673) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return