TY - JOUR
T1 - Discovering Organizational Hierarchy through a Corporate Ranking Algorithm
T2 - The Enron Case
AU - Creamer, Germán G.
AU - Stolfo, Salvatore J.
AU - Creamer, Mateo
AU - Hershkop, Shlomo
AU - Rowe, Ryan
N1 - Publisher Copyright: © 2022 Germán G. Creamer et al.
PY - 2022
Y1 - 2022
N2 - This paper proposes the CorpRank algorithm to extract social hierarchies from electronic communication data. The algorithm computes a ranking score for each user as a weighted combination of the number of emails, the number of responses, average response time, clique scores, and several degree and centrality measures. The algorithm uses principal component analysis to calculate the weights of the features. This score ranks users according to their importance, and its output is used to reconstruct an organization chart. We illustrate the algorithm over real-world data using the Enron corporation's e-mail archive. Compared to the actual corporate work chart, compensation lists, judicial proceedings, and analyzing the major players involved, the results show promise.
AB - This paper proposes the CorpRank algorithm to extract social hierarchies from electronic communication data. The algorithm computes a ranking score for each user as a weighted combination of the number of emails, the number of responses, average response time, clique scores, and several degree and centrality measures. The algorithm uses principal component analysis to calculate the weights of the features. This score ranks users according to their importance, and its output is used to reconstruct an organization chart. We illustrate the algorithm over real-world data using the Enron corporation's e-mail archive. Compared to the actual corporate work chart, compensation lists, judicial proceedings, and analyzing the major players involved, the results show promise.
UR - http://www.scopus.com/inward/record.url?scp=85126382314&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85126382314&partnerID=8YFLogxK
U2 - 10.1155/2022/8154476
DO - 10.1155/2022/8154476
M3 - Article
SN - 1076-2787
VL - 2022
JO - Complexity
JF - Complexity
M1 - 8154476
ER -