Scan Statistics on Enron Graphs

Priebe, Carey E.; Conroy, John M.; Marchette, David J.; Park, Youngser

doi:10.1007/s10588-005-5378-z

Cited by 270 publications

(254 citation statements)

References 11 publications

Supporting

Mentioning

244

Contrasting

Order By: Relevance

“…The original experiment first introduced in [8,11] used the Enron email database [57]. We here replicate this experiment to illustrate the benefits of our HALS algorithm for DEDICOM.…”

Section: Analysis Of Enron Email Databasementioning

confidence: 98%

Extended HALS algorithm for nonnegative Tucker decomposition and its applications for multiway analysis and classification

Phan

Cichocki

2011

Neurocomputing

View full text Add to dashboard Cite

“…The original experiment first introduced in [8,11] used the Enron email database [57]. We here replicate this experiment to illustrate the benefits of our HALS algorithm for DEDICOM.…”

Section: Analysis Of Enron Email Databasementioning

confidence: 98%

Extended HALS algorithm for nonnegative Tucker decomposition and its applications for multiway analysis and classification

Phan

Cichocki

2011

Neurocomputing

View full text Add to dashboard Cite

“…They present a case that word use among those with alleged criminal activity may be "slightly distinctive." Priebe, Conroy, Marchette, and Park [31] introduced a theory of scan statistics on graphs and applied them to the problem of anomaly detection using a time series of Enron email graphs.…”

Section: Enron Data and Social Network Analysismentioning

confidence: 99%

“…This paper seeks to analyze those evolving patterns by studying semantic graphs where the edges have labels (in our case, the edges are labeled with a timestamp). These representations have also been called time graphs [27] or a time series of graphs [31].…”

Section: Introductionmentioning

confidence: 99%

Temporal analysis of social networks using three-way DEDICOM.

Bader¹,

Harshman²,

Kolda

2006

View full text Add to dashboard Cite

DEDICOM is an algebraic model for analyzing intrinsically asymmetric relationships, such as the balance of trade among nations or the flow of information among organizations or individuals. It provides information on latent components in the data that can be regarded as "properties" or "aspects" of the objects, and it finds a few patterns that can be combined to describe many relationships among these components. When we apply this technique to adjacency matrices arising from directed graphs, we obtain a smaller graph that gives an idealized description of its patterns. Three-way DEDICOM is a higher-order extension of the model that has certain uniqueness properties. It allows for a third mode of the data, such as time, and permits the analysis of semantic graphs. We present an improved algorithm for computing three-way DEDICOM on sparse data and demonstrate it by applying it to the adjacency tensor of a semantic graph with time-labeled edges. Our application uses the Enron email corpus, from which we construct a semantic graph corresponding to email exchanges among Enron personnel over a series of 44 months. Meaningful patterns are recovered in which the representation of asymmetries adds insight into the social networks at Enron.

show abstract

“…In Diesner and Carley (2005) authors investigate the Enron email data set from a social network analytic perspective; various network analytic techniques are applied. In Priebe et al (2005) the authors introduce a theory of scan statistics on graphs and apply the ideas to the problem of anomaly detection in a time series of Enron email graphs. In McCallum et al (2005) the authors apply the Author-RecipeintTopic (ART) model for social network analysis on Enron email data set.…”

Section: Introductionmentioning

confidence: 99%

Graph Theoretic and Spectral Analysis of Enron Email Data

Chapanond

Krishnamoorthy

Yener

2005

Comput Math Organiz Theor

View full text Add to dashboard Cite

Analysis of social networks to identify communities and model their evolution has been an active area of recent research. This paper analyzes the Enron email data set to discover structures within the organization. The analysis is based on constructing an email graph and studying its properties with both graph theoretical and spectral analysis techniques. The graph theoretical analysis includes the computation of several graph metrics such as degree distribution, average distance ratio, clustering coefficient and compactness over the email graph. The spectral analysis shows that the email adjacency matrix has a rank-2 approximation. It is shown that preprocessing of data has significant impact on the results, thus a standard form is needed for establishing a benchmark data.

show abstract

Scan Statistics on Enron Graphs

Abstract: We introduce a theory of scan statistics on graphs and apply the ideas to the problem of anomaly detection in a time series of Enron email graphs. *

Cited by 270 publications

References 11 publications

Extended HALS algorithm for nonnegative Tucker decomposition and its applications for multiway analysis and classification

Extended HALS algorithm for nonnegative Tucker decomposition and its applications for multiway analysis and classification

Temporal analysis of social networks using three-way DEDICOM.

Graph Theoretic and Spectral Analysis of Enron Email Data

Contact Info

Product

Resources

About