Analyzing Communication Interaction Networks (CINs) in enterprises and inferring hierarchies

作者: Yi Wang , Marios Iliofotou , Michalis Faloutsos , Bin Wu

DOI: 10.1016/J.COMNET.2012.11.028

关键词: Computer scienceZero (linguistics)Rank (computer programming)RankingClustering coefficientKey (cryptography)Knowledge managementAssortativityData scienceHierarchyEmpirical research

摘要: With the proliferation of electronic modes communication (e.g., e-mails, short messages), employees inside an enterprise can form several distinct Communication Interaction Networks, or CINs for short. A CIN is essentially a graph representation ''who talks to whom'' among group individuals. In this paper, we conduct empirical study two modern enterprises and focus on three main questions: (Q1) How from look; (Q2) use different available within enterprise; (Q3) By only using CINs, how much information extract regarding hierarchy in enterprise. We address these questions Enron Corporation provider, exchange phone-calls, messages (SMS). For Q1, reveal following key structural properties that are shared by all our study: they have high edge density, clustering coefficient, close zero assortativity coefficient. Q2, observe differences various modes. This suggests capture behavioral Q3, propose HumanRank, method ranking individuals based their importance CEOs having higher rank than ordinary employees) interactions between them. Next, introduce unsupervised parameter-free algorithm identifies hierarchies separating managers employees. Our achieves above 70% accuracy outperforms state-of-the-art [23].

参考文章(25)
P. Pardalos, J. Abello, M. G. C. Resende, On maximum clique problems in very large graphs External memory algorithms. pp. 119- 130 ,(1999)
Deepayan Chakrabarti, Christos Faloutsos, Yiping Zhan, R-MAT: A Recursive Model for Graph Mining siam international conference on data mining. pp. 442- 446 ,(2004)
Peter Pockley, Australian advisory body's first target is to reduce land salinity Nature. ,vol. 393, pp. 400- 400 ,(1998) , 10.1038/30795
Rajeev Motwani, Terry Winograd, Lawrence Page, Sergey Brin, The PageRank Citation Ranking : Bringing Order to the Web the web conference. ,vol. 98, pp. 161- 172 ,(1999)
Q. Chen, H. Chang, R. Govindan, S. Jamin, S. Shenker, W. Willinger, The origin of power laws in Internet topologies revisited international conference on computer communications. ,vol. 2, pp. 608- 617 ,(2002) , 10.1109/INFCOM.2002.1019306
Michalis Faloutsos, Petros Faloutsos, Christos Faloutsos, On power-law relationships of the Internet topology acm special interest group on data communication. ,vol. 29, pp. 251- 262 ,(1999) , 10.1145/316188.316229
Albert-László Barabási, Réka Albert, Emergence of Scaling in Random Networks Science. ,vol. 286, pp. 509- 512 ,(1999) , 10.1126/SCIENCE.286.5439.509
Jitesh Shetty, Jafar Adibi, Discovering important nodes through graph entropy the case of Enron email database Proceedings of the 3rd international workshop on Link discovery - LinkKDD '05. pp. 74- 81 ,(2005) , 10.1145/1134271.1134282
M. E. J. Newman, Assortative mixing in networks. Physical Review Letters. ,vol. 89, pp. 208701- 208701 ,(2002) , 10.1103/PHYSREVLETT.89.208701