Temporal motifs reveal collaboration patterns in online task-oriented networks

被引:40
作者
Xuan, Qi [1 ,2 ]
Fang, Huiting [1 ]
Fu, Chenbo [1 ,2 ]
Filkov, Vladimir [2 ]
机构
[1] Zhejiang Univ Technol, Dept Automat, Hangzhou 310023, Zhejiang, Peoples R China
[2] Univ Calif Davis, Dept Comp Sci, Davis, CA 95616 USA
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Software design;
D O I
10.1103/PhysRevE.91.052813
中图分类号
O35 [流体力学]; O53 [等离子体物理学];
学科分类号
070204 ; 080103 ; 080704 ;
摘要
Real networks feature layers of interactions and complexity. In them, different types of nodes can interact with each other via a variety of events. Examples of this complexity are task-oriented social networks (TOSNs), where teams of people share tasks towards creating a quality artifact, such as academic research papers or software development in commercial or open source environments. Accomplishing those tasks involves both work, e.g., writing the papers or code, and communication, to discuss and coordinate. Taking into account the different types of activities and how they alternate over time can result in much more precise understanding of the TOSNs behaviors and outcomes. That calls for modeling techniques that can accommodate both node and link heterogeneity as well as temporal change. In this paper, we report on methodology for finding temporal motifs in TOSNs, limited to a system of two people and an artifact. We apply the methods to publicly available data of TOSNs from 31 Open Source Software projects. We find that these temporal motifs are enriched in the observed data. When applied to software development outcome, temporal motifs reveal a distinct dependency between collaboration and communication in the code writing process. Moreover, we show that models based on temporal motifs can be used to more precisely relate both individual developer centrality and team cohesion to programmer productivity than models based on aggregated TOSNs.
引用
收藏
页数:9
相关论文
共 55 条
  • [1] [Anonymous], 1988, P 1988 ACM C COMP SU
  • [2] [Anonymous], P ACM C COMP SUPP CO
  • [3] Scale-Free Networks: A Decade and Beyond
    Barabasi, Albert-Laszlo
    [J]. SCIENCE, 2009, 325 (5939) : 412 - 413
  • [4] Bertram D, 2010, 2010 ACM CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK, P291
  • [5] Bird Christian, 2006, P INT WORK C MIN SOF, P137
  • [6] Bird Christian, 2008, P 16 ACM SIGSOFT INT, P24
  • [7] Time-Ordered Networks Reveal Limitations to Information Flow in Ant Colonies
    Blonder, Benjamin
    Dornhaus, Anna
    [J]. PLOS ONE, 2011, 6 (05):
  • [8] A graph-theoretic perspective on centrality
    Borgatti, Stephen P.
    Everett, Martin G.
    [J]. SOCIAL NETWORKS, 2006, 28 (04) : 466 - 484
  • [9] Network Analysis in the Social Sciences
    Borgatti, Stephen P.
    Mehra, Ajay
    Brass, Daniel J.
    Labianca, Giuseppe
    [J]. SCIENCE, 2009, 323 (5916) : 892 - 895
  • [10] Braha D, 2009, UNDERST COMPLEX SYST, P39, DOI 10.1007/978-3-642-01284-6_3