Scan Statistics on Enron Graphs |
| |
Authors: | Email author" target="_blank">Carey?E?PriebeEmail author John?M?Conroy David?J?Marchette Youngser?Park |
| |
Institution: | (1) Johns Hopkins University, Baltimore, MD;(2) IDA Center for Computing Sciences, Bowie, MD;(3) NSWC B10, Dahlgren, VA |
| |
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.
Previous presentation: Workshop on Link Analysis, Counterterrorism and Security at the SIAM International Conference on Data
Mining, Newport Beach, CA, April 23, 2005.
Carey E. Priebe received the B.S. degree in mathematics from Purdue University in 1984, the M.S. degree in computer science from San Diego
State University in 1988, and the Ph.D. degree in information technology (computational statistics) from George Mason University
in 1993. From 1985 to 1994 he worked as a mathematician and scientist in the US Navy research and development laboratory system.
Since 1994 he has been a professor in the Department of Applied Mathematics and Statistics, Whiting School of Engineering,
Johns Hopkins University, Baltimore, Maryland. At Johns Hopkins, he holds joint appointments in the Department of Computer
Science and the Center for Imaging Science. He is a past President of the Interface Foundation of North America—Computing
Science & Statistics, a past Chair of the Section on Statistical Computing of the American Statistical Association, and on
the editorial boards of Journal of Computational and Graphical Statistics, Computational Statistics and Data Analysis, and
Computational Statistics. His research interests are in computational statistics, kernel and mixture estimates, statistical
pattern recognition, statistical image analysis, and statistical inference for high-dimensional and graph data. He was elected
Fellow of the American Statistical Association in 2002.
John M. Conroy received a B.S. in Mathematics from Saint Joseph's University in 1980 and a Ph.D. in Applied Mathematics from the University
of Maryland in 1986. Since then he has been a research staff member for the IDA Center for Computing Sciences in Bowie, MD.
His research interest is applications of numerical linear algebra. He is a member of the Society for Industrial and Applied
Mathematics, Institute of Electrical and Electronics Engineers (IEEE), and the Association for Computational Linguistics.
David J. Marchette received a B.A. in 1980, and an M.A. in mathematics in 1982, from the University of California at San Diego. He received
a Ph.D. in Computational Sciences and Informatics in 1996 from George Mason University under the direction of Ed Wegman. From
1985–1994 he worked at the Naval Ocean Systems Center in San Diego doing research on pattern recognition and computational
statistics. In 1994 he moved to the Naval Surface Warfare Center in Dahlgren Virginia where he does research in computational
statistics and pattern recognition, primarily applied to image processing, text processing, automatic target recognition and
computer security. Dr. Marchette is a Fellow of the American Statistical Society.
Youngser Park received the B.E. degree in electrical engineering from Inha University in Korea in 1985, the M.S. degree in computer science
from The George Washington University in 1991, and had pursued a doctoral degree there. From 1998 to 2000 he worked at the
Johns Hopkins Medical Institutes as a senior research engineer. Since 2003 he is working as a research analyst in the Center
for Imaging Science at the Johns Hopkins University. His research interests are clustering algorithm, pattern classification,
and data mining. |
| |
Keywords: | Enron email data time series of graphs scan statistics statistical inference anomaly detection |
本文献已被 SpringerLink 等数据库收录! |
|