Discovering Organizational Hierarchy through a Corporate Ranking Algorithm: The Enron Case

Germán G. Creamer, Salvatore J. Stolfo, Mateo Creamer, Shlomo Hershkop, Ryan Rowe and Ning Cai
Authors registered in the RePEc Author Service: German G Creamer

Complexity, 2022, vol. 2022, 1-18

Abstract: 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.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2022/8154476.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2022/8154476.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:8154476

DOI: 10.1155/2022/8154476

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem (mohamed.abdelhakeem@hindawi.com).